1 / 9

Recitation 13

Recitation 13. Professor Peck April 18, 2014. Graph APTs. Complete the form: http://goo.gl/ vHUa4O the last character is an oh. Circuits.

xena
Download Presentation

Recitation 13

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. Recitation 13 Professor Peck April 18, 2014

  2. Graph APTs • Complete the form: http://goo.gl/vHUa4O • the last character is an oh

  3. Circuits • Discuss a solution to the Circuits APT in terms of a high-level description of using DFS to keep track of the weight of the path being followed in the DFS. Since the graph is acyclic you don't need a visited set.

  4. CircuitsQuestions 1-3 • Consider a modified DFS method as shown below:

  5. Galaxy TripQuestions 4-7

  6. Galaxy TripQuestions 8-10 • To find the size of a connected component(the number of machines that depend on each other starting from a specific machine), you can do a DFS or BFS.

  7. Galaxy TripQuestions 11-12 • This code finds all possible values that can be created by adding together elements of sizes. Make sure you understand how this code works by summing elements of sizes together.  

  8. Submit • Submit whatever you have finished BEFORE you leave today! • Please complete the following feedback form for your Recitation TAs • http://goo.gl/5HzEH0 (the last char is a zero) • Complete the form for EACH TA

  9. Happy Last Recitation! • Have a great weekend!

More Related