Midterm #1 Study Guide
CSE 373: Data Structures & Algorithms
Spring 2009

Midterm Exam #1, Friday, April 24, 2009

Exam policies:

• Closed book, closed notes. Calculators NOT allowed.
• The exam begins promptly at 11:30 and ends at 12:20.

Topics covered:

• Stacks and Queues, array and list implementations.
• Recursion. Designing algorithms recursively.
• Asymptotic analysis, Big-O. Worst case, upper bound, lower bound, analyzing loops, recurrences.
• Trees – definitions
• Dictionary ADT
• Binary search trees – Inorder, preorder, postorder traversals, insert, delete, find.
• Hashing. Properties of good hash functions. Selecting hash table size. Separate chaining and open addressing. Linear Probing, Quadratic Probing, & Double Hashing to resolve collisions. Rehashing.
• AVL trees - Single and double rotations, insert, find.

Sample midterms:

NOTES

· Topics covered on these exams may not be the exact same topics covered on our exam; please see the list of topics listed above for topics covered on our exam.

· These are provided to help you study and are not meant to be interpreted as a guarantee of the format of our actual midterm in terms of length or type of questions.

Midterm I samples:

• Sample Midterm I (Solution to Sample Midterm I) (Extra steps written out for Sample Midterm I) (Note, we will not have any questions on Splay Trees or Heaps on our midterm)
• Midterm I from 08sp (Solution to Midterm I from 08sp) (Note, we will not have any questions on Splay Trees, Heaps, or amortized analysis on our midterm)
• Midterm I from 09wi (Solution to Midterm I from 09wi) (Note, we will not have any questions on Heaps on our midterm)
• Midterm I from 09sp (Solution to Midterm I from 09sp)

Midterm II samples: (these contain questions on hash tables)

• Sample Midterm II (Key to Sample Midterm II)
• Midterm II from 08sp (Key to Midterm II from 08sp)
• Midterm II from 09wi (Key to Midterm II from 09wi)

Study suggestions:

• Do concrete problems from the book and re-work problems from lecture and HW. Suggestions of a few more problems from the book: Chapter 2: 2.6, 2.10. Chapter 3: 3.21, 3.22, 3.23 (a). Chapter 4: 4.1, 4.2, 4.8, 4.9, 4.19, 4.25.
• Practice all the operations in binary search trees, AVL trees, stacks and queues, and hashing with various collision resolution strategies.
• Practice analysis of algorithms.
• All material from lecture up through AVL trees Hash Tables is fair game. This material corresponds to: Chapters: 1, 2, 3, 4 (Not Including: section 4.5 on Splay trees, 4.7 on B-trees, or 4.8), and Sections 5.1-5.6.

---