CSCE 350: Data Structures and Algorithms Spring 2009
Review Sheet for Midterm Exam 2 03/06/09
This review sheet outlines the important topics from Chapters 4-6 of the textbook. It is
meant as an informal study guide instead of a binding agreement about the contents of the
midterm exam.
Facts about Midterm Exam 2:
- Midterm Exam 2 will be held on Friday, March 20 in class.
- There will be 7-8 questions in the exam. You will have 50 minutes to finish the test.
- Although it is a closed-book exam, you will be provided with appropriate and necessary
information, such as the Master Theorem and the definitions of the four types of rotations
for rebalancing an AVL tree.
- Mostly short answer questions. (Apply a given algorithm … , Design an algorithm … ,
Give a formula … , etc.)
Chapter 4
1. Algorithm and analysis for:
(a) Quicksort
(b) Binary search
(c) Divide and conquer on a binary tree. Binary tree traversals.
(d) Multiplication of large integers and Strassen’s matrix multiplication
Less crucial: Divide-and-conquer closest pair.
Not covered: Quickhull.
Chapter 5
1. Define and describe the decrease-and-conquer approach. How does it differ from
divide-and-conquer?
2. Three basic types: decrease by a constant, decrease by a constant factor, variable size
decrease. You should be able to classify decrease-and-conquer algorithms into these
subcategories.
3. Why is the algorithm derived from Equation 5.2 better than the algorithm derived from
Equation 5.3?
4. Algorithm and analysis for:
(a) Insertion sort
(b) Depth first search (DFS tree, tree edges, back edges)
(c) Breadth first search (BFS tree, tree edges, cross edges)
(d) DFS for topological sorting
(e) Source removal for topological sorting
(f) Fake coin problem: 2-pile and 3-pile algorithms
(g) Selection problem: find the kth order statistic (including the median)
(h) Searching and Insertion in a Binary Tree
Not covered: Section 5.4, Multiplication à la Russe (Russian peasant multiplication),
Josephus problem, Interpolation search, the Game of Nim.
