DSIP Digital Signal & Image Processing MCQ's




Question 121 :
The circular convolution of two sequences in time domain is equivalent to

  1. Multiplication of DFTs of two sequences
  2. Summation of DFTs of two sequences
  3. Difference of DFTs of two sequences
  4. Square of multiplication of DFTs of two sequences
  

Question 122 :
A system is said to be shift invariant only if_

  1. a shift in the input signal also results in the corresponding shift in the output
  2. a shift in the input signal does not exhibit the corresponding shift in the output
  3. a shifting level does not vary in an input as well as output
  4. a shifting at input does not affect the output
  

Question 123 :
Giving one period of the periodic convolution is called

  1. Periodic convolution
  2. Aperiodic convolution
  3. Correlation
  4. Circular convolution
  

Question 124 :
If X(k) is the N-point DFT of a sequence x(n), then what is the DFT of x*(n)

  1. X(N-k)
  2. X*(k)
  3. X*(N-k)
  4. X*(-k)
  

Question 125 :
What is the Nyquist rate of the signal x(t)=3cos(50*pi*t)+10sin(300*pi*t)-cos(100*pi*t)?

  1. 50Hz
  2. 200Hz
  3. 300Hz
  4. 100Hz
  

Question 126 :
The applications which use overlap add method are except

  1. Digital audio
  2. Telephone signals
  3. Echo cancellation
  4. Image signals
  

Question 127 :
Identify in which case positive correlation exist among the variables

  1. Height - Weight
  2. Price - Quatity demanded
  3. Exam score - TV watching rate
  4. Height - IQ
  

Question 128 :
If pixels are reconstructed without error_it is called _____________compression

  1. coordinates wise
  2. non-reversible
  3. reversible
  4. pixel wise
  

Question 129 :
In formula G(x,y) = T[F(x,y)], T is the

  1. Transformed Image
  2. Transformed Vector
  3. Transformation function
  4. Transformation theorem
  

Question 130 :
Linearity property of DFT states that, a.x1(n) + b.x2(n) =

  1. a.X1(n) + b.X2(n)
  2. a.X1(n) - b.X2(n)
  3. X1(n) + X2(n)
  4. X1(n) * X2(n)
  

Question 131 :
Example of Region Growing Methods is

  1. Level Set Methods
  2. Graph Partitioning Methods
  3. Watershed Transformation
  4. Neural Networks Segmentation
  

Question 132 :
The impulse response of a linear time-invariant system is h(n)=[4,5,6,7]. Determine the response of the system to the input signal x(n)=[1,2,3,4] (Origin:7 in h(n) and 1 in x(n) )

  1. [4,10,25,50,52,55,28] (Origin:25)
  2. [30,43,23,26] (Origin:23)
  3. [4,13,28,50,52,45,28] (Origin:50)
  4. 10,23,21,45,36,43] (Origin:10)
  

Question 133 :
Smoothening filter is used to

  1. Remove low frequency regions from an image
  2. Remove high frequency regions from an image
  3. Enhance high frequency regions in an image
  4. Improve the contrast of an image
  

Question 134 :
DFT of a signal is a lossy process.

  1. No
  2. Yes
  3. May be
  4. No way to decide
  

Question 135 :
A system is said to be defined as non causal, when

  1. the output at the present depends on the input at an earlier time
  2. the output at the present does not depend on the factor of time at all
  3. the output at the present depends on the input at the current time
  4. the output at the present depends on the input at a time instant in the future
  

Question 136 :
While performing negative of a 3 bpp image the pixel value '5' will transform to

  1. 2
  2. 5
  3. 8
  4. 0
  

Question 137 :
Which block of the discrete time systems requires memory in order to store the previous input?

  1. Adder
  2. Signal Multiplier
  3. Unit Delay
  4. Unit Advance
  

Question 138 :
DFT of the sequence x(n)={ 1, -2, 3, 2}

  1. {4, -2+j4, 4, -2+j4 }
  2. {4, -2+j4, 4, -2-j4 }
  3. {-4, -2-j4, 4, 2-j4 }
  4. {4, -2-j4, -4, -2-j4 }
  

Question 139 :
Calculate the minimum sampling rate to avoid aliasing when a continuous time signal is given by x(t) = 5 cos 200πt

  1. 100 Hz
  2. 200 Hz
  3. 250 Hz
  4. 400 Hz
  

Question 140 :
A majority of DSP processor are of what type

  1. CISC
  2. RISC
  3. SISD
  4. SIMD
  

Question 141 :
For structuring elements, its origins is at

  1. top left
  2. top right
  3. Center
  4. bottom left
  

Question 142 :
The N-point DFT of a L-point sequence will have a periodicity of ____ samples

  1. N
  2. L
  3. N(N-1)
  4. N * N
  

Question 143 :
The following are speech coding techniques except

  1. Huffman Coding
  2. Pulse Code Modulation
  3. Linear Predictive Coding
  4. Transform Coding
  

Question 144 :
First difference of smallest magnitude is called as

  1. Shape number
  2. Euler Number
  3. Chain Code
  4. Signature
  

Question 145 :
Compute linear convolution of sequence x(n) = {1, 3, 2, 4, 4, 2, 3, 1} and h(n)={1, –1, 1} using overlap save method.

  1. y(n) = {1,0, 0, 5, 2, 2, 5, 0, 2, 1}
  2. y(n) = {1, 5, 0, 5, 2, 2, 5, 0, 2, 1}
  3. y(n) = {1, 2, 0, 5, 2, 2, 5, 0, 2, 1}
  4. y(n) = {1, 1, 0, 5, 2, 2, 5, 0, 2, 1}
  

Question 146 :
In which case power law of transformation is used

  1. purification
  2. industry
  3. radar
  4. MRI
  

Question 147 :
What does Lossy Compression do to files?

  1. Increases the file size and keeps the same quality
  2. Eliminates no information at all
  3. Decreases the file size and keeps the same quality
  4. Eliminates unnecessary information in a file to reduce file size
  

Question 148 :
What is the expanded form of JPEG?

  1. Joint Photographic Expansion Group
  2. Joint Photographic Experts Group
  3. Joint Photographs Expansion Group
  4. Joint Photographic Expanded Group
  

Question 149 :
The x(n)={2,0,0,1},DFT of 4 point sequence is

  1. X(K)={3,2+j,1, 2-j}
  2. X(K)={2,-2-2j,-2, ,-2+2j}
  3. X(K)={3,0 ,-2+2j ,-2-2j}
  4. X(K)={6,-2-2j,2, ,-2+2j}
  

Question 150 :
2D Fourier transform and its inverse are infinitely

  1. Aperiodic
  2. Periodic
  3. Linear
  4. Non linear
  
Pages