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

Midterm Exam #1, Friday, January 30, 2009

Exam policies:

• Closed book, closed notes. Calculators NOT allowed.
• The exam begins promptly at 2:30 and ends at 3: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.
• AVL trees - Single and double rotations, insert, find.
• Binary Heaps - Findmin, Deletemin, Insert. Additional operations of increase, decrease, buildheap.

Sample midterms:

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.

• 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 on our midterm)
• Midterm I from 08sp (Solution to Midterm I from 08sp) (Note, we will not have any questions on Splay Trees or amortized analysis on our midterm – and we will have questions on Binary Min Heaps)
• Solution to Midterm I from 09wi

Study suggestions:

• Do concrete problems from the book and re-work problems from lecture and HW. Suggestions of 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. Chapter 6: 6.2, 6.3.
• Practice all the operations in binary heaps, binary search trees, AVL trees, stacks and queues.
• Practice analysis of algorithms.
• All material from lecture up through binary min heaps 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 6 (Not including: sections 6.5-6.9).

---