Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
537 views1 page

VLSI Design Automation Exam 2009

This document contains questions from an exam on algorithms for VLSI design automation. It asks students to explain different types of verification methods, compare algorithms like the Liao-wong Algorithm and Bellman-Ford algorithm, and discuss topics related to VLSI design like floor planning, routing problems, switch level modeling, and high level synthesis techniques. The document provides the exam code, university name, course name, date and duration, and lists 8 questions with sub-questions that students were to answer for the exam.

Uploaded by

srinivas
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
537 views1 page

VLSI Design Automation Exam 2009

This document contains questions from an exam on algorithms for VLSI design automation. It asks students to explain different types of verification methods, compare algorithms like the Liao-wong Algorithm and Bellman-Ford algorithm, and discuss topics related to VLSI design like floor planning, routing problems, switch level modeling, and high level synthesis techniques. The document provides the exam code, university name, course name, date and duration, and lists 8 questions with sub-questions that students were to answer for the exam.

Uploaded by

srinivas
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/ 1

Code No: B0609

Jawaharlal Nehru Technological University Hyderabad


M. Tech II-Semester Regular Examinations September – 2009
ALGORITHMS FOR VLSI DESIGN AUTOMATION
(Common to DS & CE and VLSI System Design)
Time : 3 Hours Max. Marks: 60
Answer Any Five Questions
All Questions Carry Equal marks
----

1.a] What are the different types of verification methods? Explain about each of them.
b] Explain about algorithms graph theory and computational complexity.

2.a] Explain how many combinational optimization problems can be reached to


integer linear programming.
b] What is the purpose of statistical codling? Explain about the analogy with
physical model.

3.a] Compare the Liao-wong Algorithm and the Bellman – Ford algorithm.
b] Discuss about the uses.
i) Nencritical layout elements.
ii) Automotive jog Insertion.
iii) Constraint generation
iv) Hierarchy.

4.a] Explain about shape functions and floor plan sizing taking examples.
b] Sketch the wheel floor plan and explain about higher order floor plans?

5.a] What are the various types of local routing problems? Explain about each of
them?
b] What is meant by Horizontal constraint in routing? Explain and elaborate about
left edge algorithm.
6.a] Explain about switch level modeling and simulation.
b] Compare signal Modeling, gate modeling and delay modeling.

7.a] Explain about ROBDD Implementation and construction.


b] How allocation, assignment and scheduling are done in High level synthesis?
Explain.

8. Write notes on any TWO:


a) FPGA Technologies.
b) MCM physical design cycle.
c) Routing Techniques.

--ooOoo--

You might also like