CS421 - Advanced Data Structures and Algorithm Development Spring 1999 Final Exam Study Guide

EXAM - Tuesday: May 4th, 6 - 9 p.m.

Test Format
The final exam is open notes and open book. A third to half of the final is over new material form chapters 4 and 5. There will be traces, short answers similar to pauses in the book, short problems, give examples of, ...

Study Material

1. Chapter 1, 6 = see Study Guide 1
2. Chapter 2, 3 = see Study Guide 2
3. Chapters 1-4
   • Know the classification of problems (pg. 9)
   • Know classification of algorithms
   • Be able to analyze a code segment and tell me O(?)
   • Be able to solve a recurrence relation and use an induction proof to prove your guess is correct
   • Know definitions
   • Be able to Find-Max-Min
   • Know the order of growth rates (pg. 41, 45)
   • Know the order notation (pg. 43)
   • Order comparisons (pg. 72 #26)
4. Chapter 5 - Graphs
   • Know graph and tree definitions
   • Trace the topological sort algorithm
   • Depth-first and Breadth-first algorithms
   • Trace the cheapest spanning tree
   • Greedy method

:-) Good Luck!!!!! :-)

Back to Class List Page