The frequency of occurrence of 8 symbols (a-h) is shown in the table below. A symbol is chosen and it is determined by asking a series of "yes/no" questions which are assumed to be truthfully answered. The average number of questions when asked in the most efficient sequence, to determine the chosen symbol, is ___________ (rounded off to two decimal places). 
To find the average number of yes/no questions needed to determine the chosen symbol, we use the concept of entropy in information theory.
Entropy \(H\) is calculated by:
\(H = -\sum_{i=1}^{n} p_i \log_2 p_i\)
where \(p_i\) is the probability of symbol \(i\) and \(n\) is the total number of symbols.
The probabilities are:
| Symbol | Probability |
|---|---|
| a | 1/2 |
| b | 1/4 |
| c | 1/8 |
| d | 1/16 |
| e | 1/32 |
| f | 1/64 |
| g | 1/128 |
| h | 1/128 |
Calculating each term:
Summing up all these values gives the entropy:
\(H = 0.5 + 0.5 + 0.375 + 0.25 + 0.15625 + 0.09375 + 0.0625 + 0.0625 = 1.96875\)
Thus, the average number of questions is 1.97, which fits within the given range [1.97, 1.97].
Signals and their Fourier Transforms are given in the table below. Match LIST-I with LIST-II and choose the correct answer.
| LIST-I | LIST-II |
|---|---|
| A. \( e^{-at}u(t), a>0 \) | I. \( \pi[\delta(\omega - \omega_0) + \delta(\omega + \omega_0)] \) |
| B. \( \cos \omega_0 t \) | II. \( \frac{1}{j\omega + a} \) |
| C. \( \sin \omega_0 t \) | III. \( \frac{1}{(j\omega + a)^2} \) |
| D. \( te^{-at}u(t), a>0 \) | IV. \( -j\pi[\delta(\omega - \omega_0) - \delta(\omega + \omega_0)] \) |