Midterm 1 Study Guide, CSE373 Fall 2013

Exam Policies

Topics Covered

The midterm covers all the course material up through and including using heaps to implement priority queues. In addition to topics covered on the first two homeworks, topics include dictionaries, AVL trees, priority queues, and heaps. All material covered on the exam will have been discussed in class and included in the posted lecture materials though you may be asked to apply ideas in slightly new ways.

The exam will not test the AVL-tree delete operation or the proof that an AVL tree has logarithmic height.

Exam Format and Sample Midterms

Our exam will consist of various types of short-answer questions. You may be asked to write or read Java code or pseudocode. Below are several sample exams from prior offerings of CSE373 but please understand these caveats:

Sample exams:

Additional Study Suggestions

Valid CSS! Valid XHTML 1.1