COS 226 Midterm Information, Spring 2016
Time and location:
- The midterm is during lecture on Wednesday, March 9 from 11-12:20pm.
- The midterm rooms are
- Precepts P01, P02, P02A, P03, P03A, P04, P05: McCosh10 (traditional lecture room)
- Precepts P06, P07, P07A : MCCOH46 (new room)
- Flipped Lecture/P99: Jadwin A10 (flipped lecture room)
Failure to go to the right room can result in a serious deduction on the exam.
There will be no makeup exams except under extraordinary circumstances
(such as a medical emergency) and with the support of a Dean.
Rules:
-
In-class exams are governed by the Undergraduate Honor System.
- Closed book, closed note.
- You may bring one 8.5-by-11 sheet (one side) with notes in your own
handwriting to the exam.
- Computers, calculators, and electronic communication devices are forbidden.
Headphones attached to audio devices are also prohibited.
- Sit one one seat apart from other students and avoid sitting near
students with whom you've studied.
Midterm Office Hours
- Andy Guna Monday 12:30-2:30pm, 221 Nassau
- Miles Carlsten Monday 4-6 pm, Sherrerd 3rd Floor Common Area
- Marc Leef Tuesday 10-12 am, CS 001B
- Harry Kalodner Tuesday 3-5pm, CS 241
- Maia Ginsburg Tuesday 12:30-2:30, CS 205
- Shivam Agarwal Tuesday 5-7 pm, Sherrerd 3rd Floor Common Area
Midterm Review Session
We will have an optional midterm review session on Monday March 7th from 6-8 PM in Friend 101.
We will present a summary of the material, discuss problem-solving strategies,
and solve some problems.
We are also happy to answer specific questions that you may have.
You are welcome to come and go, as your schedule permits. An annotated version of the review session will be available
after the session. Please make a printout of the handout, if you'd like to take notes during the session.
download handout
annotated handout
Material covered:
- Algorithms, 4th edition, Sections 1.3–1.5, Chapter 2, and Chapter 3.
- Lectures 1–10.
- Programming assignments 1–4.
Algorithms and data structures emphasized in this course:
| quick-find |
quick-union |
weighted quick-union |
| resizing arrays |
linked lists |
stacks and queues |
| insertion sort |
selection sort |
Knuth shuffle |
|
| mergesort |
bottom-up mergesort |
Analysis of Algorithms |
| quicksort |
3-way quicksort |
| binary heaps |
heapsort |
| sequential search |
binary search |
| binary search trees |
2-3 trees |
left-leaning red-black BSTs |
| separate chaining |
linear probing |
A good way to practice for the midterm is to solve problems from
old exams.