COS 226 Midterm Information, Spring 2013

COS 226 Midterm Information, Spring 2013

Office Hours leading up to exam (3/8-3/10):

TIME	ROOM	PERSON
Fri 12:30-2:30pm	EQuad C320	Nico Pegard
Fri 2:30-4:30pm	Sherrerd 308	Arvind Narayanan
Fri 5:00-7:00pm	CS 001A	Jennifer Guo
Fri 7:00-9:00pm	CS 003	Dushyant Arora
Sun 5:00-7:00pm	Robertson 100	Maia Ginsburg
Sun 5-7pm	Robertson 100	Diego Perez Botero
Sun 7-9pm	CS 004	Ruth Dannenfelser

Location:

80 minutes, during lecture on Monday, March 11 from 11-12:20pm.
Exam will be held in the following rooms:

McCosh 62 and 66 - P02 and P07
East Pyne 10 - P01 and P03
McCosh 10 - P04 P05 P05A P06 P06A P08

Failure to go to the right room can result in a deduction on the exam.

Rules:

Closed book, closed note.
You may bring one 8.5-by-11 sheet (one side) with notes in your own handwriting to the exam.
No electronic devices (e.g., calculators, laptops, and cell phones).

Material covered:

Algorithms, 4th edition, Sections 1.3–1.5, Chapter 2, and Chapter 3.
Lectures 1–11.
Programming assignments 1–5.

Q&A Session

Sunday, March 10, 3-5 PM in Robertson 100

The precept before the exam will be devoted to Q+A and review.

List of algorithms and data structures:

quick-find	weighted quick-union	path compression	stacks	queues
binary search	Knuth shuffle	insertion sort	selection sort	Graham scan
mergesort	bottom-up mergesort	quicksort	3-way quicksort	heapsort
binary heaps	sequential search	BSTs	2-3 trees	left-leaning red-black BSTs
separate chaining	linear probing	shellsort

A good way to practice for the midterm is to solve problems from old exams.