Scribd
Upload
253 views6 pages

Sample MCQ Unit II

The document contains 20 multiple choice questions about digital signal processing topics like direct form realizations of IIR filters, signal flow graphs, the discrete Fourier transform, and the fast Fourier transform algorithm. The questions test understanding of concepts like the number of multiplications, additions, and memory locations required for different DFT realizations, properties of the DFT and its pairs, using the DFT for linear filtering, and the computational complexity of the FFT algorithm.

Uploaded by

Nikhil Mathur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
253 views6 pages

Sample MCQ Unit II

The document contains 20 multiple choice questions about digital signal processing topics like direct form realizations of IIR filters, signal flow graphs, the discrete Fourier transform, and the fast Fourier transform algorithm. The questions test understanding of concepts like the number of multiplications, additions, and memory locations required for different DFT realizations, properties of the DFT and its pairs, using the DFT for linear filtering, and the computational complexity of the FFT algorithm.

Uploaded by

Nikhil Mathur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

DSP ECE303

MCQ for Unit II

1. If M and N are the orders of numerator and denominator of rational system function
respectively, then how many multiplications are required in direct form-I realization of
that IIR filter?
a) M+N-1
b) M+N
c) M+N+1
d) M+N+2
Answer: c
Explanation: From the direct form-I realization of the IIR filter, if M and N are the orders
of numerator and denominator of rational system function respectively, then M+N+1
multiplication are required.
2. If M and N are the orders of numerator and denominator of rational system function
respectively, then how many additions are required in direct form-I realization of that IIR
filter?
a) M+N-1
b) M+N
c) M+N+1
d) M+N+2
Answer: b
Explanation: From the direct form-I realization of the IIR filter, if M and N are the orders
of numerator and denominator of rational system function respectively, then M+N
additions are required.
3. If M and N are the orders of numerator and denominator of rational system function
respectively, then how many memory locations are required in direct form-I realization of
that IIR filter?
a) M+N+1
b) M+N
c) M+N-1
d) M+N-2
Answer: a
Explanation: From the direct form-I realization of the IIR filter, if M and N are the orders
of numerator and denominator of rational system function respectively, then M+N+1
memory locations are required.
4.  In direct form-I realization, all-pole system is placed before the all-zero system.
a) True
b) False
Answer: b
Explanation: In direct form-I realization, all-zero system is placed before the all-pole
system.
5. If M and N are the orders of numerator and denominator of rational system function
respectively, then how many memory locations are required in direct form-II realization
of that IIR filter?
a) M+N+1
b) M+N
c) Min [M,N]
d) Max [M,N]
Answer: d
Explanation: From the direct form-II realization of the IIR filter, if M and N are the
orders of numerator and denominator of rational system function respectively, then
Max[M,N] memory locations are required.
6. The basic elements of a flow graph are branches and nodes.
a) True
b) False
Answer: a
Explanation: A signal flow graph provides an alternative, but an equivalent graphical
representation to a block diagram structure that we have been using to illustrate various
system realization. The basic elements of a flow graph are branches and nodes.
7. Which of the following is true for the given signal flow graph?

a) Two pole system


b) Two zero system
c) Two pole and two zero system
d) None of the mentioned
Answer: c
Explanation: The equivalent filter structure of the given signal flow graph in the direct
form-II is given by as
Thus from the above structure, the system has two zeros and two poles.
8. What are the nodes that replace the adders in the signal flow graphs?
a) Source node
b) Sink node
c) Branch node
d) Summing node
Answer: d
Explanation: Summing node is the node which is used in the signal flow graph which
replaces the adder in the structure of a filter.
9. The structure shown below is known as:

a) Parallel form structure


b) Cascade structure
c) Direct form
d) None of the mentioned
Answer: a
Explanation: From the given figure, it consists of a parallel bank of single pole filters and
thus it is called as parallel form structure.
10. If we reverse the directions of all branch transmittances and interchange the input and
output in the flow graph, then the resulting structure is called as:
a) Direct form-I
b) Transposed form
c) Direct form-II
d) None of the mentioned
Answer: b
Explanation: According to the transposition or flow-graph reversal theorem, if we reverse
the directions of all branch transmittances and interchange the input and output in the
flow graph, then the system remains unchanged. The resulting structure is known as
transposed structure or transposed form.
11.  If x(n) and X(k) are an N-point DFT pair, then x(n+N)=x(n).
a) True
b) False
Answer: a
12. If x(n) and X(k) are an N-point DFT pair, then X(k+N)=?
a) X(-k)
b) -X(k)
c) X(k)
d) None of the mentioned
Answer: c
13. If X1(k) and X2(k) are the N-point DFTs of X1(n) and x2(n) respectively, then what is the
N-point DFT of x(n)=ax1(n)+bx2(n)?
a) X1(ak)+X2(bk)
b) aX1(k)+bX2(k)
c) eakX1(k)+ebkX2(k)
d) None of the mentioned
Answer: b
14. If x(n) is a real sequence and X(k) is its N-point DFT, then which of the following is
true?
a) X(N-k)=X(-k)
b) X(N-k)=X*(k)
c) X(-k)=X*(k)
d) All of the mentioned
Answer: d
15. What is the circular convolution of the sequences X1(n)={2,1,2,1} and x2(n)={1,2,3,4}?
a) {14,14,16,16}
b) {16,16,14,14}
c) {2,3,6,4}
d) {14,16,14,16}
Answer: d
16. 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) [x(n)−x∗(n)]/2
b) [x(n)+x∗(n)]/2
c) [x(n)−x∗(n)]/2j
d) [x(n)+x∗(n)]/2j
Answer: b
Explanation: Given x(n)=x1(n)+jx2(n), x*(n)= x1(n)-jx2(n)
Upon adding the above two equations, we get x1(n)=[x(n)+x∗(n)]/2.
17. 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) [x(n)−x∗(n)]/2
b) [x(n)+x∗(n)]/2
c) [x(n)−x∗(n)]/2j
d) [x(n)+x∗(n)]/2j
Answer: d
Explanation: Given x(n)=x1(n)+jx2(n), x*(n) = x1(n)-jx2(n)
Upon subtracting the above two equations, we get x2(n)=[x(n)−x∗(n)]/2j.
18. How many complex multiplications are need to be performed for each FFT algorithm?
a) (N/2)logN
b) Nlog2N
c) (N/2)log2N
d) None of the mentioned
Answer: c
Explanation: The decimation of the data sequence should be repeated again and again
until the resulting sequences are reduced to one point sequences. For N=2v, this
decimation can be performed v=log2N times. Thus the total number of complex
multiplications is reduced to (N/2)log2N.
19. How many complex additions are required to be performed in linear filtering of a
sequence using FFT algorithm?
a) (N/2)logN
b) 2Nlog2N
c) (N/2)log2N
d) Nlog2N
Answer: b
Explanation: The number of additions to be performed in FFT are Nlog2N. But in linear
filtering of a sequence, we calculate DFT which requires Nlog2N complex additions and
IDFT requires Nlog2N complex additions. So, the total number of complex additions to
be performed in linear filtering of a sequence using FFT algorithm is 2Nlog2N.
20.  FFT algorithm is designed to perform complex operations.
a) True
b) False
Answer: a
Explanation: The FFT algorithm is designed to perform complex multiplications and
additions, even though the input data may be real valued. The basic reason for this is that
the phase factors are complex and hence, after the first stage of the algorithm, all
variables are basically complex valued.
For the key of DFT MCQ, visit: https://www.sanfoundry.com/digital-signal-processing-questions-
answers-properties-dft/

You might also like