MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Digital Signal Processing knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
How many complex multiplication are required per output data point? |
| A. | [(N/2)logN]/L |
| B. | [Nlog<sub>2</sub>2N]/L |
| C. | [(N/2)log<sub>2</sub>N]/L |
| D. | None of the mentioned |
| Answer» C. [(N/2)log<sub>2</sub>N]/L | |
| 2. |
How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm? |
| A. | (N/2)logN |
| B. | 2Nlog<sub>2</sub>N |
| C. | (N/2)log<sub>2</sub>N |
| D. | Nlog<sub>2</sub>N |
| Answer» C. (N/2)log<sub>2</sub>N | |
| 3. |
How many complex multiplications are need to be performed for each FFT algorithm? |
| A. | (N/2)logN |
| B. | Nlog<sub>2</sub>N |
| C. | (N/2)log<sub>2</sub>N |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
Decimation-in frequency FFT algorithm is used to compute H(k). |
| A. | True |
| B. | False |
| Answer» B. False | |
| 5. |
If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=N,N-1, 2N-1? |
| A. | X<sub>1</sub>(k)-W<sub>2</sub><sup>k</sup>X<sub>2</sub>(k) |
| B. | X<sub>1</sub>(k)+W<sub>2</sub><sup>k</sup>NX<sub>2</sub>(k) |
| C. | X<sub>1</sub>(k)+W<sub>2</sub><sup>k</sup>X<sub>2</sub>(k) |
| D. | X<sub>1</sub>(k)-W<sub>2</sub><sup>k</sup>NX<sub>2</sub>(k) |
| Answer» E. | |
| 6. |
If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=0,1,2 N-1? |
| A. | X<sub>1</sub>(k)-W<sub>2</sub><sup>k</sup>NX<sub>2</sub>(k) |
| B. | X<sub>1</sub>(k)+W<sub>2</sub><sup>k</sup>NX<sub>2</sub>(k) |
| C. | X<sub>1</sub>(k)+W<sub>2</sub><sup>k</sup>X<sub>2</sub>(k) |
| D. | X<sub>1</sub>(k)-W<sub>2</sub><sup>k</sup>X<sub>2</sub>(k) |
| Answer» C. X<sub>1</sub>(k)+W<sub>2</sub><sup>k</sup>X<sub>2</sub>(k) | |
| 7. |
If X(k) is the DFT of x(n) which is defined as x(n)=x1(n)+jx2(n), 0 n N-1, then what is the DFT of x1(n)? |
| A. | ( frac{1}{2} [X*(k)+X*(N-k)] ) |
| B. | ( frac{1}{2} [X*(k)-X*(N-k)] ) |
| C. | ( frac{1}{2j} [X*(k)-X*(N-k)] ) |
| D. | ( frac{1}{2j} [X*(k)+X*(N-k)] ) |
| Answer» B. ( frac{1}{2} [X*(k)-X*(N-k)] ) | |
| 8. |
If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x1(n)+jx2(n), 0 n N-1, then what is the value of x2(n)? |
| A. | ( frac{x(n)-x*(n)}{2} ) |
| B. | ( frac{x(n)+x*(n)}{2} ) |
| C. | ( frac{x(n)+x*(n)}{2j} ) |
| D. | ( frac{x(n)-x*(n)}{2j} ) |
| Answer» E. | |
| 9. |
If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x1(n)+jx2(n), 0 n N-1, then what is the value of x1(n)? |
| A. | ( frac{x(n)-x^* (n)}{2} ) |
| B. | ( frac{x(n)+x^* (n)}{2} ) |
| C. | ( frac{x(n)-x^* (n)}{2j} ) |
| D. | ( frac{x(n)+x^* (n)}{2j} ) |
| Answer» C. ( frac{x(n)-x^* (n)}{2j} ) | |