This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: b. FindSet Operation c. Union Operation d. Path Compression Format of exam: You will have some short answer questions, some mathematical questions, some tracing questions and a problem solving question. You may have to write code/pseudocode for the problem solving question. This question will be related to, but different than the algorithms we've studied so far. You may bring two 8.5"x11" pieces of paper with notes as an aid to use during the test. How to study: 1) Look over the notes, paying attention to all the code shown in class. Make sure you understand how it all works. 2) Skim over the book, making sure you understand the general concepts discussed. 3) Look over your programming assignment, making sure you remember how you solved certain problems. 4) If you have time, sketch the outline for coding up classes that we discussed, but did not code....
View Full Document
This document was uploaded on 11/09/2009.
- Fall '09
- Computer Science