Scribd
Upload
645 views3 pages

Cad Question Paper PDF

This document contains questions for an examination on VLSI design CAD. It includes questions about algorithms for minimum spanning trees, shortest paths, partitioning graphs, and placement and routing in VLSI layout design. There are also questions about modeling circuits for simulation, logic synthesis using ROBDD, and algorithms used in high level synthesis. Students are asked to answer all questions, which cover topics like floorplanning, transistor modeling, placement methods, and hardware modeling in high level synthesis.

Uploaded by

rajasekarkpr
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
645 views3 pages

Cad Question Paper PDF

This document contains questions for an examination on VLSI design CAD. It includes questions about algorithms for minimum spanning trees, shortest paths, partitioning graphs, and placement and routing in VLSI layout design. There are also questions about modeling circuits for simulation, logic synthesis using ROBDD, and algorithms used in high level synthesis. Students are asked to answer all questions, which cover topics like floorplanning, transistor modeling, placement methods, and hardware modeling in high level synthesis.

Uploaded by

rajasekarkpr
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Reg. No.

Question Paper Code : 98079

M.E. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010 Second Semester VLSI Design

VL 9221 CAD FOR VLSI CIRCUITS (Common to M.E. Applied Electronics) (Regulation 2009) Time : Three hours

PART A (10 2 = 20 Marks) 1. 2. 3. 4. 5. Differentiate DFS and BFS search methods.

How the problems are classified based on the complexity? What are the different metrics used to estimate the wire length? How cells are placed in quadrature placement method? Draw the slicing tree for the given floor plan shown in Fig. 1

6. 7.

How routing is performed in standard cell layout? Draw ROBDD for f = ab( c + d ) . How the signal, gate and delays are modeled for gate level simulation?

31
8.

31
7 5 6 4 1 2 3 Fig. 1

Answer ALL questions

31 5
Maximum : 100 Marks

9.

Draw a DFG for the code given below :

temp = count + 1 else temp = count 1 end if. 10.

Mention any two scheduling algorithms used in high level synthesis. PART B (5 16 = 80 Marks)

11.

(a)

(i)

Using Prim's algorithm find minimum spanning tree for the graph shown in Fig. 2. (10)

(ii)

Find the shortest path between B and F in the graph shown in Fig. 3 using Dijkstra's algorithm.

5
(b) (i) (ii)

Discuss on the VLSI Design methodologies used for IC layout design. (12) Draw the Gajski Y-chart. (4)

31

31
Fig. 3 Or 2

5
Fig. 2

31 5
98079

If en = 1 then

12.

(a)

Fig. 4 Or (b)

What are the objectives of placement? Discuss any two algorithms used for placement of cells in IC layout. (i) (ii) Discuss the optimization issues related to floor planning. Explain Maze routing algorithm. (10) (6)

13.

(a)

(b)

(i) (ii)

What are shape functions? How it helps in floor plan sizing? Explain left edge algorithm with an example.

5
Or Or Or 3

14.

(a)

How transistor is modeled by Bryant and the simulation is performed at switch level?

(b) 15. (a)

Explain how ROBDD is used in logic synthesis. Describe the Allocation and Assignment in high level synthesis.

(b)

Explain the Hardware models and High level transformation in High level synthesis.

31

31

31 5
(6) (10)

Explain how Kernighan-Lin algorithm is used for partitioning and using the algorithm, find the minimum cut for the graph shown in Fig. 4

98079

You might also like