Professional Documents
Culture Documents
J7795 Cvlsi PDF
J7795 Cvlsi PDF
1
Question Paper Code: J7795
0
M.E. DEGREE EXAMINATION, JUNE 2010
Second Semester
4
VLSI Design
(Regulation 2009)
1
PART A — (10 × 2 = 20 Marks)
0
1. When is a problem said to be NP-complete?
1
11. (a) (i) Explain the Prim’s algorithm for spanning trees with necessary
pseudocode. (8)
(ii) Write down the pseudocode and discuss briefly the principle of Tabu
0
search. (8)
Or
(b) (i) Explain the concepts of linear programming with suitable
expressions. (10)
4
(ii) Describe simulated annealing with a pseudocode. (6)
12. (a) (i) Explain the Bellman Ford algorithm for constraint graph
compaction. (8)
(ii) Discuss the applications of Genetic algorithm in VLSI placement. (8)
Or
(b) (i) Describe the Kernighan-Lin partitioning algorithm with pseudocode
and necessary diagrams. (10)
13. (a)
(ii)
Or
4
14. (a) (i) Explain event driven simulation and its applications. (8)
(ii) Explain briefly switch level simulation. (8)
Or
(b) (i) Explain the principle and implementation of ROBDD. (8)
(ii) Give a brief note on two level logic syntheses. (8)
1
Or
0
—————————
4
2 J7795