MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 22 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. |
If [A] Matrix is Incidence matrix then which one of the following is true? |
| A. | |A| = 0 (For closed loop) |
| B. | Adj [A] / |A| = 0 (For closed loop) |
| C. | [A] = 1 (For closed loop) |
| D. | |A| = 1 (For closed loop) |
| Answer» B. Adj [A] / |A| = 0 (For closed loop) | |
| 2. |
A reduced incidence matrix of a graph is given by \(\left[ A \right] = \left[ {\begin{array}{*{20}{c}}1&1&0&0&1\\0&{ - 1}&1&0&0\\{ - 1}&0&{ - 1}&{ - 1}&0\end{array}} \right]\) The number of possible trees is |
| A. | 8 |
| B. | 15 |
| C. | 16 |
| D. | 17 |
| Answer» B. 15 | |
| 3. |
In which type of network topology computers are connected to a centralise Hub/switch |
| A. | Star topology |
| B. | Ring topology |
| C. | Bus topology |
| D. | Mesh topology |
| Answer» B. Ring topology | |
| 4. |
A network uses a fully interconnected mesh topology to connect 10 nodes together. The number of links required will be |
| A. | 35 |
| B. | 40 |
| C. | 45 |
| D. | 50 |
| Answer» D. 50 | |
| 5. |
Consider the following statements regarding the complete incidence matrix (A) of order n × b(a) The elements aij of A = 1, if branch j is associated with node i and orientation is towards node i(b) The element aij of A = -1, if the branch j is the cut set i and the orientation coincide(c) The element aij of A = 1, if the branch j is associated with node i and orientation is away from node i(d) The element aij of A = 0, if the branch j is not associated with node iWhich of the above statements are correct? |
| A. | a and b |
| B. | b and c |
| C. | c and d |
| D. | d and a |
| Answer» D. d and a | |
| 6. |
Consider the following data for twigs and links:N = Number of nodesL = Total number of linksB = Total number of branchesThe total number of links associated with a tree is |
| A. | B – N + 1 |
| B. | B – N – 1 |
| C. | B + N + 1 |
| D. | 2B – N + 1 |
| Answer» B. B – N – 1 | |
| 7. |
Following is not the property of a complete incidence matrix: |
| A. | Algebraic sum of the column entries of an incidence matrix is zero |
| B. | The rank of a complete incidence matrix of a connected graph is (n - 1), where n is total number of nodes |
| C. | Order of a complete incidence matrix will be (n × b), where b is total number of branches and n is total number of nodes |
| D. | Determinant of the incidence matrix of a closed loop is not zero. |
| Answer» E. | |
| 8. |
In a singly connected network, there are b number of branches and n number of nodes, Then the number of independent meshes M and independent nodes N are respectively |
| A. | n and b |
| B. | b – n + 1 and n - 1 |
| C. | b – n and b |
| D. | b + n – 1 and n + 1 |
| Answer» C. b – n and b | |
| 9. |
According to network graphs, the network with:1. Only two odd vertices is traversable2. No odd vertices is traversable3. Two or more than two odd vertices are traversableWhich of the above statements is / are correct? |
| A. | 1 only |
| B. | 2 only |
| C. | 3 only |
| D. | 1 and 2 |
| Answer» E. | |
| 10. |
A connected network of N > 2 nodes has at most one branch directly connecting any pair of nodes. The graph of the network _____. |
| A. | must have at least N branches for one or more closed paths to exist |
| B. | can have an unlimited number of branches |
| C. | can only have at most N branches |
| D. | can have a minimum number of branches not decided by N |
| Answer» B. can have an unlimited number of branches | |
| 11. |
Consider the following with regards to graph as shown in the figure given below:1. Regular graph2. Connected graph3. Complete graph4. Non-regular graphWhich of the above are correct? |
| A. | 1 and 4 |
| B. | 3 and 4 |
| C. | 2 and 3 |
| D. | 1 and 2 |
| Answer» E. | |
| 12. |
Mesh is a loop that contains ________ loop(s) within it |
| A. | 1 |
| B. | 2 |
| C. | 4 |
| D. | No |
| Answer» E. | |
| 13. |
Consider the following statements regarding trees:1. A tree contains all the nodes of the graph.2. A tree shall contain any one of the loops.3. Every connected graph has at least one tree.Which of the above statements are correct? |
| A. | 1 and 2 only |
| B. | 1 and 3 only |
| C. | 2 and 3 only |
| D. | 1, 2 and 3 |
| Answer» C. 2 and 3 only | |
| 14. |
For a given fixed tree of a network, the following form an independent set:1. Branch currents2. Link voltagesWhich of the above is / are correct? |
| A. | 1 only |
| B. | 2 only |
| C. | Both 1 and 2 |
| D. | Neither 1 nor 2 |
| Answer» E. | |
| 15. |
If Qt and Ql be the sub-matrices of Qf (fundamental cut-set matrix) corresponding to twigs and links of a connected graph respectively, then:a) Qt is an identity matrixb) Ql is a rectangular matrixc) Qf is of rank (n-1)Which of the above are correct? |
| A. | a and b only |
| B. | a and c only |
| C. | b and c only |
| D. | a, b and c |
| Answer» E. | |
| 16. |
A graph is said to be “a connected graph” if |
| A. | only two nodes are connected |
| B. | you cannot get from any node to any other node by following a sequence of borders |
| C. | you can get from any node to any other node by following a sequence of edges |
| D. | only three nodes are connected |
| Answer» D. only three nodes are connected | |
| 17. |
A point at which two or more circuit components like resistors, capacitor intersect is known as: |
| A. | Branch |
| B. | Node |
| C. | Loop |
| D. | Mesh |
| Answer» C. Loop | |
| 18. |
A network has 8 branches and 3 independent loops. How many nodes are there in the network? |
| A. | 6 |
| B. | 5 |
| C. | 11 |
| D. | 10 |
| Answer» B. 5 | |
| 19. |
A network has 4 nodes and 3 independent loops. What is the number of branches in the network? |
| A. | 5 |
| B. | 7 |
| C. | 8 |
| D. | 6 |
| Answer» E. | |
| 20. |
For a network graph having its fundamental loop matrix Bf and its sub-matrices Bt and Bl corresponding to twigs and links, which of the following statements are correct?1) Bl is always an identity matrix.2) Bt is an identity matrix.3) Bf has rank of b – (n – 1), where b is the number of branches and n is the number of nodes of the graph. |
| A. | 1 and 2 only |
| B. | 2 and 3 only |
| C. | 1 and 3 only |
| D. | 1, 2 and 3 |
| Answer» D. 1, 2 and 3 | |
| 21. |
A graph in which at least one path (disregarding orientation) exists between any two nodes of the graph is a |
| A. | connected graph |
| B. | directed graph |
| C. | sub-graph |
| D. | fundamental graph |
| Answer» B. directed graph | |
| 22. |
Number of fundamental cut sets of any graph will be: |
| A. | Same as the number of twigs |
| B. | Same as the number of tree branches |
| C. | Same as the number of nodes |
| D. | Equal to 1 |
| Answer» B. Same as the number of tree branches | |