Fundamental Algorithms, Fall 2004

FINAL EXAM INFORMATION
===========================================================

GENERAL:

	THIS FILE WILL BE UPDATED AS NEEDED!

	Basically, we cover every topic discussed in class,
	assigned in homework or reading, up till the last lecture.

	Most of the questions (over 70%) be treat topics covered 
	AFTER the midterm.  As usual, we like to ask questions on
	topics explicitly discussed in lectures or homework problems.

	It is a closed book exam, but you are allowed to bring
	TWO 8"x11" sheet of notes (both sides), used in any way
	you like.  One sheet can be your MIDTERM sheet.
  
  	The last recitation on Wednesday (Dec 15) will be used for
	Final Review.  Please bring your questions!

	The study questions will be put in this directory today
	(Mon Dec 13): this tries to guide your studying for 
	the last 2 topics of this course -- hashing and NP-completness. 

	Solution to the study questions will be posted on Tue Dec 14.

===========================================================
STUDY GUIDE FOR LECTURE NOTES

Lecture 5: 
	Greedy Method
	READING GUIDE: Read Sections 1,2,3,5.  
		Topics: linear bin packing, Huffman code algorithm,
		dynamic Huffman code algorithm, Minimum spanning tree
		You may read Section 4 (on matroids) only lightly.
Lecture 6: 
	Amortization Method
	READING GUIDE: 
	Read Sections 1-4 and 9.  For Section 9, you just
		need to know the amortized complexity bounds
		when Fibonacci heaps are used to implement
		"mergeable queues" (Intro. to Section 5, p.18)
Lecture 7:
	Dynamic Programming
	READING GUIDE: 
	Study Sections 1, 2 and 4.
	We recommend reading Section 3 (more lightly).
Lecture 9:
	Hashing:
	READING GUIDE: 
	Read the first five sections, including universal hashing.  
Lecture 10:
	NP Completeness:
	READING GUIDE: 
	Read all. But you must understand the concept of
	reduction to do some simple problems.
	(Lemma 5 reducing HAM to SAT is a good example of this)