CS 24 Plan for Today:

Course evaluations

Heaps and priority queues (Sec. 11.1-2) [cs24Heaps.ppsx]
	Know about STL pqueue/heap algs [deitelfig21_37.cpp]

About rest of Chapter 11:
	Not covering B-Tree project (Sec. 11.3)
	Read “Trees, Logs, and Time Analysis” (Sec. 11.4)
	Know about STL Map and Multimap classes (Sec. 11.5)

Searching intro (Chapter 12 briefly):
	Serial search; Binary searching [search.cxx]
	Library functions: find [testfind.cxx], count,
		binary_search, search (to find sequence)
	Hashing ideas and concepts [table1, table2]

About Exam 3 - Wednesday, 12:30-1:30
	Mostly chapters 9-11 (exc. 11.3), ideas from 12

Notice: attendance at lab Tuesday is required for credit