Final QNS Combined

CO2:
Q. If the sequence x[n] is circularly shifted, the DFT is
A. multiplied by a complex exponential

B. scaled by a constant
C. added by a complex exponential
D. also circularly shifted
Q. Discrete cosine transforms (DCTs) express a function or a signal in terms of
A. Sum of cosine functions oscillating at different frequencies

B. Sum of cosine functions oscillating at same frequencies
C. Sum of cosine functions at different sampling intervals
D. Sum of cosine functions oscillating at same sampling intervals
Q. Number of complex multiplications required for computing 32 point DFT using direct evaluation is
____________ and using FFT algorithm is _______________
A. 1024, 512
B. 1024, 80
C. 512, 256
D. 80, 1024
Q. DIT algorithm divides the sequence into
A. Positive and negative values

B. Even and odd samples
C. Upper higher and lower spectrum
D. Small and large samples
Q. For an N-point FFT algorithm with N = 2m , which one of the following statements is TRUE?
A. It is not possible to construct signal flow graph with both input and output in normal order
B. The number of butterflies in the mth state is N/m
C. In-place computation requires storage of only 2N node data
D. Computation of a butterfly requires only one complex multiplication
Q. In Overlap-Add Method with linear convolution of a discrete-time signal of length L and a discrete-
time signal of length M, for a length N, zero padding should be of length
A. L, M > N
B. L, M = N
C. L, M < N
D. L, M < N2
Q. If X(k) is the DFT of x[n], then the DFT of (x[n - m])mod N is
A. Wm X(k)
B. Wk X(k)
C. Wkm X(k)
D. Wk/m X(k)
Q. Decimation is a process in which the sampling rate is
A. enhanced
B. stable
C. reduced
D. unpredictable
Q. The number of stages in the butterfly diagram to compute N point FFT is
A. log2 N
B. log10 N
C. loge N
D. logN N
Q. What is the Nyquist rate of the signal x(t)=3cos(50πt)+10sin(300πt)-cos(100πt)?
A. 50Hz
B. 100Hz
C. 200Hz
D. 300Hz
Q. If x[n] and X[k] are N-point DFT pair, then X[k + N] is equal to
A. X(-k)
B. -X(k)
C. X(k)
D. -1/X(k)
Q. Frequency selectivity characteristics of DFT refers to
A. Ability to resolve different frequency components from input signal

B. Ability to translate into frequency domain
C. Ability to convert into discrete signal
D. Ability to convert into analog signal
Q. If X1[k] and X2[k] are N-point DFTs of x1[n] and x2[n] respectively, then N-point DFT of x[n] = a
x1[n] + b x2[n] is
A. X1[ak] + X2[bk]
B. a X1[k] + b X2[k]
C. eak X1[k] + ebk X2[k]
D. ea X1[k] + eb X2[k]
Q. Which of the following is true regarding the number of computations required to compute an N-
point DFT?
A. N2 complex multiplications and N(N-1) complex additions

B. N2 complex additions and N(N-1) complex multiplications
C. N2 complex multiplications and N(N+1) complex additions
D. N2 complex additions and N(N+1) complex multiplications
Q. If X[k] is N-point DFT of x[n], then DFT of x*[n] is
A. X[N – k]
B. X*[k]
C. X*[N – k]
D. X*[-k]
Q. How many complex multiplications are performed in computing the N-point DFT of a sequence
using divide-and-conquer method if N=LM?
A. N(L+M+2)
B. N(L+M-2)
C. N(L+M-1)
D. N(L+M+1)
Q. Radix-2 FFT algorithm performs the computation of DFT in
A. N log2 N multiplications and N log2 N additions

B. (N/2) log2 N multiplications and N log2 N additions
C. N log2 N multiplications and (N/2) log2 N additions
D. 2N log2 N multiplications and N log2 N additions
Q. For a decimation-in-time FFT algorithm, which of the following is true?
A. Both input and output are in order

B. Both input and output are shuffled
C. Input is shuffled and output is in order
D. Input is in order and output is shuffled
Q. The twiddle factor in N-point FFT is
A. exp(j2π/N)
B. exp(-j2π/N)
C. exp(-2π/N)
D. exp(-j/N)
Q. If X(k) is the DFT of x(n) which is defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the DFT of
x1(n)?
A. 12[X∗(k)+X∗(N−k)]
B. 12[X∗(k)−X∗(N−k)]
C. 12j[X∗(k)−X∗(N−k)]
D. 12j[X∗(k)+X∗(N−k)]
CO3:
Q. The most important advantage of digital filter over analog filter is
A. Design flexibility
B. Cost
C. Functional repeatability
D. Greater SNR at the output
Q. The IIR filter designing involves
A. Designing of analog filter in analog domain and transforming into digital domain
B. Designing of digital filter in analog domain and transforming into digital domain
C. Designing of analog filter in digital domain and transforming into analog domain
D. Designing of digital filter in digital domain and transforming into analog domain
Q. Given a 25 length FIR linear phase digital filter approximating the ideal frequency response

