CS 161 Study Guide - Final Guide: Hash Table, Bipartite Graph, Sorting Algorithm

65 views8 pages

Document Summary

Instructions: please answer the following questions to the best of your ability. If you are asked to show your work, please include relevant calculations for deriving your answer, explaining steps as you go. If you are asked to prove a result, please write a complete proof at the level expected on your homework. When writing proofs, please strive for clarity and brevity (in that order). You have 180 minutes to complete the exam. The exam is closed-book, closed-lecture-notes, closed- internet, etc. You may use 1 sheet, front and back, of notes as reference. By signing your name below, you acknowledge that you have abided by the stanford honor code while taking this exam. Throughout this exam, unless explicitly stated otherwise, you may assume the following: graphs are represented by adjacency lists, hash functions provide simple uniform hashing. On all questions, you may use any of the algorithmic machinery that we"ve discussed in this course.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents