{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Exam3ReviewSpr09

# Exam3ReviewSpr09 - b Calculating the number of days between...

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

COP 3502 Exam #3 Review Outline of Material Covered on the exam I. Sorting and Selecting a. Bubble Sort b. Insertion Sort c. Selection Sort d. Merge Sort e. Quick Sort f. Quick Select II. Other Data Structures a. Heaps i. Heap Property ii. Make Heap Function iii. Percolate Up (for insert) iv. Percolate Down (for removeMin) v. How to Store in an Array b. Hash Tables i. Idea of a Hash Function ii. Linear Probing iii. Quadratic Probing iv. Dynamic Table Expansion v. Separate Chaining Hashing III. Assignment #5 a. Appropriate data structures to solve the problem.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b. Calculating the number of days between two dates. c. How ties are broken for sorting. d. How to identify the student with the previous and next birthdays. Reading in the text: Chapters 11, 13 Exam Format: 25 multiple choice questions, just like exam #2. How to Study: 1) Look over the notes. 2) Look over the posted code (sort, mergesort, quicksort, heap, hashtable, htablelinear) 3) Review the text. 4) Plan solutions to some of the problems in the back....
View Full Document

{[ snackBarMessage ]}