Block Diagram Reduction Using Signal Flow Graph MCQ Quiz - Objective Question with Answer for Block Diagram Reduction Using Signal Flow Graph - Download Free PDF

Last updated on Mar 18, 2025

Latest Block Diagram Reduction Using Signal Flow Graph MCQ Objective Questions

Block Diagram Reduction Using Signal Flow Graph Question 1:

The block diagram of a system is shown in the figure.

F1 Uday 1.10.20 Pallavi D30

If the desired transfer function of the system is

C(s)R(s)=ss2+s+2

then G(s) is

  1. 1
  2. s
  3. 1/s
  4. ss3+s2s2

Answer (Detailed Solution Below)

Option 2 : s

Block Diagram Reduction Using Signal Flow Graph Question 1 Detailed Solution

Concept:

According to Mason’s gain formula, the transfer function is given by

TF=k1nMkΔkΔ

Where,

 n = no of forward paths

Mk = kth forward path gain

Δk = the value of Δ which is not touching the kth forward path

Δ = 1 – (sum of the loop gains) + (sum of the gain product of two non-touching loops) – (sum of the gain product of three non-touching loops)

Application:

Number of forward paths = 1

P1 = G(s)

Number of loops = 3

L1=G(s)s,L2=G(s),L3=sG(S)

Δ=1+G(s)s+G(s)+sG(s)

=1+G(s)[1s+1+s]

Δ = 1

Transfer function C(s)R(s)=G(s)1+G(s)[1s+1+s]

It is given that, C(s)R(s)=ss2+s+2

G(s)1+G(s)[1s+1+s]=ss2+s+2

G(s)[s2+s+2]=s+G(s)[1+s+s2]

⇒ G(s) = s

Block Diagram Reduction Using Signal Flow Graph Question 2:

The signal flow graph of a system is shown below. U(s) is the input and C(s) is the output.

F1 Uday.B 01-10-20 Savita D8

Assuming, h1 = b1 and h0 = b0 – b1a1, the input-output transfer function, G(s)=C(s)R(s) of the system is given by

  1. G(s)=b0s+b1s2+a0s+a1
  2. G(s)=a1s+a0s2+b1s+b0
  3. G(s)=b1s+b0s2+a1s+a0
  4. G(s)=a0s+a1s2+b0s+b1

Answer (Detailed Solution Below)

Option 3 : G(s)=b1s+b0s2+a1s+a0

Block Diagram Reduction Using Signal Flow Graph Question 2 Detailed Solution

Concept:

According to Mason’s gain formula, the transfer function is given by

TF=k1nMkΔkΔ

Where,

 n = no of forward paths

Mk = kth forward path gain

Δk = the value of Δ which is not touching the kth forward path

Δ = 1 – (sum of the loop gains) + (sum of the gain product of two non-touching loops) – (sum of the gain product of three non-touching loops)

Application:

Number of forward paths = 2

P1=h0s2,P2=h1s

Number of loops = 2

L1=a1s,L2=a0s2

Δ=1+a1s+a0s2

Δ1=1,Δ2=1+a1s

Transfer function =h0s2(1)+h1s(1+a1s)1+a1s+a0s2

=h0+h1(s+a1)s2+a1s+a0

=b0b1a1+b1(s+a1)s2+a1s+a0

G(s)=b1s+b0s2+a1s+a0

Block Diagram Reduction Using Signal Flow Graph Question 3:

The transfer function C(s)R(s) for the system with the following signal flow graph.

1 U.B 19.5.20 Pallavi D 4

  1. C(s)R(s)=G1G2G3G4+G5(1+G3H2+H1+G3H1)(1+G3H2+G4H3+H1+G3H1H2+G4H3+H1+G4H1H3)
  2. C(s)R(s)=G1G2G3G4+G5(1+G3H2+H1+G3H1H2)(1+G3H2+G4H3+H1+G3H1H2+G4H1H3)
  3. C(s)R(s)=G1G2G3G4+G5(1+G3H2+H1+G3H1+G3H1H3)(1+G3H2+G4H3+H1+G3H1H2+G4H1H3)
  4. C(s)R(s)=G1G2G3G4+G5(1+G3H2+G4H3+H1+G3H1H2+G4H3+G4H1H3)

