Scribd
Upload
30 views1 page

If X (N) (1,1,1,1,1,1) Then Number of Samples N ? 10)

This document contains 20 multiple choice questions related to digital signal processing concepts like DFT, FFT, convolution, and system properties. The questions cover topics such as the type of signal processed by a DSP processor, advantages of DSP, properties of linear and causal systems, performing linear convolution and DFT, complexity of DFT vs FFT algorithms, and definitions of the DFT and IDFT transforms.

Uploaded by

raghav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
30 views1 page

If X (N) (1,1,1,1,1,1) Then Number of Samples N ? 10)

This document contains 20 multiple choice questions related to digital signal processing concepts like DFT, FFT, convolution, and system properties. The questions cover topics such as the type of signal processed by a DSP processor, advantages of DSP, properties of linear and causal systems, performing linear convolution and DFT, complexity of DFT vs FFT algorithms, and definitions of the DFT and IDFT transforms.

Uploaded by

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

1.Which type of signal is transmitted using DSP processor?

[ ]1)
(a) Digital signal (b) analog signal (c) Both a&b (d) none
2. Which term is not considering the advantages of DSP [ ]2)
(a) Accuracy (b) cheaper (c) applicability of VLF signals (d) complexity
3. A system that satisfies the superposition principle is said to be -----------system [ ] 3)
(a) Linear (b)invariant (c) variant (d) linear variant
4. System is one whose output depends on past/and present values of the input is called [ ] 4)
(a) Stable (b) Non stable (c) variant (d) causal
5.Find the linear convolution x(n)={1,2,3},h(n)={1,2} [ ]5)
(a){1,4,7,6} (b){1,4,7} (c) {1,4,5,7,6} (d) none
6. What is homogeneous equation? [ ]6)
(a) Finite (b) infinite (c) output is zero (d) input is zero
7. What is the DFT? [ ]7)
(a) Finite N value (b) infinite N value (c) both a & b (d) none
8. In DFT the signal is [ ]8)
(a) Analog format (b) infinite (c) output is zero (d) discrete formats
9. Which is following obey the periodicity? [ ]9)
(a) DFT (b) DFS (c) phase factor (d) all above
10. If x(n) =(1,1,1,1,1,1) then number of samples N=? [ ]10)
(a)1 (b) 11 (c) 11 (d) 6
11. Which is best method to convert frequency domain quickly [ ]11)
(a) DFT (b) DFS (c) DIFT (d) FFT
12. If N=8 then number of complex multiplication in DFT [ ]12)
a) 64 b) 54 c) 44 d) 34
13. If N=8 then number of complex additions in DFT [ ]13)
a) 16 b) 24 c) 16 d) 56
14. If N=8 then number of complex multiplication in FFT Algorithm [ ]14)
a) 12 b) 15 c) 18 d) 21
15. If N=8 then number of complex additions in FFT Algorithm [ ]15)
a) 21 b) 19 c) 23 d)24
16.find the circular convolution of x(n)={1,2,3},h(n)={1,2,3} [ ]16)
a){13,13,10} b){13,1,10} c){13,1,1} d){1,13,10}
17. If N value increase then complexity in DFT also [ ]17)
a) Decrease b) very less c) equal to zero d) increase
18. If N value increase then complexity in FFT [ ]18)
a) Decrease b) very less c) equal to zero d) increase
19. The discrete Fourier transform (DFT) X(K) =----------------------------------------------------------------
20. The inverse discrete Fourier transform (IDFT) x(n) =----------------------------------------------------

You might also like