You are on page 1of 1

QMP 7.1 R/C-1 Rev.

Channabasaveshwara Institute of Technology


( ISO 9001:2008 Certified Institution)

NH 206 (B.H. Road), Gubbi, Tumkur 572 216. Karnataka.


INTERNAL ASSESSMENT QUESTION BANK Department: ECE Duration: 1Hrs. Sem. & Sec.: II M.Tech Sub. & Sub. Code: SODC & 12EC Date:20 /04/2013 Max. Marks: 40

1. What is microelectronics? Explain design styles of microelectronics. 2. Explain computer aided synthesis & optimization in microelectronics. 3. Explain the following terms a) Directed graph b) Undirected graph c) Cycle d) Isometric graph e) Clique cover number. 4. Explain Branch & bound algorithm with an example. 5. a) Find the graph is perfect or not.

10M 10M

5*2M 10M 5*2M

b) Explain types of algorithms. 6. Explain greedy scheduling algorithm with an example. 7. Explain DIJKSTRA algorithm with an example. 8. Find the solution for the graph shown below using BELL MAN FORD algorithm.

10M 10M 10M

9. Explain vertex cover algorithm with an example. 10. Explain clique partition algorithm with an example.

10M 10M

You might also like