Answer (Detailed Solution Below)

Option 2 : C(s)R(s)=G1G2G3G4+G5(1+G3H2+H1+G3H1H2)(1+G3H2+G4H3+H1+G3H1H2+G4H1H3)

Block Diagram Reduction Using Signal Flow Graph Question 3 Detailed Solution

Concept:

According to Mason’s gain formula, the transfer function is given by

TF=k=1nMkΔkΔ

Where, n = no of forward paths

Mk = kth forward path gain

Δk = the value of Δ which is not touching the kth forward path

Δ = 1 – (sum of the loop gains) + (sum of the gain product of two non-touching loops) – (sum of the gain product of three non-touching loops)

Application:

Forward paths: P1 = G1G3G2G4, P2 = G5

Loops: L1 = -H1, L2  -G3 H2, L3 = -G4H3

Two no touching loops: + H1H2G3, H1H3G4

Δ = 1 – (-H1 – G3H2 – G4H3) + (H1H2G3 + H1H3G4)

= 1 + G3H2 + G4H3 + H1 + G3H1H2 + G4H1H3

Δ1 = 1

Δ2 = 1 + G3H2 + H1 + G3H1H2 

C(s)R(s)=G1G2G3G4+G5(1+G3H2+H1+G3H1H2)(1+G3H2+G4H3+H1+G3H1H2+G4H1H3)

Block Diagram Reduction Using Signal Flow Graph Question 4:

Which of the options is an equivalent representation of the signal flow graph shown here?

F2 U.B Madhu 24.04.20 D3

  1. F2 U.B Madhu 24.04.20 D4
  2. F2 U.B Madhu 24.04.20 D5
  3. F2 U.B Madhu 24.04.20 D6
  4. F2 U.B Madhu 24.04.20 D7

Answer (Detailed Solution Below)

Option 3 : F2 U.B Madhu 24.04.20 D6

Block Diagram Reduction Using Signal Flow Graph Question 4 Detailed Solution

Concept:

According to Mason’s gain formula, the transfer function is given by

TF=k=1nMkΔkΔ

Where, n = no of forward paths

Mk = kth forward path gain

Δk = the value of Δ which is not touching the kth forward path

Δ = 1 – (sum of the loop gains) + (sum of the gain product of two non-touching loops) – (sum of the gain product of three non-touching loops)

Application:

In the given signal flow graph,

Forward paths: P1 = ad

Loops: L1 = cd, L2 = ade

Δ = 1 – (cd + ade)

Δ1 = 1

Transfer function =ad1(cd+ade)

Now, let us check the options.

Option 1:

Forward paths: P1 = a(d + c)

Loops: L1 = ae(d + c)

Δ = 1 – ae(d + c)

Δ1 = 1

Transfer function =a(d+c)1ae(d+c)

Option 2:

Forward paths: P1 = d(a + c)

Loops: L1 = de(a + c)

Δ = 1 – de(a + c)

Δ1 = 1

Transfer function =d(a+c)1de(a+c)

Option 3:

Forward paths: P1=a(d1cd)

Loops: L1=ae(d1cd)

Δ=1ae(d1cd)

Δ1 = 1

Transfer function =a(d1cd)1ae(d1cd)=ad1(cd+ade)

Option 4:

Forward paths: P1=a(c1cd)

Loops: L1=ae(c1cd)

Δ=1ae(c1cd)

Δ1 = 1

Transfer function =a(c1cd)1ae(c1cd)=ad1(cd+ace)

Hence the signal graph in option (3) is the equivalent representation of the signal flow graph given in the question.

Block Diagram Reduction Using Signal Flow Graph Question 5:

The transfer function for the given signal flow graph is

  1. G1G4(G2+G3)1G1G4H1+G1G2G4H2
  2. G1G4(G2+G3)1G1G4H1+G1G3G4+G1G2G4H2
  3. G1G4(G2+G3)1G1G4H1+G1G3G4H2+G1G2G4H2
  4. G1G4(G2+G3)1+G1G4H1G1G3G4G1G2G4H2

