 
			 
			MCQOPTIONS
 Saved Bookmarks
				This section includes 7 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. | The system described by the equation y(n)=ay(n+1)+b x(n) is a recursive system. | 
| A. | True | 
| B. | False | 
| Answer» C. | |
| 2. | Which of the following is a recursive form of a non-recursive system described by the equation y(n)= ( frac{1}{M+1} sum_{k=0}^Mx(n-k) )? | 
| A. | y(n)=y(n-1)+ ( frac{1}{M+1} )[x(n)+x(n-1-M)] | 
| B. | y(n)=y(n-1)+ ( frac{1}{M+1} )[x(n)+x(n-1+M)] | 
| C. | y(n)=y(n-1)+ ( frac{1}{M+1} )[x(n)-x(n-1+M)] | 
| D. | y(n)=y(n-1)+ ( frac{1}{M+1} )[x(n)-x(n-1-M)] | 
| Answer» E. | |
| 3. | What is the form of the FIR system to compute the moving average of the signal x(n)? | 
| A. | y(n)= ( frac{1}{M+1} sum_{k=0}^M x(n-k) ) | 
| B. | y(n)= ( frac{1}{M+1} sum_{k=0}^M x(n+k) ) | 
| C. | y(n)= ( frac{1}{M+1} sum_{k=0}^{ infty} x(n-k) ) | 
| D. | None of the mentioned | 
| Answer» B. y(n)= ( frac{1}{M+1} sum_{k=0}^M x(n+k) ) | |
| 4. | An FIR system is also called as recursive system . | 
| A. | True | 
| B. | False | 
| Answer» C. | |
| 5. | Which of the following is the difference equation of a special case of FIR system? | 
| A. | y(n) = ( sum_{k=0}^{M} b_k x(n-k) ) | 
| B. | y(n) = (a_0y(n)- sum_{k=1}^{N} a_k y(n-k) ) | 
| C. | y(n) = (- sum_{k=1}^{N} a_k y(n-k) ) | 
| D. | None of the mentioned | 
| Answer» B. y(n) = (a_0y(n)- sum_{k=1}^{N} a_k y(n-k) ) | |
| 6. | Which of the following linear time invariant system is a purely recursive system? | 
| A. | y(n) = (- sum_{k=1}^{N} a_k y(n-k)+ sum_{k=0}^{M} b_k x(n-k) ) | 
| B. | y(n) = ( sum_{k=1}^{N} a_k y(n-k)+ sum_{k=0}^{M} b_k x(n-k) ) | 
| C. | y(n) = (- sum_{k=1}^{N} a_k y(n-k)- sum_{k=0}^{M} b_k x(n-k) ) | 
| D. | y(n) = (- sum_{k=1}^{N} a_k y(n-k)+b_0x(n) ) | 
| Answer» E. | |
| 7. | To implement the linear time invariant recursive system described by the difference equation y(n)= (- sum_{k=1}^N a_k y(n-k)+ sum_{k=0}^M b_k x(n-k) ) in Direct form-I, how many number of delay elements and multipliers are required respectively? | 
| A. | M+N+1, M+N | 
| B. | M+N-1, M+N | 
| C. | M+N, M+N+1 | 
| D. | None of the mentioned | 
| Answer» D. None of the mentioned | |