CSCI 264: Midterm 1
The midterm will take place on Tuesday, October 3, in class.
The midterm will cover material from the first 4.5 weeks (until Tuesday of week 5). The specific topics are:
There will be roughly one problem from each of these topics. There will definitely be a problem on asymptotic notation
and another on recurrences. At least one problem will ask you to develop an algorithm and describe it (or a portion of it) in pseudo code.
- Asymptotic notation
- Recurrences and the Master Theorem
- Divide-and-conquer algorithms (sample problems: MergeSort, Counting inversions, Closest pair of points, Karatsuba-Ofman, Hw problems, Select)
- Linear and O(n log n) algorithmic ideas (sample problems: Point inside a polygon, Area of a Polygon, Convex hull via Graham Scan, Hw problems)
The midterm consists of 4 problems, each worth 10 points. I will drop the lowest-scored problem and the remaining three problems
contribute to the overall score.
The midterm is closed book, notes, laptops, cell-phones, etc. However, you may bring one letter-sized "cheat-sheet"
in your own handwriting (no printouts or photocopies).
Here is a sample midterm for you to practice on.
I recommend to solve the practice midterm first and only after you are done, check the
Note: I added solutions for Problems 3 and 4. My software was acting up, occasionally erasing parts I wrote earlier - so if you find something amiss, please let me know!
Disclaimer: The practice midterm does not indicate the difficulty of the actual midterm.