Digital Signal Processing Mid - I, September - 2014
1.Given that y(n) = x(-n), then the system is
-
Causal
-
Time invariant
-
Non-Causal
-
Causal & time invariant
-
Answer: C
2.The following is the property of discrete fourier series
-
Linearity
-
Time shifting
-
convolution
-
All
-
Answer: D
3.An odd signal is also known as ……….. signal
-
Symmetric
-
Asymmetric
-
periodic
-
Random
-
Answer: B
4.If a signal satisfies x(N+n) = x(n) for all n,then the signal is
-
periodic
-
non periodic
-
Symmetric
-
Asymmetric
-
Answer: A
5.For a causal LTI system to be stable, all the poles of H(Z) must lie …… in the Z-plane.
-
inside the unit circle
-
outside the unit circle
-
either a or b
-
none of the above
-
Answer: A
6.The basic elements used to construct the block diagram of discrete time system are
-
Adder, multiplier
-
Only adders
-
Adder, delay element
-
Adder, multiplier & delay element
-
Answer: D
7.Any discrete time signal can be expressed as a summation of
-
Step
-
Ramp
-
Exponential
-
Impulses
-
Answer: D
8.The number of complex additions of direct DFT is
-
N
-
N(N-1)
-
N(N+1)
-
N2
-
Answer: B
9.Any discrete time signal can be expressed as a summation of
-
Step
-
Ramp
-
Exponential
-
Impulse
-
Answer: D
10.The causal system H(Z) is stable if
-
Z = 2
-
Z = 3
-
Z = 1/2
-
Z = 3/4
-
Answer: C
11.If the response of the system depends on the past or future samples then the system is called ………….
Answer: Dynamic System
12.FFT stands for ………………….
Answer: Fast Fourier transformer
13.The extraction of information from digital signal is called …
Answer: Digital Signal Processing
14.Random signal is a signal characterized by …………. Before its actual occurance.
Answer: Uncertainty
15.The DFT supports only ………… convolution.
Answer: Circular
16.Z Transform of x(-n) = ……….
Answer: X ( Z -k)
17.Linear convolution of two sequences of length N1 and N2 produces an output sequence of length ……….
Answer: N1 + N2-1
18.…………. is the physical quantity that varies with time , space or any other independent variable.
Answer: Signal
19.Bit reversal is required for ………… algorithm.
Answer: DIT- FFT
20.The number of complex multiplications of radix-2 FFT is ……
Answer: N/2 log2 N