Scribd
Upload
6 views

Assignment - 1 - Solutions

The document contains solutions to 10 questions about topics in VLSI design including logic synthesis, design styles, design rule checking, complexity classes, graphs, and shortest path algorithms. Logic synthesis, NP-completeness, interval graphs, minimum spanning trees, BFS vs DFS, and Dijkstra's algorithm are discussed across the questions.

Uploaded by

mayank kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Assignment - 1 - Solutions

The document contains solutions to 10 questions about topics in VLSI design including logic synthesis, design styles, design rule checking, complexity classes, graphs, and shortest path algorithms. Logic synthesis, NP-completeness, interval graphs, minimum spanning trees, BFS vs DFS, and Dijkstra's algorithm are discussed across the questions.

Uploaded by

mayank kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Assignment – 1 Solutions

1. Logic synthesis converts


a. Gate level netlist to Layout
b. RTL to Layout
c. RTL to Gate level netlist
d. RTL to layout

Answer: (c) Logic synthesis converts RTL to gate level netlist.

2. Which of the following statement(s) is/are true regarding VLSI design styles?
a. Full custom design style is more flexible than any other design style
b. In the standard cell-based design style, all the cells in the library must have the same
area
c. LUTs are used to implement logic functions in FPGAs
d. Gate array-based designs are more difficult to implement than full custom and
standard cell-based designs

Answer: (a, c)

3. Design Rule Check(DRC) is performed on the layout to ensure


a. that transistors in a layout are connected in the same way as in the circuit schematic
b. that layout data complies with fabrication rules
c. the correctness of power and ground connections
d. that there are no antenna violations in the design

Answer: (b) DRC is performed on the layout to ensure that layout data complies with fabrication
rules.

4. Chose the correct option(s)


a. All NP-hard problems are NP
b. All NP-complete problems are NP-hard
c. All NP-complete problems are NP
d. All NP problems are NP-hard

Answer: (b, c)

The answers for this can be deduced from the Venn diagram
5. What is the asymptotic relationship between f(n) and g(n) in the following graph?

a. f(n) = O(g(n))
b. f(n) = Ω(g(n))
c. f(n) = Θ(g(n))
d. None of the above

Answer: (a) f(n) = O(g(n)) because 0 ≤ f(n) ≤ c(g(n)) after some positive constant n0.

6. The adjacency matrix representation of the graph given below is

a.
b.

c.

d.
Answer: There is no correct answer in the given options.

The correct answer is

7. Consider the following arrangement of lines.

Interval graph of the given arrangement of lines

a.
b.

c.

d.
Answer: (d)

First create overlap graph(Eo) and then create containment graph(Ec). Combine both of them
since Ei = Eo U Ec. Overlap graph and containment graphs are easy to create and the definitions
are in the lecture ppt 4.

8. Find the minimum spanning tree for the graph given below

a.

b.

c.
d.
Answer: (a)

The edges with cost 4, 5 are ignored because they create cycles.

The edges with cost 8, 10 are also ignored as they also form cycles.

The MST is
9. Select the options that are not true.
a. BFS uses stack in its implementation
b. DFS uses stack in its implementation
c. Dijkstra’s shortest path algorithm can handle negative edge weights
d. All the above

Answer: (a, c)

BFS uses stack in its implementation

Dijkstra’s shortest path algorithm cannot handle negative edge weights.

10. Find the shortest distance from s to v in the following graph using Dijkstra’s algorithm

a. 17
b. 16
c. 12
d. 8

Answer: (b)

You might also like