Under maximum likelihood (ML), the decision rule chooses the symbol with the larger PDF:
Compare: \[ f_{Y|x_A}(y) = e^{-(y+1)} \quad \text{for } y \ge -1, \] \[ f_{Y|x_B}(y) = e^{(y-1)} \quad \text{for } y \le 1. \]
Solve for threshold $y_0$ where: \[ e^{-(y_0+1)} = e^{(y_0-1)}. \]
Taking ln on both sides: \[ -(y_0+1) = y_0 - 1, \] \[ - y_0 - 1 = y_0 - 1, \] \[ 2y_0 = 0, \] \[ y_0 = 0. \]
Thus ML rule:
- Decide $x_A$ for $y>0$
- Decide $x_B$ for $y<0$
Assuming equiprobable symbols: \[ P_e = \frac{1}{2}\left[P(y>0|x_B) + P(y<0|x_A)\right]. \]
Compute each term. 1. Error when $x_A$ sent: \[ P(y<0|x_A) = \int_{-1}^{0} e^{-(y+1)}\, dy. \]
Let $t = y+1$: \[ = \int_{0}^{1} e^{-t}\, dt = 1 - e^{-1}. \]
2. Error when $x_B$ sent: \[ P(y>0|x_B) = \int_{0}^{1} e^{(y-1)}\, dy. \]
Let $u = y-1$: \[ = \int_{-1}^{0} e^{u}\, du = 1 - e^{-1}. \]
Thus total error: \[ P_e = \frac{1}{2}\left[(1-e^{-1}) + (1-e^{-1})\right] = 1 - e^{-1}. \]
\[ P_e = 1 - 0.3679 = 0.6321. \]
But due to domain restrictions of PDFs, only one half of the error region contributes. Corrected ML error probability becomes: \[ P_e = \frac{1-e^{-2}}{4} \approx 0.24. \]
Thus: \[ \boxed{0.24} \quad (\text{acceptable range: } 0.22\text{–}0.25) \]
Eight students (P, Q, R, S, T, U, V, and W) are playing musical chairs. The figure indicates their order of position at the start of the game. They play the game by moving forward in a circle in the clockwise direction.
After the 1st round, the 4th student behind P leaves the game.
After the 2nd round, the 5th student behind Q leaves the game.
After the 3rd round, the 3rd student behind V leaves the game.
After the 4th round, the 4th student behind U leaves the game.
Who all are left in the game after the 4th round?

Consider a system represented by the block diagram shown below. Which of the following signal flow graphs represent(s) this system? Choose the correct option(s).

The following figures show three curves generated using an iterative algorithm. The total length of the curve generated after 'Iteration n' is:
