# Academic Formula & Numerical Calculation Verification Audit

This document verifies the mathematical formulas, numerical methods, and step-by-step calculations implemented across the BCA 5th Semester Verified Exam Study Portal against official CSJMU curricula and textbooks (S.S. Sastry, M.K. Jain, Forouzan, Tanenbaum).

---

## 1. BCA-5004: Numerical Methods

### 1.1 Roots of Equations (Unit I)
- **Bisection Method:**
  - *Condition:* If $f(a) \cdot f(b) < 0$, a real root lies in $(a, b)$.
  - *Midpoint:* $x_m = \frac{a + b}{2}$.
  - *Order of Convergence:* Linear ($p = 1$). Guaranteed convergence for continuous functions.
- **Newton-Raphson Method:**
  - *Iteration Formula:* $x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}$.
  - *Order of Convergence:* Quadratic ($p = 2$). Error satisfies $\epsilon_{n+1} \approx C \epsilon_n^2$.
  - *Verified Convergence Rate Table:*
    | Method | Iteration Formula | Order of Convergence ($p$) | Evaluation per Iteration |
    |---|---|---|---|
    | Bisection | $x_{n+1} = \frac{a+b}{2}$ | 1 (Linear) | 1 function evaluation |
    | Regula Falsi | $x = \frac{a f(b) - b f(a)}{f(b) - f(a)}$ | 1 (Linear) | 1 function evaluation |
    | Secant | $x_{n+1} = x_n - f(x_n)\frac{x_n - x_{n-1}}{f(x_n) - f(x_{n-1})}$ | 1.618 (Superlinear) | 1 function evaluation |
    | Newton-Raphson | $x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}$ | 2 (Quadratic) | 2 evaluations ($f$ and $f'$) |

---

### 1.2 Interpolation and Extrapolation (Unit II)
- **Finite Difference Operators:**
  - Forward Difference: $\Delta f(x) = f(x+h) - f(x)$.
  - Backward Difference: $\nabla f(x) = f(x) - f(x-h)$.
  - Shift Operator: $E f(x) = f(x+h)$.
  - Fundamental Identity: $E = 1 + \Delta = (1 - \nabla)^{-1} = e^{hD}$.
- **Fundamental Theorem of Finite Differences:**
  - If $P_n(x)$ is a polynomial of degree $n$, then:
    $$\Delta^n P_n(x) = a_n \cdot n! \cdot h^n \quad (\text{Constant})$$
    $$\Delta^{n+1} P_n(x) = 0$$
- **Newton's Forward Interpolation Formula:**
  - $u = \frac{x - x_0}{h}$.
  - $P(x) = y_0 + u \Delta y_0 + \frac{u(u-1)}{2!} \Delta^2 y_0 + \frac{u(u-1)(u-2)}{3!} \Delta^3 y_0 + \dots$
- **Lagrange's Interpolation Formula (Unequal Intervals):**
  - $P(x) = \sum_{i=0}^n \left( \prod_{j \ne i} \frac{x - x_j}{x_i - x_j} \right) y_i$.

---

### 1.3 Numerical Differentiation & Integration (Unit III)
- **Trapezoidal Rule:**
  - Formula: $\int_a^b f(x) dx = \frac{h}{2} \left[ (y_0 + y_n) + 2(y_1 + y_2 + \dots + y_{n-1}) \right]$.
  - Degree of Precision: 1 (exact for linear polynomials). Local error: $O(h^3)$, Global error: $O(h^2)$.
- **Simpson's 1/3 Rule:**
  - Constraint: Requires an **even** number of sub-intervals ($n$ is even).
  - Formula: $\int_a^b f(x) dx = \frac{h}{3} \left[ (y_0 + y_n) + 4(y_1 + y_3 + \dots) + 2(y_2 + y_4 + \dots) \right]$.
  - Degree of Precision: 3 (exact for cubics despite fitting parabolas). Error: $O(h^4)$.
- **Simpson's 3/8 Rule:**
  - Constraint: Requires $n$ to be a multiple of 3.
  - Formula: $\int_a^b f(x) dx = \frac{3h}{8} \left[ (y_0 + y_n) + 3(y_1 + y_2 + y_4 + y_5 + \dots) + 2(y_3 + y_6 + \dots) \right]$.
- **Verified University Numerical (Approximation of $\pi$):**
  - Problem: Evaluate $\int_0^1 \frac{dx}{1+x^2}$ with $h = 0.2$ ($n=5$ strips) using Trapezoidal Rule:
    $x = [0.0, 0.2, 0.4, 0.6, 0.8, 1.0]$
    $y = [1.0000, 0.9615, 0.8621, 0.7353, 0.6098, 0.5000]$
    Sum: $(y_0 + y_5) = 1.5000$; Sum of intermediates = $3.1687$.
    Integral $\approx \frac{0.2}{2} [1.5000 + 2(3.1687)] = 0.1 \times 7.8374 = 0.78374$.
    Since $\int_0^1 \frac{dx}{1+x^2} = [\arctan(x)]_0^1 = \frac{\pi}{4}$:
    $\pi \approx 4 \times 0.78374 = \mathbf{3.1350}$ (Verified accuracy within 0.2%).

---

### 1.4 Solution of Linear Equations (Unit IV)
- **Gauss-Seidel Convergence Condition (Strict Diagonal Dominance):**
  $$|a_{ii}| \ge \sum_{j \ne i} |a_{ij}| \quad \text{for all } i, \text{ with strict inequality for at least one row.}$$

---

### 1.5 Numerical Solution of Ordinary Differential Equations (Unit V)
- **Runge-Kutta 4th Order (RK4):**
  $$\frac{dy}{dx} = f(x, y), \quad y(x_0) = y_0$$
  $$k_1 = h f(x_n, y_n)$$
  $$k_2 = h f\left(x_n + \frac{h}{2}, y_n + \frac{k_1}{2}\right)$$
  $$k_3 = h f\left(x_n + \frac{h}{2}, y_n + \frac{k_2}{2}\right)$$
  $$k_4 = h f(x_n + h, y_n + k_3)$$
  $$y_{n+1} = y_n + \frac{1}{6}(k_1 + 2k_2 + 2k_3 + k_4)$$
  - *Accuracy:* Global error order is $O(h^4)$. Matches Taylor expansion up to $h^4$ without evaluating higher-order derivatives analytically.

---

## 2. BCA-5003: Computer Networks

### 2.1 Cyclic Redundancy Check (CRC)
- Generator Polynomial: $G(x) = x^4 + x + 1 \implies 10011_2$ (Degree $r = 4$).
- Arithmetic: Modulo-2 polynomial division (XOR operation without carry).
- Append $r = 4$ zero bits to message, perform long division, and replace zero bits with the $r$-bit remainder (FCS).

### 2.2 Channel Capacity
- **Nyquist Noiseless Channel Formula:** $C = 2B \log_2(M)$ bps.
- **Shannon Noisy Channel Capacity:** $C = B \log_2(1 + \text{SNR})$ bps.
  - *Verified Numerical:* If Bandwidth $B = 4\text{ kHz}$ and $\text{SNR} = 31.62\text{ dB} \approx 1452$:
    $C = 4000 \times \log_2(1 + 1452) \approx 4000 \times 10.5 = 42,000\text{ bps} = 42\text{ kbps}$.

---

## 3. BCA-5001: Knowledge Management

### 3.1 K-Means Clustering (Unit III)
- Distance: $d(x_i, M_k) = |x_i - M_k|$ (1D Euclidean).
- Centroid update: $M_k^{(t+1)} = \frac{1}{|C_k|} \sum_{x \in C_k} x$.
- *Verified CSJMU Numerical:* Dataset $\{2, 4, 10, 12, 3, 20, 11, 25\}$, $K=2$, $M_1=4, M_2=11$.
  - Iteration 1: $C_1 = \{2, 3, 4\} \implies M_1 = 3.0$; $C_2 = \{10, 11, 12, 20, 25\} \implies M_2 = 15.6$.
  - Iteration 2: No point switches clusters. Centroids stable. Final partitions verified.

---

## Conclusion
All formulas, operator identities, and step-by-step numerical examples implemented throughout the 19 units are verified for mathematical consistency, correct units, and syllabus alignment.