1 / 4

Engaging Challenges in Computer Engineering Placement and Routing

Explore 10 intriguing problems in computer engineering placement and routing, from classic puzzles to torus configurations and grid paths. Discover variations and solutions for different scenarios to enhance your problem-solving skills.

blackcarl
Download Presentation

Engaging Challenges in Computer Engineering Placement and Routing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Placement and Routing A Lecture in CE Freshman Seminar Series: Ten Puzzling Problems in Computer Engineering Placement and Routing

  2. Houses and Utilities: Classic Version There are 3 houses on one side of a street and 3 utility companies on the other. Connect each utility facility to every house via lines of any desired shape such that the lines do not intersect. Challenge: Now try this puzzle with 2 houses & 4 utilities Placement and Routing

  3. K3,3 on a torus Challenge questions: Is the 3D cube graph planar? What about the 4D cube? Variations on the Puzzle Two houses and n utilities A different drawing of K3,3 Placement and Routing

  4. Rectilinear Paths on a Grid Solve the puzzle with 2 utilities and 4 houses using rectilinear grid paths. Why rectilinear paths: Trenches should not be too close to each other Straight-line trenches with right-angle turns are easier to dig; also easier to locate later Trenches must be dug along existing streets Challenge: Solve the puzzle above with paths that have the minimum possible total length. Now try to solve the puzzle with paths from one utility to all four houses having exactly the same length. Placement and Routing

More Related