DIGITAL SIGNAL PROCESSING MID TERM EXAMINATION

SUB CODE:- ETEC 306 TIME: 1Hr

MAX MARKS:30
Note:- Each Question carry 1 mark

1. Choose the correct statement

a. Number of computations in direct DFT are less than FFT
b. Number of computations in direct DFT are same as that FFT
c. Number of computations in direct DFT are more than FFT
d. All statements are wrong
2. Which of the following is the formula of inverse DFT
1
a. 𝑥[𝑛] = 𝑁 ∑𝑁−1
𝑘=0 𝑋(𝑘)𝑊𝑁
𝑘𝑛

1
b. 𝑥[𝑛] = 𝑁 ∑𝑁−1 𝑘𝑛
𝑘=0 𝑋(−𝑘)𝑊𝑁
1
c. 𝑥[𝑛] = 𝑁 ∑𝑁−1 −𝑘𝑛
𝑘=0 𝑋(𝑘)𝑊𝑁
d. None of these
3. When we find FFT using Decimation in frequency algorithm then
a. Input elements in bit reversal order but output in straight order
b. Input elements in straight order but output in bit reversal order
c. Both input and output are in straight order
d. Both input and output are in bit reversal order
4. Choose the correct statement
a. DFT of a sequence is periodic with period 2N
b. DFT of a sequence is periodic with period 3N
c. DFT of a sequence is periodic with period N
d. All statements are wrong
5. Choose the correct statement
a. 𝐷𝐹𝑇(𝑥[−𝑛]) = 𝑋(−𝑘)
b. 𝐷𝐹𝑇(𝑥[−𝑛]) = −𝑋(𝑘)
c. 𝐷𝐹𝑇(𝑥[−𝑛]) = 2𝑋(𝑘)
d. All statements are wrong
6. The circular convolution of sequences {1,2,1} and {1,-2,2} is
a. {2,3,4}
b. {9,7,6}
c. {3,2,-1}
d. None of these
7. Suppose there are two sequences, one contains M elements and other contains N
elements then
a. Their linear convolution contains M+N elements
b. Their linear convolution contains M-N elements
c. Their circular convolution contains Max(M,N) elements
d. All statements are wrong
8. Choose the correct statement applied to overlap add method
 a. Each data block is L points and we append M-1 zeros to compute N point DFT
b. Each data block consists of the last M-1 data points of the previous data block
followed by L new data points
c. Each data block is L points and we append 2M-1 zeros to compute N point
DFT
d. All statements are wrong
9. What is the linear convolution of {1,2,3} and {-1,-2}
a. {1,2,3,2}
b. {-1,-2,-7,-6}
c. {-1,-4,-7,-6}
d. None of these
2𝜋𝑙𝑛
10. If DFT(x[n]) = X(k) then 𝐷𝐹𝑇 (𝑥[𝑛]𝑒 𝑁 )
a. X(k-l)
b. X(k+l)
c. X(k+2l)
d. X(l-k)
11. If DFT(x[n]) = X(k) then 𝐷𝐹𝑇(𝑥[𝑛 − 𝑙])
2𝜋𝑘𝑙
a. (𝑋(𝑘)𝑒 𝑁 )
2𝜋𝑘𝑙
b. (𝑋(𝑘)𝑒 − 𝑁 )
2𝜋𝑛𝑙
c. (𝑋(𝑘)𝑒 − 𝑁 )
d. All are wrong
12. In Linear phase FIR filters
a. Group Delay is constant but phase delay is variable
b. Group delay and phase delays are constant
c. Group delay is variable but phase delay is constant
d. All are wrong
13. Parsevals Theorem is
1 𝑁−1
a. ∑𝑁−1 2
𝑛=0 |𝑥[𝑛]| = ∑𝑘=0 |𝑋(𝑘)|
2
𝑁
1
b. ∑𝑁−1
𝑛=0 |𝑥[𝑛]|
2
= 𝑁 ∑𝑁−1
𝑘=0 |𝑋(−𝑘)|
2

𝑁−1 1
c. ∑𝑁−1 2
𝑛=0 |𝑥[𝑛]| = 𝑁 ∑𝑘=0 |𝑋(2𝑘)|
2

