SRM University 2007 B.Tech Computer Science and Engineering BANK : - Question Paper

41. Using source Transformation. obtain the power delivered by the 50V voltage source in the circuit shown in fig.1.41
42. Find the power delivered by the 5A current source in the circuit shown in fig.1.42 using nodal method.
43. Determine the loop currents for the circuit shown in the fign.1.43 by using mesh analysis.
44. Determine the current I in the circuit by using loop analysis shown in fig.1.44
45. Use mesh analysis to obtain V2 in the circuit shown in fig.1.45 that will reason the voltage across 20O resistor to be zero.

UNIT – II : GRAPH THEORY
Part – A
1. What is a graph?
2. What is directed graph?
3. What is undirected graph?
4. What is oriented graph?
5. Define nodes, loops.
6. What is planar graph? provide example.
7. What is non-planar graph? provide example
8. Define Tree
9. Define co-tree and links
10. Branches of a tree are called ----
11. What is rank of the tree?
12. What are basic loops?
13. What is incidence matrix?
14. State the properties of incidence matrix
15. Obtain incidence matrix from the subsequent decreased incidence matrix A1 and draw its graph.

-1 1 0 0 0 0 0
0 -1 1 1 0 0 0
A1 0 0 0 -1 1 0 0
0 0 0 0 -1 1 0
0 0 -1 0 0 -1 1

16. What is tie – set?
17. Illustrate KCL using incidence matrix
18. Illustrate KVL using incidence matrix. From the circuit, shown in fig. 2.18
19. Draw its, topological graph fig.2.18
20. Write the incidence matrix fig 2.18
21. Write the tie – set matrix fig.2.10
22. Find the link current transformation formula and branch currents. Fig2.18
23. What is cut – set?
24. For the NW – graph, shown in fig. 2.24. find all the cut – set matrix
25. What is fundamental cut – set?
26. What is fundamental cut – set matrix?
27. Obtain fundamental cut – set matrix for the above NW graph shown in fign.2.27
28. What is decreased incidence matrix?

29. From the beneath incidence matrix draw its graph
-1 1 0 0 0 0 0
0 -1 1 1 0 0 0
A1 0 0 0 -1 1 0 0
0 0 -1 0 0 -1 1
1 0 0 0 0 0 -1

30. What is link current?
31. What is planar network?
32. What is non – planer network?
33. The tie – set schedule provide the relation ranging from --------------
34. The cut set schedule provide the relation ranging from ----------------
35. What is the number of independent loops for a network with n nodes and b branches
36. The number of branches in a tree is ----------- the number of branches in a graph.
37. What is a network?

Earning:   Approval pending.