Register

GATE ECE 2019 | Question: 6

• recategorized by
660 views
0 0 votes

For an LTI  system, the Bode plot for its gain is as illustrated in the figure shown. The number of system poles $N_{p}$ and the number of system zeros $N_{z}$ in the frequency range $1\: Hz \leq f \leq \:10^{7} Hz $ is

  1. $N_{p}=5, N_{z}=2$
  2. $N_{p}=6, N_{z}=3$
  3. $N_{p}=7, N_{z}=4$
  4. $N_{p}=4, N_{z}=2$

Please log in or register to answer this question.

Answer:
← Previous · GATE ECE 2019 | Ques...Next → · GATE ECE 2019 | Ques...
← Previous in category · GATE ECE 2019 | Ques...Next in category → · GATE ECE 2019 | Ques...
Position:
Show:
Voting & Accepting an answer helps improve the community

Related questions

0 0 votes
0 0 answers
577
577 views
Arjun asked Feb 12, 2019
577 views
GATE ECE 2019 | Question: 33
Let the state-space representation of an LTI system be $x(t)=A x(t)+B u(t), y(t)=Cx(t)+du(t)$ where $A,B,C$ are matrices, $d$ is a scalar, $u(t)$ is the input to the syst...
0 0 votes
0 0 answers
487
487 views
Arjun asked Feb 12, 2019
487 views
GATE ECE 2019 | Question: 3
Let $H(z)$ be the $z-$ transform of a real-valued discrete-time signal $h[n].$ If $P(z) = H(z) H(\frac{1}{z})$ has a zero at $z= \frac{1}{2}+\frac{1}{2}j,$ and $P(z)$ has...
0 0 votes
0 0 answers
981
981 views
Arjun asked Feb 12, 2019
981 views
GATE ECE 2019 | Question: 28
Consider a six-point decimation-in-time Fast Fourier Transform $(FFT)$ algorithm, for which the signal-flow graph corresponding to $X $ is shown in the figure. Let $W_{6}...
0 0 votes
0 0 answers
670
670 views
admin asked Nov 17, 2017
670 views
GATE ECE 2017 Set 1 | Question: 6
Consider a single input single output discrete-time system with $x[ n ]$ as input and $y [ n ]$ as output, where the two are related as$$y [ n ]= \begin{cases} n \mid x [...

Add Synced Question

×