Unit- I VLSI DESIGN METHODOLOGIES 2 marks What are the important entities that must be considered to optimize?

What are the three ways of checking the correctness of an integrated circuit without actually fabricating it? Define graph. Define computational complexity. What are the types of computational complexity? Define node. Define digraph. Define cycle. What is self- loop? Define Heuristics. Differentiate approximation algorithms and heuristics. What do you mean by solution checking? What is clique? What is bipartite? Define in- degree and out- degree. What are tractable and intractable problems? Differentiate problem and instance. Define combinatorial optimization problem. When does a problem said to be undecidable? What do you mean by uphill moves? What is first improvement and steepest descent? 8 marks Explain in brief about Gajskis Y- chart. Discuss in brief about Prims algorithm.

Explain in brief about Unit Size placement problem. Discuss in brief about Backtracking algorithm. Explain in brief about dynamic programming Explain in brief about NP- completeness. 16 marks Discuss in detail about DFS and BFS algorithm with pseudo- code. Discuss in detail about Dijkstras algorithm with pseudo- code. Explain in detail about Y- chart. Explain in detail about Local search, Tabu search, simulated annealing, and genetic algorithms. UNIT- II LAYOUT COMPACTION (I HALF) 2 marks What do you mean by layout compaction? What is called as interact? What are the most common types of minimum distance rules? Compare topology and geometry. Define technology file. What are the applications of compaction? What is directed acyclic graph? 8marks Explain in brief about graph- theoretical formulation Explain in brief about maximum- distance constraints. 16 marks Explain in detail about Bell man ford algorithm. Explain in detail about longest path algorithm. Explain Liao- Wong algorithm.

UNIT- II LAYOUT COMPACTION (II HALF) 2 marks What is the goal of placement? What does the partitioning problem deal with? Define Cell. Define port. Define net. How do you evaluate the quality of placement? What are the types of placement problems? What are placement algorithms? 8 marks Explain in detail about types of placement problems. Explain in detail about the metrics that are used for estimating the wire- length 16 marks Explain in detail about KL partitioning algorithm. Explain in detail about placement algorithms.