Answer (Detailed Solution Below)

Option 3 : G1G4(G2+G3)1G1G4H1+G1G3G4H2+G1G2G4H2

Block Diagram Reduction Using Signal Flow Graph Question 5 Detailed Solution

Forward paths: P1 = G1G4G2, P2 = G1G4G3

Loops: L1 = G1G4H1, L2 = G1G4G2H2, L3 = -G1G4G3H2

There are no nontouching loops.

Δ = 1 – (L1 + L2 + L3)

L1 = G1G4H1

L2 =  -G1G2G4H2

L3 =  -G1G4G3H2

Δ = 1 – G1G4H1 + G1G2G4H2 + G1G4G3H2

Δ1 = 1, Δ2 = 1

Transfer function, CR=G1G4(G2+G3)1G1G4H1+G1G3G4H2+G1G2G4H2

Top Block Diagram Reduction Using Signal Flow Graph MCQ Objective Questions

Which of the options is an equivalent representation of the signal flow graph shown here?

F2 U.B Madhu 24.04.20 D3

  1. F2 U.B Madhu 24.04.20 D4
  2. F2 U.B Madhu 24.04.20 D5
  3. F2 U.B Madhu 24.04.20 D6
  4. F2 U.B Madhu 24.04.20 D7

Answer (Detailed Solution Below)

Option 3 : F2 U.B Madhu 24.04.20 D6

Block Diagram Reduction Using Signal Flow Graph Question 6 Detailed Solution

Download Solution PDF

Concept:

According to Mason’s gain formula, the transfer function is given by

TF=k=1nMkΔkΔ

Where, n = no of forward paths

Mk = kth forward path gain

Δk = the value of Δ which is not touching the kth forward path

Δ = 1 – (sum of the loop gains) + (sum of the gain product of two non-touching loops) – (sum of the gain product of three non-touching loops)

Application:

In the given signal flow graph,

Forward paths: P1 = ad

Loops: L1 = cd, L2 = ade

Δ = 1 – (cd + ade)

Δ1 = 1

Transfer function =ad1(cd+ade)

Now, let us check the options.

Option 1:

Forward paths: P1 = a(d + c)

Loops: L1 = ae(d + c)

Δ = 1 – ae(d + c)

Δ1 = 1

Transfer function =a(d+c)1ae(d+c)

Option 2:

Forward paths: P1 = d(a + c)

Loops: L1 = de(a + c)

Δ = 1 – de(a + c)

Δ1 = 1

Transfer function =d(a+c)1de(a+c)

Option 3:

Forward paths: P1=a(d1cd)

Loops: L1=ae(d1cd)

Δ=1ae(d1cd)

Δ1 = 1

Transfer function =a(d1cd)1ae(d1cd)=ad1(cd+ade)

Option 4:

Forward paths: P1=a(c1cd)

Loops: L1=ae(c1cd)

Δ=1ae(c1cd)

Δ1 = 1

Transfer function =a(c1cd)1ae(c1cd)=ad1(cd+ace)

Hence the signal graph in option (3) is the equivalent representation of the signal flow graph given in the question.

In the system whose signal flow graph is shown in the figure, U1(s) and U2(s) are inputs. The transfer function Y(s)U1(s) is

GATE IN Signals and digital 30Q Sunny.docx 5

  1. k1JLs2+JRs+k1k2
  2. k1JLs2JRsk1k2
  3. k1U2(R+sL)JLs2+(JRU2L)s+k1k2U2R
  4. k1U2(sLR)JLs2(JR+U2L)sk1k2+U2R

Answer (Detailed Solution Below)

Option 1 : k1JLs2+JRs+k1k2

Block Diagram Reduction Using Signal Flow Graph Question 7 Detailed Solution

Download Solution PDF

No. of forward paths from u1(s) to Y(s) are:

