CS35: Schedule

Reading tips

The reading listed for each week provides an overview of the material that will be covered in that week's lectures.

• We recommend that you skim the material for each week before Tuesday's lecture so that you are ready to participate in class.
• Pay more attention to the conceptual ideas than the details of any C++ code that is provided.
• You rarely need to read an entire chapter, so pay attention to the page numbers provided.

WEEK	DAY	ANNOUNCEMENTS	TOPIC & READING	LAB
1	Jan 21		Introduction to the course and C++ Chapter 1, pages 2-30
	Jan 23
2	Jan 28		Objects and Memory Chapter 1, pages 32-42 Chapter 2
	Jan 30
3	Feb 04		Big-O Notation and Sorting Chapter 4, pages 154-180 Chapter 11, pages 500-518
	Feb 06	Drop/add ends (Feb 07)
4	Feb 11
	Feb 13	Test 1 in lab	Lists Chapter 3, pages 104-122
5	Feb 18
	Feb 20		Stacks and Queues Chapter 5, pages 194-216
6	Feb 25
	Feb 27		Induction and Invariants Chapter 4, pages 182-184
7	Mar 04		Dictionaries and Binary Search Trees Chapter 10, pages 424-432
	Mar 06
	Mar 11	Spring Break
	Mar 13
8	Mar 18	Test 2 in lab (Mar 19)	Balanced Binary Trees Chapter 10, pages 438-445
	Mar 20
9	Mar 25		Priority Queues Chapter 8, pages 322-348
	Mar 27	CR/NC/W Deadline (Mar 28)
10	Apr 01		Hash Tables Chapter 9, pages 375-386
	Apr 03
11	Apr 08		Graph Introduction and Implementation Chapter 13, pages 594-606
	Apr 10
12	Apr 15	Test 3 in lab (Apr 16)	Graph Algorithms Chapter 13, pages 607-636
	Apr 17
13	Apr 22		More Graph Algorithms Chapter 13, pages 637-653
	Apr 24
14	Apr 29		Fun topic TBD
	May 01		Review