This document contains questions for an exam on VLSI design and physical design cycles. It asks about important VLSI entities, drawing a Y-chart, explaining the traveling salesman problem and finding the shortest path between nodes. It also contains questions about routing algorithms for staggered models, breadth first search, programmable MCMs, partitioning and routing for FPGAs, Prim's algorithm on a graph, logic blocks in FPGAs, and the physical design cycle for FPGAs. Students must answer 5 questions out of 10, with one question worth 10 marks and three others worth 7 marks each.

1. Answer all the questions 5x2=10M sub: AVLSI
1. What are the important entities for VLSI Design?
2 Draw the Y- chart.
3. Explain the travelling sales man problem (TSP).
4. Find the shortest path between nodes A and D.
.
5 What are the various steps in MCM physical design cycle?
Answer any three questions 3x7=21M
1 Discuss the routing Algorithm for staggered model and compare it with Segmentation model.
2. Write notes on any TWO
a) Breadth first search b) Programmable MCMs. c) Partitioning and Routing for FPGAs.
3. Find the Spanning tree for the graph shown in figure using Prim’s algorithm. Explain the
procedure.
4 Explain about various types of logic blocks with respect to FPGA architectures.
5 Explain about the Physical Design Cycle for FPGAs.