0% found this document useful (0 votes)
57 views2 pages

MEVLSI 2 Question

This document appears to be an exam for a Computer Aided Design for VLSI Circuits course at Anna University of Technology Madurai. The exam contains two parts - Part A with 5 short answer questions worth 2 marks each on topics like minimum design rules, NAND gate modeling, layout compaction, and floor estimation optimization problems. Part B contains 2 long answer questions worth 8 or 16 marks each, asking to explain topics such as partitioning, layout compaction rules, constraint graph compaction algorithms, placement problems, applications of compaction, and floor planning.

Uploaded by

mevlsiautmdu
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 DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
57 views2 pages

MEVLSI 2 Question

This document appears to be an exam for a Computer Aided Design for VLSI Circuits course at Anna University of Technology Madurai. The exam contains two parts - Part A with 5 short answer questions worth 2 marks each on topics like minimum design rules, NAND gate modeling, layout compaction, and floor estimation optimization problems. Part B contains 2 long answer questions worth 8 or 16 marks each, asking to explain topics such as partitioning, layout compaction rules, constraint graph compaction algorithms, placement problems, applications of compaction, and floor planning.

Uploaded by

mevlsiautmdu
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 DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

ANNA UNIVERSITY OF TECHNOLOGY MADURAI ME/VLSI ( Part Time)

Internal Test II COMPUTER AIDED DESIGN FOF VLSI CIR CUITS

Part A (5X2=10) 1.
2. 3.

Write the types of minimum design rules Draw a cell, port and data model of a NAND gate Define a Layout compaction Define Bellman Ford Algorithm Write the optimization Problem in floor Estimation Part B (40 Marks) Explain partitioning (8) Or Write the rules of Layout compaction (8)

4.
5.

6.

7.

8.

Explain the algorithm for constraint graph compaction (16) Or Explain Various placement problems in details (16)

9.

10.

Explain various application of compaction(16) Or

11.

Explain Floor Planning (16)

You might also like