H d (e j )  1,  
6

 0,  
6
The impulse response h[n] of the filter is

sin n  12
6
 n  12
Q. How is the sensitivity of filter coefficient quantization for FIR filters?
A. Low
B. Moderate
C. High
D. Unpredictable
Q. A digital filter produces an output sample which is obtained by taking the average of the past three
input samples and add the result with the current input sample and the past output sample. The
number of additions and multiplications required will be
A. 4, 1
B. 3, 1
C. 3, 3
D. 4, 3
Q. 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. Cascaded form
Q. The first four filter coefficients of a linear phase FIR filter of order N = 7 is given as h[n] = {1, 0.5,
0.25, 2}. The remaining three coefficients are
A. {1, 0.5, 0.25}

B. {-1, -0.5, -0.25}
C. {-0.25, -0.5, -1}
D. {0.5, 0.25, 2}
Q. The realization of FIR filter by frequency sampling realization can be viewed as cascade of how
many filters?
A. Two
B. Three
C. Four
D. Five
Q. Given the impulse response of a FIR filter, h[n] = {1, 0.5, 0, 2}. The frequency response H(ejω) is
A. 1 + 0.5e-jω +2e-2jω
B. e-jω + 0.5e-2jω +2e-3jω
C. 1 + 0.5e-jω +2e-3jω
D. e-jω + 0.5e-2jω +2e-4jω
Q. Consider the assertions given below. Which among them is an advantage of FIR Filter
A. Necessity of computational techniques for filter implementation

B. Requirement of large storage
C. Incapability of simulating prototype analog filters
D. Presence of linear phase response
Q. The 7th order FIR filter will introduce a constant delay of
A. 7
B. 4
C. 3
D. 14
Q. Which window function is also regarded as ‘Raised-cosine window?
A. Hamming window
B. Hanning window
C. Barlett window
D. Blackman window
Q. If h[n] represents the impulse response of a FIR filter, a necessary and sufficient condition for the
filter to exhibit linear phase response is that
A. h[n] has finite duration N

B. h[n] is symmetric about its midpoint
C. h[n] has finite duration N and is symmetric about its midpoint
D. h[n] is symmetric about zero
Q. In Barlett window, the triangular function resembles the tapering of rectangular window sequence
_______ from the middle to the ends.
A. linearly
B. elliptically
C. hyperbolically
D. parabolically
Q. Ideal filters are
A. non causal and unstable

B. Non causal and stable
C. causal and stable
D. causal and unstable
Q. In Gibb’s phenomenon, the ringing effect is predominantly present near the ______ .
A. band gap
B. band edge
C. bandwidth
D. bandshell
Q. The cutoff frequency of a filter is 500 Hz and the sampling rate is 2000 samples/sec. The equivalent
digital frequency is
A. 2π rad
B. 0.5π rad
C. 4 rad
D. 0.25 rad
Q. In linear phase realization, equal valued coefficients are taken common for reducing the requisite
number of ________.
A. adders
B. subtractors
C. multipliers
D. dividers
Q. Mapping from s plane to z plane is
A. Linear
B. Nonlinear
C. Piecewise linear
D. Symmetric
Q. Which of the following refers the number of memory locations required to store the system
parameters, past inputs, past outputs and any intermediate computed values?
A. Computational complexity
B. Finite world length effect
C. Memory requirements
D. Address Register
CO4:
Q. In impulse invariant method, the poles sk from the continuous-time system function H(s) are
translated to poles at z = ________ in the discrete-time system function H(z) where T is the sampling
period
A. exp(-skT)
B. exp(skT)
C. exp(sk/T)
D. exp(-sk/T)
Q. Computational complexity refers to the number of ____________
A. Additions
B. Arithmetic operations
C. Multiplications
D. Constant
Q. 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
B. M+N–1
C. M+N+1
D. M+N+2
Q. For a linear phase filter, if Z1 is zero then what would be the value of Z1-1 or 1/ Z1?
A. Zero
B. Unity
C. Infinity
D. Unpredictable
Q. Which form is called as canonical form?
A. Direct form I
B. Direct form II
C. Direct form III
D. Direct form IV
Q. In the frequency response characteristics of FIR filter, the number of bits per coefficient should be
_________in order to maintain the same error.
A. Increased
B. Constant
C. Decreased
D. Same value
Q. For recursive filters with a zero or constant input, the non linearity due to finite word length effects
can cause spurious oscillations called
A. Limit cycles
B. Overshoot
C. Damping
D. Decay
Q. In linear phase realization, equal valued coefficients are taken common for reducing the requisite
number of ________.
A. adders
B. subtractors
C. multipliers
D. dividers
Q. The coefficient quantization can make a stable IIR filter to become
A. Unstable
B. Noncausal
C. Time variant
D. Dynamic
Q. What is the model that has been adopt for characterizing round of errors in multiplication?
A. Multiplicative white noise model

