Mason's rule is applied to
Mason's rule or Mason’s gain formula is applied to signal flow graph for finding the transfer function.
Assertion (A): Signal flow graph is applicable to the linear systems.
Reason (R): Signal flow graph method of finding the transfer function of a system is very simple and does not require any reduction technique.
Signal flow graph is applicable to the linear systems because output is proportional to gain of the system
Reason (R) is also true but is not a correct explanation of assertion (A)
Consider the following three cases of signal flow graph and their corresponding transfer functions:
Q. Which of the above relations is/are correctly matched?
Hence, only 1 is correctly matched.
The signal flow graph shown below has M number of forward path and N number of individual loops.
Q. What are the values of M and N ?
The signal flow graph for a certain feedback control system is given below.
Now, consider the following set of equations for the nodes:
Q. Which of the above equations are correct?
Correct Answer :- b
Explanation : x2 = a1x1 + a5x3 + a6x4 + a7x5
x3 = a2x2
x4 a3x3 + a9x5
x5 = a4x4 + a8x3
The gain C(s)/R(s) of the signal flow graph shown below is
Gain of forward paths are:
P1 = G1G2G3 and P2 = G4
Here, Δ1 = 1
and Δ2 = (1 + G1G2— G2G3)
Individual loops are:
L1 = -G1G2
and L2 = G2G3
Non-touching loop = Nil
The number of forward paths and the number of non-touching loop pairs for the signal flow graph shown in the figure below are respectively
Forward paths are
P1 = G1G2G3 and P2 = G3G4
Gain product of non-touching loop pairs are:
L1 L2 = G1H1H4
and L1L3 = G1G3H1H2
Thus, there are two forward paths and two non touching loop pairs
The signal flow graph of the RLC circuit of figure (i) is shown in figure (ii)
The values of G1 and H1 are respectively
Converting the given circuit in s-domain and writing the equations, we get:
Also, from given SFG, we have
The closed loop transfer function CIR for the signal graph shown below is
Number of forward paths are two,
Consider the following statements with regards to the signal flow graph shown below.
1. The number of forward paths are 2.
2. The number of forward paths are 3.
3. The number of loops are 3.
4. The number of loops are 5,
5. The number of non-touching loop pairs is 1.
6. The number of non-touching loop pairs is nil.
Q. Which of these statements are correct?
Use Code STAYHOME200 and get INR 200 additional OFF
|
Use Coupon Code |
![]() |
|
![]() |
![]() |
|
![]() |
|
|
|
|
|