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

Midterm Exam #2, Wednesday, May 20, 2009

Exam policies:

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

Topics covered:

• AVL trees - Single and double rotations, insert, find, (NOT delete).
• Binary Heaps - Findmin, Deletemin, Insert. Additional operations of increase, decrease, buildheap.
• D-heaps - Findmin, Deletemin, Insert. Additional operations of increase, decrease, buildheap.
• Leftist Heaps and Skew Heaps - Findmin, Deletemin, Insert. Additional operations of merge.
• Disjoint Union/Find - Dynamic equivalence relations, Up-tree representation, union, find, weighted union (union by size) and path compression.

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: (some of these contain questions on Heaps & AVL trees)

• Sample Midterm I (Solution to Sample Midterm I) (Extra steps written out for Sample Midterm I)
• Midterm I from 08sp (Solution to Midterm I from 08sp)
• Midterm I from 09wi (Solution to Midterm I from 09wi)
• Midterm I from 09sp (Solution to Midterm I from 09sp)

Midterm II samples:

• 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)

• NEW Midterm II from 09sp (Solution to Midterm II from 09sp)

Study suggestions:

• Do concrete problems from the book and re-work problems from lecture and HW.
• Practice all the operations on heaps & disjoint sets.
• Although the focus will be on material from lecture that was not covered on midterm #1, I will not expect that you have forgotten material from midterm #1 completely. For example, I could definitely ask you to compare something to a data structure covered on midterm #1.
• Be prepared to describe the running time of the operations on each data structure.
• This material corresponds to: Chapters: 6 (not 6.8) and 8.

---