{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

sample_final

sample_final - CS161 Final Exam Computer Science Department...

This preview shows pages 1–3. Sign up to view the full content.

CS161 - Final Exam Computer Science Department, Stanford University August 16, 2008 Name: Honor Code 1. The Honor Code is an undertaking of the students, individually and collectively: a) that they will not give or receive aid in examinations; that they will not give or receive unpermitted aid in class work, in the preparation of reports, or in any other work that is to be used by the instructor as the basis of grading and b) that they will do their share and take an active part in seeing to it that others as well as themselves uphold the spirit and letter of the Honor Code. 2. The faculty on its part manifests its confidence in the honor of its students by refraining from proctoring examinations and from taking unusual and unreasonable precautions to prevent the forms of dishon- esty mentioned above. The faculty will also avoid, as far as practica- ble, academic procedures that create temptations to violate the Honor Code. 3. While the faculty alone has the right and obligation to set academic requirements, the students and faculty will work together to establish optimal conditions for honorable academic work. Signature: 1 2 3 4 5 6 7 8 Total: 20 40 15 15 15 20 20 12 157 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1. True/False (20 points) - State whether the statements below are true or false and give a brief justification for your answer. 1 point for T/F and 1 point for justification. The recurrence T ( n ) = T ( n - 1) + n log n is O ( n 2 log n ) Running BFS and DFS on a tree of depth 1 produces the same traversal order For any positive weighted graph, the Bellman-Ford algorithm gives the shortest path from a vertex v
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}