P1=(1)(1L)(1S)(K1)(1J)(1S)(1)=K1JLS2

No. of loops are:

L1=(1L)(1S)(R)=RSL

L2=(1L)(1s)(K1)(1J)(1S)(K2)=K1K2JLS2

Δ=1(L1+L2)=1+RSL+K1K2JLS2

From Mason’s gain formula:

Transfer function =K=1nPKΔKΔ

=K1JLS2(1)1+RSL+K1K2JLS2

Y(s)U1(s)=K1JLS2+JRS+K1K2

For the signal – flow graph shown in the figure, which one of the following expression is equal to the transfer function  Y(s)X2(s)|X1(s)=0?

Gate EE 2015 paper 1 Images-Q17

  1. G11+G2(1+G1)
  2. G21+G1(1+G2)
  3. G11+G1G2
  4. G21+G1G2

Answer (Detailed Solution Below)

Option 2 : G21+G1(1+G2)

Block Diagram Reduction Using Signal Flow Graph Question 8 Detailed Solution

Download Solution PDF

Concept:

Mason’s gain formula is

T=C(s)R(s)=i=1NPiΔiΔ

Where,

C(s) is the output node

R(s) is the input node

T is the transfer function or gain between R(s) and C(s)

Pi is the ith forward path gain

Δ = 1−(sum of all individual loop gains) + (sum of gain products of all possible two non-touching loops) − (sum of gain products of all possible three non-touching loops) + ........

Δi is obtained from Δ by removing the loops which are touching the ith forward path.

Calculation:

Given signal flow graph,

Gate EE 2015 paper 1 Images-Q17

The number of forward paths from X2 to Y is 1

P1Δ1 = G2

Number of loops 

L1 = - G1G2, L2 = G1

Δ = 1 - (L1 + L2) = 1 + G1 + G1G2 

TF=P1Δ1Δ=G21+G1[1+G2]

To revise the concept, click here.

The block diagram of a system is shown in the figure.

F1 Uday 1.10.20 Pallavi D30

If the desired transfer function of the system is

C(s)R(s)=ss2+s+2

then G(s) is

  1. 1
  2. s
  3. 1/s
  4. ss3+s2s2

Answer (Detailed Solution Below)

Option 2 : s

Block Diagram Reduction Using Signal Flow Graph Question 9 Detailed Solution

Download Solution PDF

Concept:

According to Mason’s gain formula, the transfer function is given by

TF=k1nMkΔkΔ

Where,

 n = no of forward paths

Mk = kth forward path gain

Δk = the value of Δ which is not touching the kth forward path

Δ = 1 – (sum of the loop gains) + (sum of the gain product of two non-touching loops) – (sum of the gain product of three non-touching loops)

Application:

Number of forward paths = 1

P1 = G(s)

Number of loops = 3

L1=G(s)s,L2=G(s),L3=sG(S)

Δ=1+G(s)s+G(s)+sG(s)

=1+G(s)[1s+1+s]

Δ = 1

Transfer function C(s)R(s)=G(s)1+G(s)[1s+1+s]

It is given that, C(s)R(s)=ss2+s+2

G(s)1+G(s)[1s+1+s]=ss2+s+2

G(s)[s2+s+2]=s+G(s)[1+s+s2]

⇒ G(s) = s

The signal flow graph of a system is shown below. U(s) is the input and C(s) is the output.

F1 Uday.B 01-10-20 Savita D8

Assuming, h1 = b1 and h0 = b0 – b1a1, the input-output transfer function, G(s)=C(s)R(s) of the system is given by

  1. G(s)=b0s+b1s2+a0s+a1
  2. G(s)=a1s+a0s2+b1s+b0
  3. G(s)=b1s+b0s2+a1s+a0
  4. G(s)=a0s+a1s2+b0s+b1

Answer (Detailed Solution Below)

Option 3 : G(s)=b1s+b0s2+a1s+a0

Block Diagram Reduction Using Signal Flow Graph Question 10 Detailed Solution

Download Solution PDF

Concept:

According to Mason’s gain formula, the transfer function is given by

