Explore topic-wise MCQs in Network Theory.

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

1.

For a given connected network and for a fixed tree, the fundamental loop matrix is given by\(B = \left[ \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & -1 \\ 0 & 0 & 1 & 1 & -1 & -1 \\ \end{matrix} \right]\)The fundamental cut-set matrix Q corresponding to the same tree is given by

A. \(Q = \left[ \begin{matrix} -1 & 0 & -1 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 0 \\ 0 & 1 & 1 & 0 & 0 & 1 \\ \end{matrix} \right]\)
B. \(Q = \left[ \begin{matrix} -1 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & -1 & 0 & 1 & 0 \\ 0 & 1 & 1 & 0 & 0 & 1 \\ \end{matrix} \right]\)
C. \(Q = \left[ \begin{matrix} 1 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & -1 & 0 & 1 & 0 \\ 0 & 1 & 1 & 0 & 0 & 1 \\ \end{matrix} \right]\)
D. \(Q= \left[ \begin{matrix} 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & -1 \\ 1 & 0 & 1 & 1 & -1 & -1 \\ \end{matrix} \right]\)
Answer» B. \(Q = \left[ \begin{matrix} -1 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & -1 & 0 & 1 & 0 \\ 0 & 1 & 1 & 0 & 0 & 1 \\ \end{matrix} \right]\)
Discussion
2.

If we want to represent a relation between number of link current and number of branch currents in a directional graph, we should use:

A. reduced incidence
B. incidence
C. tie set
D. cutset
Answer» D. cutset
Discussion
3.

A network has seven nodes and five independent loops. The number of branches in the network is

A. 13
B. 12
C. 11
D. 10
Answer» D. 10
Discussion
4.

For any lumped network, for any cut sets and at any instant of time the algebraic sum of all branch currents traversing the cut-set branches is always:

A. One
B. Zero
C. Infinity
D. Greater than zero, but less than one
Answer» C. Infinity
Discussion
5.

In the following graph, the number of trees (P) and cutset (Q) are

A. \(P = 2,\ Q = 2\)
B. \(P = 2,\ Q = 6\)
C. \(P = 4,\ Q = 6\)
D. \(P = 4,\ Q = 10\)
Answer» D. \(P = 4,\ Q = 10\)
Discussion