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	Sep 02	Introduction to C++	Introduction to the course and C++ Chapter 1, pages 2-30	Lab 1: Git and C++
	Sep 04
2	Sep 09		Objects and Memory Chapter 1, pages 32-42 Chapter 2	Lab 2: More C++
	Sep 11
3	Sep 16		Big-O Notation and Sorting Chapter 4, pages 154-180 Chapter 11, pages 500-518	Lab 3: OOP
	Sep 18
4	Sep 23			Lab 4: Sorting and Big-O
	Sep 25	Test 1 (in lab)	Lists Chapter 3, pages 104-122
5	Sep 30			Lab 5: Linked Lists
	Oct 02		Stacks and Queues Chapter 5, pages 194-216
6	Oct 07			Lab 6: Stacks and Queues
	Oct 09		Induction and Invariants Chapter 4, pages 182-184
	Oct 14	Fall Break
	Oct 16
7	Oct 21		Dictionaries and Binary Search Trees Chapter 10, pages 424-432
	Oct 23
8	Oct 28		Balanced Binary Trees Chapter 10, pages 438-445	Lab 7: BSTs
	Oct 30	Test 2 (in lab)
9	Nov 04		Priority Queues Chapter 8, pages 322-348
	Nov 06
10	Nov 11		Hash Tables Chapter 9, pages 375-386	Lab 8: Hash tables and Priority queues
	Nov 13
11	Nov 18		Graph Introduction Chapter 13, pages 594-606
	Nov 20	Test 3 (in lab)
12	Nov 25		Graph Algorithms Chapter 13, pages 637-653	No lab
	Nov 27	Thanksgiving Break
13	Dec 02		More Graph Algorithms Chapter 13, pages 637-653	Lab 9: Graphs
	Dec 04
14	Dec 09		Review