TF=k1nMkΔkΔ

Where,

 n = no of forward paths

Mk = kth forward path gain

Δk = the value of Δ which is not touching the kth forward path

Δ = 1 – (sum of the loop gains) + (sum of the gain product of two non-touching loops) – (sum of the gain product of three non-touching loops)

Application:

Number of forward paths = 2

P1=h0s2,P2=h1s

Number of loops = 2

L1=a1s,L2=a0s2

Δ=1+a1s+a0s2

Δ1=1,Δ2=1+a1s

Transfer function =h0s2(1)+h1s(1+a1s)1+a1s+a0s2

=h0+h1(s+a1)s2+a1s+a0

=b0b1a1+b1(s+a1)s2+a1s+a0

G(s)=b1s+b0s2+a1s+a0

The overall closed loop transfer function C(s)R(s), represented in the figure, will be

GATE IN 2017 Official Sunny  Nita Aman 8Q images Nita Q6

  1. {G1(s)+G2(s)}G3(s)1+(G1(s)+G2(s))(H1(s)+G3(s))
  2. (G1(s)+G3(s))1+G1(s)H1(s)+G2(s)G3(s)
  3. (G1(s)G2(s))H1(s)1+(G1(s)+G3(s))(H1(s)+G1(s))
  4. G1(s)G2(s)H1(s)1+G1(s)H1(s)+G1(s)G3(s)

Answer (Detailed Solution Below)

Option 1 : {G1(s)+G2(s)}G3(s)1+(G1(s)+G2(s))(H1(s)+G3(s))

Block Diagram Reduction Using Signal Flow Graph Question 11 Detailed Solution

Download Solution PDF

Manon’s gain Formula for the determination of the overall system gain is given by

T=k=1kPkΔkΔ

T = Overall gain of the system

Pk = Path gain of the system

Δ = 1 – (sum of loop gains of all individual loops) + (sum of gain products of all possible combination of two non-touching loops)

Δk = the value of Δ for the part of the graph not touching with the kth forward path

Δ1 = G1(s) G3(s)

Δ2 = G2(s) G3(s)

L1 = G1(s) H1(s)

L2 = G2(s) H1(s)

L3 = G1(s) G3(s)

L4 = G2(s) G3(s)

{G1(s)+G2(s)}G3(s)1+(G1(s)+G2(s))(H1(s)+G3(s))

Block Diagram Reduction Using Signal Flow Graph Question 12:

The block diagram is shown in the figure.

F1 U.B Madhu 04.05.20 D1

The expression for c(t) if r(t) = u(t) and n(t) = δ(t) is ______

  1. 1 – 3te-t + 3e-2t
  2. 3e-t – 3e-2t
  3. 1 – 3e-t + 3e-2t
  4. 2e-t – te-2t

Answer (Detailed Solution Below)

Option 3 : 1 – 3e-t + 3e-2t

Block Diagram Reduction Using Signal Flow Graph Question 12 Detailed Solution

For N(s) = 0,

F1 U.B Madhu 04.05.20 D2

C(s)R(s)=2s1(s+3)1+2s1(s+3)=2s(s+3)+2=2(s+1)(s+2)

For R(s) = 0,

F1 U.B Madhu 04.05.20 D3

C(s)N(s)=1(s+3)1+2s1s+3=s(s+1)(s+2)

Given that, r(t) = u(t), n(t) = δ(t)

R(s)=1s,N(s)=1

C(s)=2(s+1)(s+2)1s+s(s+1)(s+2)

=s2+2s(s+1)(s+2)

=1s3(s+1)+3(s+2)

By applying inverse Laplace transform,

c(t) = 1 – 3e-t + 3e-2t

Block Diagram Reduction Using Signal Flow Graph Question 13:

Which of the options is an equivalent representation of the signal flow graph shown here?

F2 U.B Madhu 24.04.20 D3

  1. F2 U.B Madhu 24.04.20 D4
  2. F2 U.B Madhu 24.04.20 D5
  3. F2 U.B Madhu 24.04.20 D6
  4. F2 U.B Madhu 24.04.20 D7

