Explore topic-wise MCQs in Network Theory.

This section includes 11 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 there are 4 branches, 3 nodes then number of links in a co-tree are?

A. 2
B. 4
C. 6
D. 8
Answer» B. 4
Discussion
2.

If a graph consists of 5 nodes, then the number of twigs in the tree is?

A. 1
B. 2
C. 3
D. 4
Answer» E.
Discussion
3.

If A represents incidence matrix, I represents branch current vectors, then?

A. AI = 1
B. AI = 0
C. AI = 2
D. AI= 3
Answer» C. AI = 2
Discussion
4.

Number of twigs in a tree are? (where, n-number of nodes)

A. n
B. n+1
C. n-1
D. n-2
Answer» D. n-2
Discussion
5.

IF_A_REPRESENTS_INCIDENCE_MATRIX,_I_REPRESENTS_BRANCH_CURRENT_VECTORS,_THEN??$

A. AI = 1
B. AI = 0
C. AI = 2
D. AI= 3
Answer» E.
Discussion
6.

If_a_graph_consists_of_5_nodes,_then_the_number_of_twigs_in_the_tree_are?$

A. 1
B. 2
C. 3
D. 4
Answer» B. 2
Discussion
7.

Loops which contain only one link are independent are called?

A. open loops
B. closed loops
C. basic loops
D. none of the above
Answer» D. none of the above
Discussion
8.

Number of twigs in a tree are? n- number of nodes

A. n
B. n+1
C. n-1
D. n-2
Answer» D. n-2
Discussion
9.

If no two branches of the graph cross each other, then the graph is called?

A. directed graph
B. undirected graph
C. planar graph
D. non-planar graph
Answer» D. non-planar graph
Discussion
10.

The number of branches incident at the node of a graph is called?

A. degree of the node
B. order of the node
C. status of the node
D. number of the node
Answer» B. order of the node
Discussion
11.

A graph is said to be a directed graph if ________ of the graph has direction.

A. 1 branch
B. 2 branches
C. 3 branches
D. every branch
Answer» E.
Discussion