Midterm #1 Study Guide
CSE 373: Data Structures & Algorithms
Midterm Exam #1, Monday, January 30, 2012
- Closed book, closed
notes. Calculators NOT allowed.
- The exam begins
promptly at 2:30 and ends at 3:20.
- 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. (No delete)
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: (Note we will not
have any questions on binary min heaps on our midterm.)
- Do concrete problems
from the book and re-work problems from lecture and HW. Suggestions of a few more problems from
the book (2nd and 3rd editions): 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,
- Practice all the
operations on stacks and queues, binary search trees, and AVL trees.
- Practice analysis of
- All material from
lecture up through and including AVL trees 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).