Answer (Detailed Solution Below)

Option 3 : F2 U.B Madhu 24.04.20 D6

Block Diagram Reduction Using Signal Flow Graph Question 13 Detailed Solution

Concept:

According to Mason’s gain formula, the transfer function is given by

TF=k=1nMkΔkΔ

Where, n = no of forward paths

Mk = kth forward path gain

Δk = the value of Δ which is not touching the kth forward path

Δ = 1 – (sum of the loop gains) + (sum of the gain product of two non-touching loops) – (sum of the gain product of three non-touching loops)

Application:

In the given signal flow graph,

Forward paths: P1 = ad

Loops: L1 = cd, L2 = ade

Δ = 1 – (cd + ade)

Δ1 = 1

Transfer function =ad1(cd+ade)

Now, let us check the options.

Option 1:

Forward paths: P1 = a(d + c)

Loops: L1 = ae(d + c)

Δ = 1 – ae(d + c)

Δ1 = 1

Transfer function =a(d+c)1ae(d+c)

Option 2:

Forward paths: P1 = d(a + c)

Loops: L1 = de(a + c)

Δ = 1 – de(a + c)

Δ1 = 1

Transfer function =d(a+c)1de(a+c)

Option 3:

Forward paths: P1=a(d1cd)

Loops: L1=ae(d1cd)

Δ=1ae(d1cd)

Δ1 = 1

Transfer function =a(d1cd)1ae(d1cd)=ad1(cd+ade)

Option 4:

Forward paths: P1=a(c1cd)

Loops: L1=ae(c1cd)

Δ=1ae(c1cd)

Δ1 = 1

Transfer function =a(c1cd)1ae(c1cd)=ad1(cd+ace)

Hence the signal graph in option (3) is the equivalent representation of the signal flow graph given in the question.

Block Diagram Reduction Using Signal Flow Graph Question 14:

The DC gain of the filter shown below is –

D91

Answer (Detailed Solution Below) -0.5

Block Diagram Reduction Using Signal Flow Graph Question 14 Detailed Solution

P1 = -2

1 = 1

P2=1S

2 = 1

Δ=1(2s)=1+2s

T.F=P1Δ1+P2Δ2Δ=2×1+(1s)11+2s

=2s1s+2

For DC gain, put s = 0

=2(0)10+2=12

Block Diagram Reduction Using Signal Flow Graph Question 15:

The transfer function of the given diagram is___

2

  1. G1G21G1H1+G2H1
  2. (G1+G2)1+G1H1+G2H1
  3. G1+G21G1H1G2H1
  4. G1G21+G1H1+G2H1

Answer (Detailed Solution Below)

Option 3 : G1+G21G1H1G2H1

Block Diagram Reduction Using Signal Flow Graph Question 15 Detailed Solution

Concept:

A signal flow graph is a graphical representation of the relationships between the variables of a set of linear algebraic equations.

Manson's gain formula:

T=k=1kPkΔkΔ

  • Where Pk is the forward path transmittance of kth in the path from a specified input is known to an output node. In arresting Pk no node should be encountered more than once.
  • Δ is called the signal flow graph determinant.
  • Δ = 1 – (sum of all individual loop transmittances) + (sum of loop transmittance products of all possible pair of non-touching loops) – (sum of loop transmittance products of all possible triplets of non-touching loops) + (……) – (……)
  • Δ k is the factor associated with the concerned path and involves all closed loop in the graph which are isolated from the forward path under consideration.
  • The path factor Δk for the kth path is equal to the value of the grab determinant of its signal flow graph which exists after erasing the Kth path from the graph.

 

Explanation:

There are two forward paths, G1 and G2

∴ Pk = G1 + G2

Δ= 1 

There are two loop, G1H1 and G2H1

∴ Δ = 1 - G1H1 - G2H1

By using mason’s gain formula, the transfer will be 

G1+G21G1H1G2H1

Get Free Access Now
Hot Links: teen patti 3a teen patti gold apk download teen patti - 3patti cards game online teen patti real money