COMPSCI 170 Study Guide - Midterm Guide: Umesh Vazirani, Topological Sorting, Pseudocode
Document Summary
Write down the names of the students on your left and right as they appear on their sid. Note: for each question part, 20% of the points will be given to any blank answer, or to any clearly crossed- out answer. Note: if you nish in the last 15 minutes, please remain seated and not leave early, to not distract your fellow classmates. Instructions: you may consult one handwritten, single-sided sheet of notes. You may not consult other notes, textbooks, etc. Cell phones and other electronic devices are not permitted. On questions asking for an algorithm, make sure to respond in the format we request. Do not turn this page until an instructor tells you to do so. For the directed graph below, nd the strongly connected components and draw the dag of the strongly connected components. List a set of edges which, if added to the graph, would make the graph have exactly one sink.