B. Subtractive white noise model
C. Additive white noise model
D. Round off noise model
Q. The effects caused due to finite word lengths are adder overflow, round off noise, limit cycles and
__________
A. Coefficient quantization error

B. Sampling error
C. Propagation error
D. Mean square error
Q. How many quantization errors are present in one complex valued multiplication?
A. One
B. Two
C. Three
D. Four
Q. The error in the filter output that results from rounding or truncating calculations within the filter
is called
A. Coefficient quantization error

B. Adder overflow limit cycle
C. Round off noise
D. Limit cycles
Q. In FIR filters, which among the following parameters remains unaffected by the quantization
effect?
1. Magnitude Response
2. Phase Characteristics
3. Frequency response
4. Power spectrum
Q. What is the total number of quantization errors in the computation of single point DFT of a
sequence of length N?
1. 2N
2. 4N
3. 8N
4. 12N
Q. What is the output of the single stage lattice filter if x(n) is the input?
1. x(n)+Kx(n+1)
2. x(n)+Kx(n-1)
3. x(n)+Kx(n-1)+Kx(n+1)
4. Kx(n-1)
Q. The transition band is more in ¬_________ filters
1. Butterworth
2. Chebyshev type 1
3. Chebyshev type 2
4. Elliptic
Q. If we interchange the rows and columns of the matrix F, then the system is called as
______________
1. Identity system
2. Diagonal system
3. Transposed system
4. Additive system
Q. The nonlinear relation between the analog and digital frequencies is called as
1. Aliasing
2. Imaging
3. Warping
4. Prewarping
Q. In the Bilinear Transformation mapping, which of the following are correct?
1. All points in the LHP of s are mapped inside the unit circle in the z-plane
2. All points in the RHP of s are mapped outside the unit circle in the z-plane
3. All points in the LHP & RHP of s are mapped inside & outside the unit circle in the z-plane
4. All poles and Zeros in the RHP of s are mapped inside the unit circle in the z-plane
CO5:
Q. _____ filters are always stable
1. Low pass
2. High pass
3. FIR
4. IIR
Q. IIR filters have ______ phase response
1. Linear
2. Nonlinear
3. Piecewise linear
4. Symmetric
Q. In TMS 320 C6x processor architecture, which functional unit is adopted for transferring the data
from register to and from control register?
1. L2
2. M2
3. S2
4. D2
Q. If (101.01)2=(x)10, then what is the value of x?
1. 505.05
2. 10.101
3. 101.01
4. 5.25
Q. Example for a digital signal processor is
1. Intel 8085
2. Intel 8086
3. Intel 8051
4. TMS320C50
Q. In Digital Signal Processors, which among the following maintains the track of addresses of input
data as well as the coefficients stored in data and program memories?
1. Program sequences
2. Barrel shifter
3. MAC
4. Data address generators
Q. If 0< E<255, then which of the following statement is true about X?
1. Fractional number
2. Infinity
3. Mixed number
4. Zero
Q. What are the mantissa and exponent required respectively to represent ‘5’ in binary floating point
representation?
1. 011,0.110000
2. 0.110000,011
3. 011,0.101000
4. 0.101000,011
Q. In DSP Processor, what kind of queuing is undertaken/executed through instruction register and
instruction cache?
1. Implicate
2. Explicate
3. Both implicate and explicate
4. Double ended queue
Q. ________ programming is typically used for digital signal processors
1. Machine language
2. C
3. MATLAB
4. Assembly language
Q. For a twos complement representation, the truncation error is ____________
1. Always positive
2. Always negative
3. Zero
4. One
Q.What is the binary equivalent of (-3/8)?
1. (10011)2
2. (0011)2
3. (1100)2
4. (1101)2
Q. In a digital representation of voltages using an 8-bit binary code, how many values can be defined?
1. 16
2. 64
3. 128
4. 256
Q. If E=0 and M=0, then which of the following statement is true about X?
A. Not a number
B. Infinity
C. Defined
D. Zero
Q. In Von Neumann architecture, which among the following handles all the operations of the system
that are inside and outside the processor?
A. Input unit
B. Output unit
C. Control unit
D. Memory unit
Q. The instructions are executed in DSP Processors in _____ manner
A. Sequential
B. Parallel
C. Both sequential and parallel
D. Cascade
Q. What is the 2’s complement of (1100)2?
A. (0100)2
B. (0011)2
C. (0111)2
D. (1100)2
Q. If E=255 and M≠0, then which of the following statement is true about X?
A. Not a number
B. Infinity
C. Defined
D. Zero
Q. MAC in Digital Signal Processor stands for
A. Multiply and Correlate

