Exam1ReviewSum07 - b FindSet Operation c Union Operation d...

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

View Full Document Right Arrow Icon
CS 2 Exam #1 Review Date: 6/6/07 (Wednesday) Place: HEC-104 Time: 10 – 11:50am Outline of material covered so far: I. Algorithm Analysis Preliminaries (1.1 – 1.3, 2.1 – 2.4) a. Running Time b. Mathematical Review ii. Summations c. Justification Techniques i. By example ii. By contradiction d. Big-Oh notation i. O ii. iii. θ e. Tracing Code Samples and determining run-time f. Experimental Analysis g. Example Algorithms i. Sorted List Matching Problem ii. Maximum Contiguous Subsequence Sum Problem II. AVL Trees (4.4) a. AVL Tree Property b. Insert c. Delete III. 2-4 Trees (4.7, Notes) a. 2-4 Tree Node Property, Leaf Node property b. Insert c. Delete
Background image of page 1

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

View Full DocumentRight Arrow Icon
IV. Heaps (6.3 – 6.4) a. Percolate Up b. Percolate Down c. Insertion d. Make Heap e. Priority Queue f. Heap Sort V. Hash Tables (5.1 – 5.7) a. Hash function b. Linear probing c. Quadratic probing d. Linear chained hashing e. Dynamic Table Expansion VI. Disjoint Sets (8.1 – 8.5) a. Array representation
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the 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.

Page1 / 3

Exam1ReviewSum07 - b FindSet Operation c Union Operation d...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online