Free Printable DTSP Revision 1

1.

Overlap add and Overlap save are the two methods for linear FIR filtering a long sequence on a block-by-block basis using DFT.

a)

True

b)

False

2.

FFT may be used to calculate

1) DFT

2) IDFT

3) Direct Z transform

4) In direct Z transform

a)

a. 1, 2 and 3 are correct

b)

b. 1 and 2 are correct

c)

c. 1 and 3 are correct

d)

d. All the four are correct

3.

W_N^k+N/2=?

a)

a) W_N^k

b)

b) -W_N^k

c)

c) W_N^-k

d)

d) None of the mentioned

4.

What is the circular convolution of the sequences X1(n)={2,1,2,1} and x2(n)={1,2,3,4}?

a)

a) {14,14,16,16}

b)

b) {16,16,14,14}

c)

c) {2,3,6,4}

d)

d) {14,16,14,16}

5.

In which of the following methods, the input sequence is considered as shown in the below diagram?

a)

a) Overlap save method

b)

b) Overlap add method

c)

c) Overlap add & save method

d)

d) None of the mentioned

6.

What are the twiddle factors associated with stage-2 of DIT FFT algorithm.

a)

W₈⁰

b)

W₈⁰, W₈²

c)

W₈⁰,W₈¹,W₈²,W₈³

d)

None of these

7.

Compute the 4 point DFT of [1,0,1,0] using radix-2 DIT FFT algorithm

a)

[2,0,2,0 ]

b)

[4,0,4,0]

c)

[8,0,8,0]

d)

[1,0,1,0]

8.

If X(k) discrete Fourier transform of x(n), then the inverse discrete Fourier transform of X(k) is:

a)

$\frac{1}{N}\sum_{k=0}^{N-1}X\left[k\right]e^{\frac{j\ 2\ \pi\ n\ k}{N}}$

b)

$\frac{1}{N}\sum_{k=0}^{N-1}X\left[k\right]e^{\frac{-\ j\ 2\ \pi\ n\ k}{N}}$

c)

$\sum_{k=0}^{N-1}X\left[k\right]e^{\frac{j\ 2\ \pi\ n\ k}{N}}$

d)

$\sum_{k=0}^{N-1}X\left[k\right]e^{\frac{-\ j\ 2\ \pi\ n\ k}{N}}$

9.

DFT is applied to

a)

Infinite sequences

b)

Finite discrete sequences

c)

Continuous infinite signals

d)

Continuous finite sequences

10.

If {x(n)} is the signal to be analyzed, limiting the duration of the sequence to L samples, in the interval 0≤ n≤ L-1, is equivalent to multiplying {x(n)} by?

a)

Kaiser window

b)

Hamming window

c)

Hanning window

d)

Rectangular window

11.

The total number of complex multiplications required to compute N point DFT by radix-2 FFT is?

a)

(N/2)log₂N

b)

Nlog₂N

c)

(N/2)logN

d)

None of the mentioned

12.

For a decimation-in-frequency 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

13.

A filter is said to be linear phase filter if the phase delay and group delay are

a)

High

b)

Moderate

c)

Low

d)

Constant

14.

To reduce side lobes, in which region of the filter the frequency specifications have to be optimized?

a)

Stop band

b)

Pass band

c)

Transition band

d)

None of the mentioned

15.

In Overlap save method of long sequence filtering, how many zeros are appended to the impulse response of the FIR filter?

a)

L+M

b)

L

c)

L+1

d)

L-1

16.

The total number of complex additions required to compute N point DFT by radix-2 FFT is?

a)

(N/2) log₂N

b)

Nlog₂N

c)

(N/2) log₂N

d)

None of the mentioned

17.

If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even numbered and odd numbered samples of x(n), then such an FFT algorithm is known as decimation-in-time algorithm.

a)

True

b)

False

18.

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

19.

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

20.

FFT may be used to calculate

a)

DFT & IDFT

b)

Z TRANSFORM

c)

LAPLACE TRANSFORM

d)

INDIRECT z TRANSFORM

21.

The computational procedure for Decimation in frequency algorithm takes

a)

Log₂N stages

b)

2Log₂ N stages

c)

Log₂ N2 stages

d)

Log₂ N/2 stages

22.

DFT FORMULA

a)

$DFT:x(k)=\sum_{n=0}^{N-1}x(n)e^{\frac{-j2\pi nk}{N}}$

b)

$DFT:x(k)=\frac{1}{N}\sum_{n=0}^{N-1}x(k)e^{\frac{j2\pi nk}{N}}$

23.

The transformations are required for

1) Analysis in time or frequency domain

2) Quantization

3) Easier operations

4) Modulation

a)

1, 2 and 3 are correct

b)

1 and 2 are correct

c)

1 and 3 are correct

d)

All the four are correct

24.

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

25.

Causal sequence is also known as

a)

anti causal

b)

right hand sequence

c)

left hand sequence

d)

two sided sequence

DTSP Revision 1

Total questions: 25

Worksheet time: 13mins

Similar Resources on Wayground