B. Multiply and Convolve
C. Multiply and Compare
D. Multiply and Accumulate
Q. If the input analog signal falls outside the range of the quantizer , eq (n) becomes unbounded and
results in _____________
A. Granular noise
B. Overload noise
C. Particulate noise
D. Heavy noise
DSP MCQ:
Q. The interface between an analog signal and a digital processor is
a. D/A converter
b. A/D converter
c. Modulator
d. Demodulator
ANSWER: (b) A/D converter
Q. DTFT is the representation of
a. Periodic Discrete time signals

b. Aperiodic Discrete time signals
c. Aperiodic continuous signals
d. Periodic continuous signals
ANSWER:(b) Aperiodic Discrete time signals
Q. The similarity between the Fourier transform and the z transform is that
a. Both convert frequency spectrum domain to discrete time domain

b. Both convert discrete time domain to frequency spectrum domain
c. Both convert analog signal to digital signal
d. Both convert digital signal to analog signal
ANSWER: (b) Both convert discrete time domain to frequency spectrum domain
Q. The ROC of a system is the
a. range of z for which the z transform converges

b. range of frequency for which the z transform exists
c. range of frequency for which the signal gets transmitted
d. range in which the signal is free of noise
ANSWER: (a) range of z for which the z transform converges
Q.For a system function H(s) to be stable
a. The zeros lie in left half of the s plane

b. The zeros lie in right half of the s plane
c. The poles lie in left half of the s plane
d. The poles lie in right half of the s plane
ANSWER: (c) The poles lie in left half of the s plane

C
Continuoue and periodic
Deterministic
Superposition
Zero
Remains unchanged
Sampling
Ztransform
Q. In Overlap-Add Method with linear convolution of a discrete-time signal of length L and a discrete-
time signal of length M, for a length N, zero padding should be of length
a. L, M > N
b. L, M = N
c. L, M < N
d. L, M < N2
ANSWER: L, M < N
Q. DFT is applied to
a. Infinite sequences
b. Finite discrete sequences
c. Continuous infinite signals
d. Continuous finite sequences
ANSWER: Finite discrete sequences
Q. A system is said to be marginally unstable if
a. None of its zeros of its transfer function lies on the jω axis of s-plane
b. At least one zero of its transfer function lies on the jω axis of s-plane
c. None of its poles of its transfer function lies on the jω axis of s-plane
d. At least one pole of its transfer function lies on the jω axis of s-plane
ANSWER: At least one pole of its transfer function lies on the jω axis of s-plane
Explanation:
No explanation is available for this question!
Q. A system is said to be unstable if
a. None of the poles of its transfer function is shifted to the right half of s-plane
b. At least one zero of its transfer function is shifted to the right half of s-plane
c. At least one pole of its transfer function is shifted to the right half of s-plane
d. At least one pole of its transfer function is shifted to the left half of s-plane
ANSWER: At least one pole of its transfer function is shifted to the right half of s-plane
Q. The condition for a system to be stable is
a. All poles of its transfer function lie on the left half of s-plane
b. All poles of its transfer function must be right half of s-plane
c. All zeros of its transfer function must be right half of s-plane
d. All zeros of its transfer function must be left half of s-plane
ANSWER: All poles of its transfer function lie on the left half of s-plane
Q. The condition for a system to be causal is
a. All poles of its transfer function must be left half of s-plane

