Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

101.

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) None of the mentionedThis question was addressed to me during an interview.I would like to ask this question from Structures for Realization of Discrete Time Systems in chapter Discrete Time Systems Implementation of Digital Signal Processing

Answer»

The correct answer is (c) Memory requirements

Easy explanation: Memory requirements REFERS the number of memory LOCATIONS REQUIRED to store the system parameters, PAST INPUTS, past outputs and any intermediate computed values.

102.

The number of times a fetch from memory is performed per output sample is one of the factor used in the implementation of the system.(a) True(b) FalseI have been asked this question by my college professor while I was bunking the class.My doubt is from Structures for Realization of Discrete Time Systems topic in chapter Discrete Time Systems Implementation of Digital Signal Processing

Answer»

Right option is (a) True

Easiest explanation: According to the recent DEVELOPMENTS in the design and fabrication of rather sophisticated programmable DSPs, other FACTORS, such as the NUMBER of times a fetch from memory is performed or the number of times a comparison between two numbers is performed per output SAMPLE, have become important in assessing the computational complexity of a given realization of a system.

103.

We can view y(n)=-\(\sum_{k=1}^N a_k y(n-k)+\sum_{k=0}^N b_k x(n-k)\) as the computational procedure (an algorithm) for determining the output sequence y(n) of the system from the input sequence x(n).(a) True(b) FalseI had been asked this question at a job interview.This is a very interesting question from Structures for Realization of Discrete Time Systems topic in portion Discrete Time Systems Implementation of Digital Signal Processing

Answer»

Correct answer is (a) True

To explain I would say: The COMPUTATIONS in the given equation can be arranged into equivalent sets of difference equations. Each set of equations DEFINES a COMPUTATIONAL procedure or an algorithm for implementing the SYSTEM.

104.

Computational complexity refers to the number of ____________(a) Additions(b) Arithmetic operations(c) Multiplications(d) None of the mentionedI have been asked this question in examination.My doubt stems from Structures for Realization of Discrete Time Systems in division Discrete Time Systems Implementation of Digital Signal Processing

Answer»

Correct choice is (b) ARITHMETIC operations

The BEST explanation: Computational complexity is one of the factor which is USED in the implementation of the system. It refers to the numbers of Arithmetic operations (ADDITIONS, multiplications and DIVISIONS).

105.

Which of the following is used in the realization of a system?(a) Delay elements(b) Multipliers(c) Adders(d) All of the mentionedI had been asked this question during an internship interview.My doubt stems from Structures for Realization of Discrete Time Systems topic in chapter Discrete Time Systems Implementation of Digital Signal Processing

Answer»
106.

Which of the following is the rational system function of an LTI system characterized by the difference equation y(n)=-\(\sum_{k=1}^N a_k y(n-k)+\sum_{k=0}^N b_k x(n-k)\)?(a) \(\frac{\sum_{k=0}^N b_k x(n-k)}{1+\sum_{k=0}^N a_k y(n-k)}\)(b) \(\frac{1+\sum_{k=1}^N a_k y(n-k)}{\sum_{k=0}^N b_k x(n-k)}\)(c) \(\frac{\sum_{k=0}^N b_k x(n-k)}{1+\sum_{k=1}^N a_k y(n-k)}\)(d) \(\frac{1+\sum_{k=0}^N a_k y(n-k)}{\sum_{k=0}^N b_k x(n-k)}\)I had been asked this question in an interview.My question is based upon Structures for Realization of Discrete Time Systems in division Discrete Time Systems Implementation of Digital Signal Processing

Answer»

Correct choice is (c) \(\frac{\sum_{k=0}^N b_k x(n-k)}{1+\sum_{k=1}^N a_k y(n-k)}\)

BEST explanation: The difference equation of the LTI system is given as

y(n)=-\(\sum_{k=1}^N a_k y(n-k)+\sum_{k=0}^N b_k x(n-k)\)

By applying the z-transform on both sides of the above equation and by rearranging the obtained equation, we get the RATIONAL system FUNCTION as H(z)=\(\frac{\sum_{k=0}^N b_k x(n-k)}{1+\sum_{k=1}^N a_k y(n-k)}\)

107.

The general linear constant coefficient difference equation characterizing an LTI discrete time system is?(a) y(n)=-\(\sum_{k=1}^N a_k y(n-k)+\sum_{k=0}^N b_k x(n-k)\)(b) y(n)=-\(\sum_{k=0}^N a_k y(n-k)+\sum_{k=0}^N b_k x(n-k) \)(c) y(n)=-\(\sum_{k=1}^N a_k y(n)+\sum_{k=0}^N b_k x(n) \)(d) None of the mentionedI had been asked this question during an internship interview.I'm obligated to ask this question of Structures for Realization of Discrete Time Systems topic in portion Discrete Time Systems Implementation of Digital Signal Processing

Answer»

Correct choice is (a) y(N)=-\(\sum_{k=1}^N a_k y(n-k)+\sum_{k=0}^N b_k x(n-k)\)

For explanation: We know that, the general linear constant coefficient DIFFERENCE EQUATION characterizing an LTI DISCRETE time system is given by the expression

y(n)=-\(\sum_{k=1}^N a_k y(n-k)+\sum_{k=0}^N b_k x(n-k)\)