20/07/2018 Vlsi Physical Design - - Unit 4 - Week 3

reviewer1@nptel.iitm.ac.in ▼

Courses » Vlsi Physical Design Announcements Course Ask a Question Progress Mentor

Unit 4 - Week 3

Course
outline Week 3 Assignment
The due date for submitting this assignment has passed. Due on 2018-02-14, 23:59 IST.
How to access
the portal Submitted assignment

Week 1 1) For an 1024x1024 grid, the total memory requirement for Lee’s algorithm when using the 1 point
regular numbering scheme is approximately given by:
Week 2
3.14 Mbytes

Week 3 2.36 Mbytes

1.57 Mbytes
Lecture 15: Grid
1.25 Mbytes
Routing (Part 1)

Lecture 16: Grid

No, the answer is incorrect.
Routing (Part 2) Score: 0

Lecture 17: Grid

Accepted Answers:
Routing (Part 3) 1.57 Mbytes

Lecture 18: 2) For an 8Kx8K grid, the total memory requirement for Lee’s algorithm when using the 0, 0, 1, 1 point
Global Routing 1, 0, 0, 1, 1, … numbering scheme is given by:
(Part 1)
32 Mbytes
Lecture 19:
Global Routing 16 Mbytes
(Part 2) 8 Mbytes
Week 3: Lecture 4 Mbytes
Material
No, the answer is incorrect.
Quiz : Week 3 Score: 0
Assignment
Accepted Answers:
Lecture 15: 16 Mbytes
Note
3) Which of the following strategies can be used to reduce the time complexity of Lee’s 1 point
Lecture 16:
Note
algorithm?

Lecture 17: By starting from the terminal that is closer to a corner of the grid.
Note By starting from the terminal that is closer to the center of the grid.
Lecture 18: By numbering cells simultaneously from both the source and target ends.
Note
By using the 0, 0, 1, 1, … numbering scheme.
Lecture 19:
No, the answer is incorrect.
Note
Score: 0
Week 3
Accepted Answers:
Assignment
Solution By starting from the terminal that is closer to a corner of the grid.
By numbering cells simultaneously from both the source and target ends.
Week 4
4) Which of the following is not true for a rectangular Steiner tree connecting m terminal points? 1 point
Week 5
All the line segments in the tree are either horizontal or vertical.

https://onlinecourses.nptel.ac.in/noc18_cs06/unit?unit=30&assessment=167 1/4
20/07/2018 Vlsi Physical Design - - Unit 4 - Week 3

Week 6 Some of the line segment in the Steiner tree can have its end point(s) in a location that is not
one of the terminal point(s).
Week 7 Every line segment is used to join two terminal points.
The number of straight line segments will be m-1.
Week 8
No, the answer is incorrect.
Week 9 Score: 0
Accepted Answers:
Week 10 Every line segment is used to join two terminal points.
The number of straight line segments will be m-1.
Week 11
5) For Hightower line search algorithm, which of the following is true? 1 point
Week 12:
During an iteration, the lines generated from the source point are perpendicular to those
generated in the previous iteration.
DOWNLOAD
VIDEOS In the absence of obstacles, the algorithm determines the shortest path in a single iteration.
The algorithm determines the shortest path even in the presence of obstacles.
Supplementary All of the above.
Demo Tutorials
No, the answer is incorrect.
Score: 0
Accepted Answers:
During an iteration, the lines generated from the source point are perpendicular to those generated in the
previous iteration.
In the absence of obstacles, the algorithm determines the shortest path in a single iteration.

6) Suppose we are running Hadlock’s algorithm to find a path from a source point S to a target 1 point
point T within a 20x20 array of grid cells.
If the co-ordinates of S and T are (5,5) and (10,15) respectively, what will be the detour number of
a cell with co-ordinates (2,18)?
Assume that the lower left and upper right grid cells have co-ordinates (0,0) and (19,19)
respectively.

6
8
10
11

No, the answer is incorrect.

Score: 0
Accepted Answers:
6

7) Which of the following statements are true for channel junctions in the context of global 0 points
routing?

For an L-type junction, the horizontal channel must be routed before the vertical channel.
For an L-type junction, the vertical channel must be routed before the horizontal channel.
For a T-type junction, the vertical channel (leg) must be routed before the horizontal channel
(shoulder).
For a T-type junction, the horizontal channel (shoulder) must be routed before the vertical
channel (leg).

No, the answer is incorrect.

Score: 0
Accepted Answers:
For an L-type junction, the vertical channel must be routed before the horizontal channel.
For a T-type junction, the horizontal channel (shoulder) must be routed before the vertical channel (leg).

8) For the channel intersection graph data structure, which of the following statements is true? 1 point

The global routing problem can be mapped to the problem of finding a path between two
vertices in the graph.
Vertices in the graph represent channels while edges represent channel intersections.

https://onlinecourses.nptel.ac.in/noc18_cs06/unit?unit=30&assessment=167 2/4
20/07/2018 Vlsi Physical Design - - Unit 4 - Week 3

Vertices in the graph represent channel intersections while edges represent channels.
It is less suitable than the grid graph data structure for solving the global routing problem.

No, the answer is incorrect.

Score: 0
Accepted Answers:
The global routing problem can be mapped to the problem of finding a path between two vertices in the
graph.
Vertices in the graph represent channel intersections while edges represent channels.

9) For the integer linear problem based approach to global routing, which of the following 1 point
statements are false?

The layout is modeled as a channel intersection graph.

For every multi-terminal net, we try to select the best Steiner tree to route among several
alternatives.
Each edge in the graph is initially considered to be of infinite capacity, which gets defined as
part of the final solution.
None of the above

No, the answer is incorrect.

Score: 0
Accepted Answers:
The layout is modeled as a channel intersection graph.
Each edge in the graph is initially considered to be of infinite capacity, which gets defined as part of the fin
solution.

10)Which of the following statements is false? 1 point

Grid routing must follow global routing.

Global routing must precede detailed routing.
Grid routing is only used in later stages of routing.
None of the above.

No, the answer is incorrect.

Score: 0
Accepted Answers:
None of the above.

Previous Page End

© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

A project of In association with

Funded by

https://onlinecourses.nptel.ac.in/noc18_cs06/unit?unit=30&assessment=167 3/4
20/07/2018 Vlsi Physical Design - - Unit 4 - Week 3

Powered by

https://onlinecourses.nptel.ac.in/noc18_cs06/unit?unit=30&assessment=167 4/4