b. All poles of its transfer function must be right half of s-plane
c. All zeros of its transfer function must be right half of s-plane
d. All zeros of its transfer function must be left half of s-plane
ANSWER: All poles of its transfer function must be right half of s-plane
Q. ROC does not have
a. zeros
b. poles
c. negative values
d. positive values
ANSWER: poles
Q. Overlap-Add Method Deals with principles that
a. The linear convolution of a discrete-time signal of length L and a discrete-time signal of length
M produces a discrete-time convolved result of length L + M - 1
b. The linear convolution of a discrete-time signal of length L and a discrete-time signal of length M
produces a discrete-time convolved result of length L + M
c. The linear convolution of a discrete-time signal of length L and a discrete-time signal of length M
produces a discrete-time convolved result of length 2L + M - 1
d. The linear convolution of a discrete-time signal of length L and a discrete-time signal of length M
produces a discrete-time convolved result of length 2L + 2M - 1
ANSWER: The linear convolution of a discrete-time signal of length L and a discrete-time signal of length
M produces a discrete-time convolved result of length L + M - 1
Q. The overlap save method is used to calculate
a. The discrete convolution between a sampled signal and a finite impulse response (FIR) filter
b. The discrete convolution between a sampled signal and an infinite impulse response (IIR) filter
c. The discrete convolution between a very long signal and a finite impulse response (FIR) filter
d. The discrete convolution between a very long signal and a infinite impulse response (IIR) filter
ANSWER: The discrete convolution between a very long signal and a finite impulse response (FIR) filter
Q. The circular convolution of two sequences in time domain is equivalent to
a. Multiplication of DFTs of two sequences

b. Summation of DFTs of two sequences
c. Difference of DFTs of two sequences
d. Square of multiplication of DFTs of two sequences
ANSWER: Multiplication of DFTs of two sequences
Q. Circular shift of an N point is equivalent to
a. Circular shift of its periodic extension and its vice versa

b. Linear shift of its periodic extension and its vice versa
c. Circular shift of its aperiodic extension and its vice versa
d. Linear shift of its aperiodic extension and its vice versa
ANSWER: Linear shift of its periodic extension and its vice versa
Q. Causal systems are the systems in which
a. The output of the system depends on the present and the past inputs
b. The output of the system depends only on the present inputs
c. The output of the system depends only on the past inputs
d. The output of the system depends on the present input as well as the previous outputs
ANSWER: The output of the system depends on the present and the past inputs
Q. Time reversal of a discrete time signal refers to
a. y[n] = x[-n+k]
b. y[n] = x[-n]
c. y[n] = x[-n-k]
d. y[n] = x[n-k]
ANSWER: y[n] = x[-n]

