Network Theory Questions and Answers Part-4

1. The current law represents a mathematical statement of fact that ___________
a) voltage cannot accumulate at node
b) charge cannot accumulate at node
c) charge at the node is infinite
d) none of the mentioned

Answer: b
Explanation: Charge cannot accumulate at the node, it can only flow in and out of the node.

2. Kirchhoff’s Current law is based on the law of conservation of ___________
a) energy
b) momentum
c) mass
d) charge

Answer: d
Explanation: Kirchhoff’s current law is based on the law of conservation of charge i.e, charge that flows in = charge that flows out.

3. Kirchhoff’s current law is applied at ___________
a) loops
b) nodes
c) both loop and node
d) none of the mentioned

Answer: b
Explanation: Kirchhoff’s current law can be applicable to nodes only.

4. Kirchhof’s current law can be mathematically stated as ___________
a) ∑k=0n I = 0
b) i2k=0n I = 0
c) i∑k=0n I = 0
d) none of the mentioned

Answer: a
Explanation: KCL states that the sum of currents entering and leaving a node is equal to zero.

5. Determine the current if a 20 coulomb charge passes a point in 0.25 seconds.
a) 10 A
b) 20 A
c) 2 A
d) 80 A

Answer: d
Explanation: By the definition of electric current, I=q/t.

6. 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: d
Explanation: If every branch of the graph has direction, then the graph is said to be a directed graph. If the graph does not have any direction then that graph is called undirected graph.

7. 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: a
Explanation: Nodes can be incident to one or more elements. The number of branches incident at the node of a graph is called degree of the node.

8. 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: c
Explanation: If a graph can be drawn on a plane surface such that no two branches of the graph cross each other, then the graph is called planar graph.

9. Number of twigs in a tree are? (where, n-number of nodes)
a) n
b) n+1
c) n-1
d) n-2

Answer: c
Explanation: Twig is a branch in a tree. Number of twigs in a tree are n-1. If there are 4 nodes in a tree then number of possible twigs are 3.

10. Loops which contain only one link are independent are called?
a) open loops
b) closed loops
c) basic loops
d) none of the mentioned

Answer: c
Explanation: The addition of subsequent link forms one or more additional loops. Loops that contain only one link are independent are called basic loops.