Machine-translated by Google. Questions are authored in English.
Top

Signal Flow Graphs Questions and Answers

1.

Loop which do not possess any common node are said to be :

Exam Year(s)

MH SET - 2023, SET Exam - 2023,

Answer: C

Loops with no common node are non-touching loops.

In a signal flow graph, two loops are non-touching if they share no node. Mason's gain formula needs them: the determinant subtracts the individual loop gains and adds the products of gains of pairs of non-touching loops, then subtracts triples, and so on.

Touching loops are those that share at least one node. Forward paths run from input to output and are not loops, and 'feedback gain loops' is not the term for loops without common nodes.

Please log in or register to report this question.

Loading…
Tags: Signal Flow Graphs Questions and Answers || Signal Flow Graphs MCQ Questions and Answers || Signal Flow Graphs GK Questions and Answers || Signal Flow Graphs GK MCQ Questions || Signal Flow Graphs Multiple Choice Questions and Answers || Signal Flow Graphs GK || GK on Signal Flow Graphs || Control Systems Questions and Answers || Control Systems MCQ Questions and Answers || Control Systems GK Questions and Answers || GK on Control Systems