d. None of these
14. The four point DFT using DIT of x[n] = 2𝑛 is
a. {1,2,-3j,4)
b. (15,-3+6j,-5,-3-6j)
c. (0,-2j,1,2)
d. None of these
15. Linear convolution of two sequences 𝑥1 [𝑛] = 𝛿[𝑛] + 𝛿[𝑛 − 1] + 𝛿[𝑛 − 2] and
𝑥2 [𝑛] = 2𝛿[𝑛] − 𝛿[𝑛 − 1] + 2𝛿[𝑛 − 2] is
a. 2𝛿[𝑛] + 𝛿[𝑛 − 1] + 3𝛿[𝑛 − 2] + 𝛿[𝑛 − 3] + 2𝛿[𝑛 − 4]
b. 2𝛿[𝑛] + 𝛿[𝑛 − 1] + 3𝛿[𝑛 − 2] + 𝛿[𝑛 − 3] + 7𝛿[𝑛 − 4]
c. 2𝛿[𝑛] + 𝛿[𝑛 − 1] + 3𝛿[𝑛 − 2] + 3𝛿[𝑛 − 3] + 2𝛿[𝑛 − 4]
d. None of these
16. According to duality property
𝐷𝐹𝑇𝑁
a. 𝑥(𝑛) ↔ 𝑁𝑋 [((−𝑘))𝑁 ]
𝐷𝐹𝑇𝑁
b. 𝑥(𝑛) ↔ 𝑁𝑋 [((𝑘))𝑁 ]
𝐷𝐹𝑇𝑁
c. 𝑥(𝑛) ↔ 𝑋 [((−𝑘))𝑁 ]
d. All are wrong
17. How to get DFT from Z transform
a. 𝑋(𝑘) = 𝑋(𝑧)| 𝑧 = 𝑒 𝑗2𝜋𝑘/𝑁 , 𝑘 = 0,1, . . . . . 𝑁 − 1
b. 𝑋(𝑘) = 𝑋(𝑧)| 𝑧 = 𝑒 −𝑗2𝜋𝑘/𝑁 , 𝑘 = 0,1, . . . . . 𝑁 − 1
c. 𝑋(𝑘) = 𝑋(𝑧)| 𝑧 = 𝑒 𝑗2𝜋/𝑁 , 𝑘 = 0,1, . . . . . 𝑁 − 1
d. All are wrong
18. Consider a system given by difference equation
y[n]-2y[n-1]+3y[n-2] = x[n]+3x[n-1]+8x[n-2]
When we draw its direct form -2 structure, then the number delay elements and adders
are
a. 2 and 4
b. 2 and 5
c. 3 and 4
d. None of these
19. Consider a system given by difference equation
y[n]-2y[n-1]+3y[n-2] = x[n]+3x[n-1]+8x[n-2]
When we convert its direct form -2 structure to transposed form, then the number of
delay elements and adders are
a. 2 and 3
b. 2 and 2
c. 3 and 2
d. None of these
20. Which of the following window function is having minimum stopband attenuation
a. Rectangular
b. Bartlett
c. Blackman
d. Hamming
21. Which of the following is applied to FIR filter design
a. Bilinear Transformation
b. Impulse invariant method
c. Window method
d. None of these
22. Consider the Analog transfer function
2
𝐻(𝑠) = (𝑠+1)(𝑠+3) , 𝑇 = 0.1 𝑠
The corresponding H(z) using Bilinear transformation is given by
0.0041(1+𝑧 −1 )2
a. 𝐻(𝑧) = 1−1.644𝑧 −1 +0.668

0.0004(1+𝑧 −1 )2
b. 𝐻(𝑧) = 1−6.44𝑧 −1 +0.668𝑧 −2
 0.0008(1+𝑧 −1 )2
c. 𝐻(𝑧) = 1−9.44𝑧 −1 +0.668𝑧 −2
d. None of these
23. Which of the following impulse invariant transformation is correct
𝑠+𝑎 𝐼𝐼𝑀 1−𝑒 −𝑎𝑇 (𝑠𝑖𝑛𝑏𝑇)𝑧 −1
a. →
(𝑠+𝑎)2 +𝑏2 1−2𝑒 −𝑎𝑇 (𝑐𝑜𝑠𝑏𝑇)𝑧 −1 +𝑒 −2𝑎𝑇 𝑧 −2
𝑠+𝑎 𝐼𝐼𝑀 1−𝑒 −𝑎𝑇 (𝑐𝑜𝑠𝑏𝑇)𝑧 −1
b. →
(𝑠+𝑎)2 +𝑏2 1−2𝑒 −𝑎𝑇 (𝑐𝑜𝑠𝑏𝑇)𝑧 −1 +𝑒 −2𝑎𝑇 𝑧 −2
𝑠+𝑎 𝐼𝐼𝑀 1−𝑒 −𝑎𝑇 (𝑐𝑜𝑠𝑏𝑇)𝑧 −1
c. →
(𝑠+𝑎)2 +𝑏2 1−2𝑒 −𝑎𝑇 (𝑠𝑖𝑛𝑏𝑇)𝑧 −1 +𝑒 −2𝑎𝑇 𝑧 −2
d. None of these
24. Which relation we use for Bilinear transformation
2 1−𝑧 −1
a. 𝑠 = 𝑇 [1+𝑧 −1 ]
2 𝑧−1
b. 𝑠 = 𝑇 [𝑧+1]
c. Option a and b are correct
d. All are wrong
25. Which of the transformation we use for low pass to highpass
𝑧 −1 +𝑎
a. 𝑧 −1 → − 1+𝑎𝑧 −1
𝑧 −1 +𝑎
b. 𝑧 −1 → 1+𝑎𝑧 −1
𝑧 −1 +𝑎
c. 𝑧 −1 → − 1−𝑎𝑧 −1
d. None of these
26. Expression for locations of poles of normalized Butterworth filter is given by
𝜋 (2𝑘−1)𝜋
a. 𝜑𝑘 = 2 + 2𝑁
𝜋 (2𝑘−1)𝜋
b. 𝜑𝑘 = 2 − 2𝑁
𝜋 (4𝑘−1)𝜋
c. 𝜑𝑘 = 2 + 2𝑁
d. None of these
27. Which of the following statement is wrong
a. The magnitude response of low pass butterworth filter decreases
monotonically as the frequency increases
b. Magnitude response of Chebyshev filters exhibits ripple in the pass band and
monotonically decreases in the stopband
c. Poles of Chebyshev filter lies on ellipse
d. Transition band of Chebyshev filters is more compared to butterworth filters
28. What is the minimum number of multipliers needed to realize the following transfer
function
1 1 1 1
𝐻(𝑧) = 1 + 𝑧 −1 + 𝑧 −2 + 𝑧 −3 + 𝑧 −4 + 𝑧 −5
3 4 4 3
a. 6
b. 5
c. 3
d. 4
29. Frequency warping effect is seen in
a. Window method
 b. Frequency sampling method
c. Bilinear transformation
d. None of these
30. Which of the following method will you use to design a filter whose all poles are
specified
a. Window method
b. Impulse invariant method
c. Both a and b
d. None of these