Q. Time shifting of discrete time signal means
a. y[n] = x[n-k]
b. y[n] = x[-n-k]
c. y[n] = -x[n-k]
d. y[n] = x[n+k]
ANSWER: y[n] = x[n-k]
Q. A signal x[n] is anti symmetric or odd when
a. x[-n+ = x*n+ • x*n+

b. x[n] = -x[n]
c. x[n] = [x[n]]2
d. x[-n] = -x[n]
ANSWER: x[-n] = -x[n]

15L601 - Digital Signal Processing - CA - I TEST https://docs.google.com/forms/d/e/1FAIpQLSe6Vga9_o0nOEosSv-m_...
15L601 - Digital Signal Processing - CA - I

TEST
Total points 40/40
The respondent's email (18l246@psgtech.ac.in) was recorded on submission of this form.
DFT is applied to * 2/2
Periodic, discrete sequences
Infinite sequences
Continuous, finite sequences
Continuous, infinite signals
Official email id: *
18l246@psgtech.ac.in
The process of converting discrete-time continuous valued signal into 2/2

discrete-time discrete valued(digital) signal is known as: *
None of the mentioned
Sampling
Coding
Quantization
1 of 8 25-04-2021, 07:37 pm
The circular convolution of two sequences in time domain is equivalent 2/2

to *
Difference of DFTs of two sequences
Square of multiplication of DFTs of two sequences
Multiplication of DFTs of two sequences
Summation of DFTs of two sequences
What is the Nyquist rate of the signal x(t)=3cos(50πt)+10sin(300πt)- 2/2

cos(100πt)? *
300Hz
200Hz
100Hz
50Hz
The ROC of H(Z) is the * 2/2
range of z for which the z transform converges
range of frequency for which the signal gets transmitted
range of frequency for which the z transform exists
range in which the signal is free of noise
2 of 8 25-04-2021, 07:37 pm
For a continuous time signal x(t) to be periodic with a period T, then 2/2
x(t+mT) should be equal to: *
x(t)
x(-t)
x(mt)
x(mT)
The even part of a signal x(t) is * 2/2
x(t)+x(-t)
(1/2)*(x(t)+x(-t))
(1/2)*(x(t)-x(-t))
x(t)-x(-t)
Overlap-Add Method Deals with principles that * 2/2
. The linear convolution of a discrete-time signal of length L and a discrete-time

signal of length M produces a discrete-time convolved result of length 2L + 2M - 1
The linear convolution of a discrete-time signal of length L and a discrete-time signal

of length M produces a discrete-time convolved result of length L + M
The linear convolution of a discrete-time signal of length L and a discrete-time signal

of length M produces a discrete-time convolved result of length 2L + M - 1
The linear convolution of a discrete-time signal of length L and a discrete-time

signal of length M produces a discrete-time convolved result of length L + M - 1
3 of 8 25-04-2021, 07:37 pm
In Overlap-Add Method with linear convolution of a discrete-time signal 2/2

of length L and a discrete-time signal of length M, for a length N, zero
padding should be of length *
L, M > N
L, M = N
L, M < N
L, M < N2
The difference between the unquantized X(n) and quantized Xq(n) is 2/2
known as: *
Quantization coefficient
Quantization error
Quantization factor
Quantization ratio
Which of the following is done to convert a continuous time signal into 2/2
discrete time signal? *
Sampling
Integrating
Modulating
Differentiating
4 of 8 25-04-2021, 07:37 pm
Name: *
sathyaseelan.m
Roll No: *
18L246
The overlap save method is used to calculate * 2/2
The discrete convolution between a sampled signal and an infinite impulse response
(IIR) filter
The discrete convolution between a sampled signal and a finite impulse response
(FIR) filter
The discrete convolution between a very long signal and a infinite impulse response
(IIR) filter
The discrete convolution between a very long signal and a finite impulse
response (FIR) filter
Time reversal of a discrete time signal refers to * 2/2
x[-n+k]
x[n-k]
x[-n]
x[-n-k]
5 of 8 25-04-2021, 07:37 pm
ROC will not have * 2/2
positive values
zeros
negative values
poles
The interface between an analog signal and a digital processor is * 2/2
D/A converter
A/D converter
Modulator
Demodulator
DTFT is the representation of * 2/2
Periodic, continuous signals
Aperiodic, Discrete time signals
Aperiodic, continuous signals
Periodic ,Discrete time signals
6 of 8 25-04-2021, 07:37 pm
Circular shift of an N point is equivalent to * 2/2
Linear shift of its periodic extension and its vice versa
Linear shift of its aperiodic extension and its vice versa
Circular shift of its aperiodic extension and its vice versa
Circular shift of its periodic extension and its vice versa
Time shifting of discrete time signal means * 2/2
-x[n-k]
. x[n+k]
x[n-k]
x[-n-k]
For a system function H(s) to be stable * 2/2
The zeros must lie in right half of the s plane
The zeros must lie in left half of the s plane
The poles must lie in right half of the s plane
The poles must lie in left half of the s plane
7 of 8 25-04-2021, 07:37 pm
A signal x[n] is anti-symmetric or odd when * 2/2
x[-n] = x[n] • x[n]
x[n] = [x[n]]2
x[-n] = -x[n]
x[n] = -x[n]
This form was created inside of PSG College of Technology.
8 of 8 25-04-2021, 07:37 pm
15L601 Digital Signal Processing CA Test 2 https://docs.google.com/forms/d/e/1FAIpQLSeXb1osmZezr5k3VxUXG...
15L601 Digital Signal Processing CA Test

2
Total points 40/40
The respondent's email (18l246@psgtech.ac.in) was recorded on submission of this form.
Roll Number
18l246
Filter length is _______ for FIR filters 2/2
Filter order - 1
one
Filter order + 1
Filter order
______ filters are called as maximally flat magnitude filters 2/2
Butterworth
Practical
Chebyshev
All pass
1 of 8 25-04-2021, 07:38 pm
_____ filters are always stable 2/2
High pass
Low pass
IIR
FIR
IIR filters have ______ phase response 2/2
nonlinear
piecewise linear
linear
symmetric
Example for an all pole filter is 2/2
y[n] = x[n] + y[n-1]
y[n] = x[n] + x[n-1] + y[n-1]
y[n] = x[n-1]
y[n] = x[n] + x[n-1]
2 of 8 25-04-2021, 07:38 pm
The number of complex multiplications in N point DFT is 2/2
2N^2
2N
N^2
The relationship between "s' and "z" in bilinear transformation is 2/2
s = 1/(z-1)
s = 2(z-1)/[T(z+1)]
s = 2(z+1)/[T(z-1)]
s = 1/(z+1)
_________ transformation is used to convert H(s) to H(z) 2/2
linear
Frequecny
symmetric
Bilinear
3 of 8 25-04-2021, 07:38 pm
Butterworth filter is 2/2
all-zero filter
all-pole filter
pole-zero filter
Poles of Butterworth filter will lie 2/2
inside the unit circle
anywhere
on the unit circle
outside the unit circle
DTFT is special case or subset of 2/2
Laplace transform
DFT
z transform
DTFS
4 of 8 25-04-2021, 07:38 pm
The parameter in bilinear transformation is 2/2
cutoff frequency
filter order
sampling duration
phase
The number of stages in the butterfly diagram to compute N point FFT is 2/2
log(N) to the base 10
log(N) to the base N
log(N) to the base e
The twiddle factor in N-point FFT is 2/2
exp(-jπ/N)
exp(-j2π/N)
exp(j2π/N)
exp(jπ/N)
5 of 8 25-04-2021, 07:38 pm
A causal LTI system with a rational transfer function H(z) is stable if and 2/2
only if
all poles of H(z) are inside the unit circle
all zeros of H(z) are inside the unit circle
all zeros of H(z) are outside the unit circle
all poles of H(z) are outside the unit circle
Name
Sathyaseelan M
The number of stages in Radix-2 N-point FFT is 2/2
log(N) to the base N
log(N) to the base e
6 of 8 25-04-2021, 07:38 pm
Filter order is ______ for IIR filters 2/2
Filter length + 1
Filter length
infinite
finite
Mapping from s plane to z plane is 2/2
symmetric
nonlinear
linear
piecewise linear
Which two properties in twiddle factor are used in computing DFT using 2/2
FFT?
Linearity and periodicity
Symmetry and linearity
Linearity and reciprocity
Symmetry and periodicity
7 of 8 25-04-2021, 07:38 pm
Email ID
FFT is used to compute 2/2
DFT
Inverse DFT
DTFT
DFT and Inverse DFT
8 of 8 25-04-2021, 07:38 pm
15L601 Digital Signal Processing CA Test 3 https://docs.google.com/forms/d/e/1FAIpQLSfe9sBTyVCLPeaYUQdI_...
15L601 Digital Signal Processing CA Test

3
Total points 20/40
The respondent's email () was recorded on submission of this form.
In recursive systems, which of the following is caused because of the 2/2

nonlinearities due to the finite precision arithmetic operations?
periodic oscillations in the output
periodic oscillations in the input
Nonperiodic oscillations in the input
Nonperiodic oscillations in the output
Which of the following is true in fixed point binary representation? 0/2
Only positive numbers can be represented
Only negative numbers can be represented
Integers can not be represented
The position of binary point is fixed
Correct answer
The position of binary point is fixed
1 of 10 25-04-2021, 07:41 pm
The unit delay element in the filter structure is represented by 0/2
z-1
z+1
1/z
Correct answer
1/z
Which of the following is the correct relation between ω and Ω? 2/2
ω = ΩT
Ω = ωT
ω = Ω/T
Ω = ω/T
2 of 10 25-04-2021, 07:41 pm
Direct form II will have less number of _______ 0/2
Filters
Adders
Multipliers
Delay elements
Correct answer
Delay elements
Name
Limit cycles in the recursive systems are directly attributable to which of 2/2
the following?
Roundoff errors in multiplication
Roundoff errors in multiplication and overflow errors in addition
Delay
overflow errors in addition
3 of 10 25-04-2021, 07:41 pm
Example for a linear phase FIR filter is 0/2
h[n] = {4, 3, 2, 1}
h[n] = {1, 2, 3, 4}
h[n] = {1, 2, 3, 2, 1}
h[n] = {1, 0, 3}
Correct answer
h[n] = {1, 2, 3, 2, 1}
_______ filter is the most efficient in the sense that, compared to the 0/2
other filter approximations, it has the lowest filter order
Elliptic
Butterworth
Chebyshev type 1
Chebyshev type 2
Correct answer
Elliptic
4 of 10 25-04-2021, 07:41 pm
Which of the following is true about type-1 Chebyshev filter? 0/2
Equiripple behaviour in stopband and monotonic behaviour in passband
monotonic behaviour in stop band
Equiripple behaviour in passband
Equiripple behaviour in passband and monotonic behaviour in stop band
Correct answer
Equiripple behaviour in passband and monotonic behaviour in stop band
Email ID
To reduce side lobes, in which region of the filter, the frequency 2/2
specifications have to be optimised
pass band
transition band
all band
stop band
5 of 10 25-04-2021, 07:41 pm
Which of the following is the advantage of Hanning window over 2/2

rectangular window?
More width of main lobe
More power leakage
Less side lobes
More side lobes
What is the range of values called as to which the amplitudes of the 2/2
output during a limit cycle are confined to?
pass band
stop band
dead band
transition band
How is the sensitivity of filter coefficient quantization for FIR filters? 2/2
moderate
unpredictable
high
low
6 of 10 25-04-2021, 07:41 pm
Which of the following filter can not be designed using impulse invariant 0/2
method?
High pass filter
Band pass filter
Band stop filter
Low pass filter
Correct answer
High pass filter
Option 1
Which of the following is the first method proposed for designing FIR 0/2
filters?
Chebyshev approximation
Frequency sampling method
impulse invariant method
Windowing technique
Correct answer
Windowing technique
7 of 10 25-04-2021, 07:41 pm
If M and N are the orders of numerator and denominator of rational 2/2

system function respectively, then how many additions are required in
direct form-I realization of that IIR filter?
M+N+2
M+N
M+N+1
M+N-1
The direct form realization of FIR filter is also called as ________ structure 2/2
transposed
transversal
lattice
ladder
8 of 10 25-04-2021, 07:41 pm
The impulse response of an ideal low pass filter is a _______ function 0/2
rectangular
sinc
sine
cosine
Correct answer
sinc
Roll Number
18L263
Chebyshev filters are most widely used in 2/2
Biomedical signal processing
RF applications
Image processing
Speech signal processing
9 of 10 25-04-2021, 07:41 pm
The finite word length effect is NOT due to 0/2
quantization of output
quantization of filter coefficients
quantization of input
quantization of product
Correct answer
quantization of output
10 of 10 25-04-2021, 07:41 pm

Final QNS Combined

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Final QNS Combined

Uploaded by

Copyright:

Available Formats

CO2:

Q. If the sequence x[n] is circularly shifted, the DFT is

A. multiplied by a complex exponential

Q. Discrete cosine transforms (DCTs) express a function or a signal in terms of

A. Sum of cosine functions oscillating at different frequencies

Q. DIT algorithm divides the sequence into

A. Positive and negative values

Q. If X(k) is the DFT of x[n], then the DFT of (x[n - m])mod N is

Q. Decimation is a process in which the sampling rate is

Q. The number of stages in the butterfly diagram to compute N point FFT is

Q. What is the Nyquist rate of the signal x(t)=3cos(50πt)+10sin(300πt)-cos(100πt)?

Q. Frequency selectivity characteristics of DFT refers to

A. Ability to resolve different frequency components from input signal

A. N2 complex multiplications and N(N-1) complex additions

Q. If X[k] is N-point DFT of x[n], then DFT of x*[n] is

Q. Radix-2 FFT algorithm performs the computation of DFT in

A. N log2 N multiplications and N log2 N additions

Q. For a decimation-in-time FFT algorithm, which of the following is true?

A. Both input and output are in order

Q. The twiddle factor in N-point FFT is

Q. The most important advantage of digital filter over analog filter is

Q. The IIR filter designing involves

Q. How is the sensitivity of filter coefficient quantization for FIR filters?

A. {1, 0.5, 0.25}

A. Necessity of computational techniques for filter implementation

Q. The 7th order FIR filter will introduce a constant delay of

Q. Which window function is also regarded as ‘Raised-cosine window?

A. h[n] has finite duration N

A. non causal and unstable

Q. Mapping from s plane to z plane is

Q. Computational complexity refers to the number of ____________

Q. The coefficient quantization can make a stable IIR filter to become

A. Multiplicative white noise model

A. Coefficient quantization error

A. Coefficient quantization error

Q. In the Bilinear Transformation mapping, which of the following are correct?

Q. _____ filters are always stable

Q. IIR filters have ______ phase response

Q. If (101.01)2=(x)10, then what is the value of x?

Q. Example for a digital signal processor is

Q. If 0< E<255, then which of the following statement is true about X?

Q. ________ programming is typically used for digital signal processors

Q. For a twos complement representation, the truncation error is ____________

Q.What is the binary equivalent of (-3/8)?

Q. The instructions are executed in DSP Processors in _____ manner

Q. What is the 2’s complement of (1100)2?

Q. MAC in Digital Signal Processor stands for

A. Multiply and Correlate

Q. The interface between an analog signal and a digital processor is

ANSWER: (b) A/D converter

Q. DTFT is the representation of

a. Periodic Discrete time signals

ANSWER:(b) Aperiodic Discrete time signals

a. Both convert frequency spectrum domain to discrete time domain

Q. The ROC of a system is the

a. range of z for which the z transform converges

ANSWER: (a) range of z for which the z transform converges

Q.For a system function H(s) to be stable

a. The zeros lie in left half of the s plane

ANSWER: (c) The poles lie in left half of the s plane

Continuoue and periodic

ANSWER: Finite discrete sequences

Q. A system is said to be marginally unstable if

a. x[-n+ = xn+ • xn+