Scribd
Upload
27 views1 page

Noc20 cs18 Assigment 3

The document outlines a course on VLSI Physical Design, specifically focusing on maze routing algorithms like Lee's algorithm and Hadlock’s algorithm. It includes assignments and questions related to memory requirements, pathfinding, and channel intersection graphs. The course emphasizes understanding the complexities and methodologies involved in global routing problems.

Uploaded by

R INI BHANDARI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
27 views1 page

Noc20 cs18 Assigment 3

The document outlines a course on VLSI Physical Design, specifically focusing on maze routing algorithms like Lee's algorithm and Hadlock’s algorithm. It includes assignments and questions related to memory requirements, pathfinding, and channel intersection graphs. The course emphasizes understanding the complexities and methodologies involved in global routing problems.

Uploaded by

R INI BHANDARI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 1
NPTEL » VLSI Physica! Design ‘About the Course Unit 5 - Week 3 ‘Course outtine tac 18:6 Rostra Pan ") tect 18 cre Rtng Per 2 tac 7 cre Roary Pa 3 ent) tac 18: Gobs Roving en) ‘ui: Wook 3 Assignment 3 Wd 3 Fence Frm Wook 6 Text Tarezrte Week 3 Assignment 3 ‘eae dete for suming hs ssgnment hs essa Due on 2020-02-18, 23:59 IST, sper ourrecores you have not submtea ths esr 1) Consider a grid size of 2000 x 1000 for maze routing using Lee's algorithm with the regular cell 1 point ‘numbering scheme (1, 2,3, 4, etc): In the worst case, the tatal memory requirement will be: 3 «108 bytes: 2.75 x 108 bytes, 3.25 x 10° bytes None of these to, america Sear ‘Aecenteg Aree: 2 Consider a 2000 x 1000 grid for maze routing using Lee's algorithm with the improved cell pom ing scheme (2, 2,2, 1,2, 3, ete). In the worst care, the total memory requirement ist sumbs 3. 0.50 x 10° bytes b. 0.75 x 10° bytes 1.25 x 10° bytes None of these te, sneorinicome scopes owes: 5) Consider 2 2000 x 1000 grid for maze routing using Lee's algorithm with the cell numbering coe scheme (0,0,1, 1,0, 0,1, 1, ete) In the worst case, the total memary requirement will be: 3x10 bits 5x10 bits 7 x:10° bits None of these one newer incomet. ‘econ Arewors 4 In Lee's algorithm, what will happen if we start from the point that is closer to the corner of the 1 point rid? ‘More number of cells will get labeled on the average Less number of cells will get labeled on the average ‘There is no guarantee for finding the minimum length path. We shall always obtain the minimum length path. to, anameria inate Sear ‘Aecenteg Aree: 5) Which of the following is/are true forthe line search algarithms to determine the path between 1 point any pair of points on a two-dimensional grid with obstacles? 1a, The method guarantees to find the shortest path with minimum number of bends b. The method guarantees to find the shortest path but the number of bends may bbe quit large. ‘c Allthe trial lines that are generated each other. 1d. The tral ines generated during consecutive iterations are perpendicular to each other. 18 particular iteration are all parallel to one newer incomet ‘Aesop Anewor ©) Suppose we are running Hadlock’s algorithm to find @ path from 3 source point 5 to a target Doint T within 9 50x50 array of arid cells, If the co-ordinates of $ and T are (5,5) and (20,35), respectively, the detour number of a cell with co-ordinates (3,45) will be Assume that the lower left and upper right grid cells have co-ordinates (0,0) and (49,49) respectively. on reverse, Gio hae 2 pom 7 Which of the following statements isfare false for the channel intersection graph data 100m structure? 12. The global routing problem can be mapped to the problem of finding @ path between two vertices in the graph, b. Vertes in the graph represent channels while edges represent channel ‘6. Verticesin the graph represent channel intersections while edges represent channels. 4. Itis less suitable than the grid graph data structure for solving the global routing, problem. eset tras: © what are the basic objectives of global routing? + point 4. Itdefines the routing regions. Each net is assigned to tracks within the routing regions. 6. Each net is assigned a tentative route through the routing regions. d. Allofthece a ‘Accented Aree: 8) Which of the following is/are true about the channel intersection graph model? 1 point 12. Each vertex in the graph represents a channel b. Each vertex in the graph represents the intersection between two oF more channel & The edges in the graph represent channels. ‘4. The edges in the araph represent channel intersections. te, anor iicore. sere omnes: 9) For the integer linear problem based approach to global routing, which of the following Ty statements are flee? (i) The layout is modeled as a channel intersection graph. (il) For every mult-terminal net, we try to select the best Steiner tree to route ‘among several alternatives. (ii) Each edge in the graph is initially considered to be of infinite capacity, which {gets dafined as part ofthe final selutin. (iv) The apprasch eannot be used far large prablem instances, a Only b. Both (i) and (i ‘© Both (ij and (ii) 1d. None of the above ‘Aesop Anewor

You might also like