ASSIGNMENT QUESTIONS OF NETWORK THEORY

B.TECH 3rd SEMESTER (EEE & EE BRANCH)

MODULE-1

Chapter-1 NETWORK TOPOLOGY

Short Questions:
1. Define graph.
2. How graphs are classified? Explain.
3. Define (i) Planner Graphs (ii) Non Planner Graphs.
4. Define (i) Sub graph (ii) Oriented Graph.
5. Define the following (i) Tree (ii) Link (iii) Twig (iv) Co-tree (v) Cut set (vi) Loop
6. What do you mean by fundamental cut set?
7. Write the relationship between Link, Branch and Node?
8. How you can determine the number of possible trees of a graph?
9. Define reduced incidence matrix.
10. Find the complete incidence matrix for the network graph shown below.

11. How is network analyzed by Loop analysis?

12. How is network analyzed by Node analysis?

LONG QUESTIONS:
1. For the given network set-up find a corresponding tie set matrix and obtain the KVL
Equations.

2. For the given network draw the graph & find the possible numbers of trees and show the
trees.

3. Write down the properties of a Tree in the study of network topology with valid example
for the explanation of each property.