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.

• You should 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 17	Introduction	Introduction to the course and C++ Chapter 1, pages 2-30	Lab 1: Git and C++
	Jan 19	Types, pointers, arrays, stack diagrams
2	Jan 24	Classes and objects in C++	Objects and Memory Chapter 1, pages 32-42 Chapter 2	Lab 2: PicFilter
	Jan 26	Encapsulation, Inheritance, Polymorphism
3	Jan 31	Destructors and Big O	Big-O Notation and Sorting Chapter 4, pages 154-180 Chapter 11, pages 500-518	Lab 3: Shapes
	Feb 02	Big O proofs and Merge Sort
4	Feb 07	Merge Sort analysis, Quick Sort		Lab 4: Quicksort and Big-O
	Feb 09	Test 1 in lab Test 1 Study Guide Review Quick Sort, C++ templates, List ADT	Lists Chapter 3, pages 104-122
5	Feb 14	ArrayList, LinkedList		Lab 5: Linked Lists
	Feb 16	Wrap up Lists, Intro Stacks and Queues	Stacks and Queues Chapter 5, pages 194-216
6	Feb 21	Implementing Stacks & Queues, and applying to search		Lab 6: Stacks and Queues
	Feb 23		Induction and Invariants Chapter 4, pages 182-184
7	Feb 28	Wrap up Stacks & Queues, Induction proofs	Dictionaries and Binary Search Trees Chapter 10, pages 424-432
	Mar 02	Dictionary ADT, Binary Search Trees
	Mar 07	Spring Break
	Mar 09
8	Mar 14	Implementing BST methods get, insert, remove	Balanced Binary Trees Chapter 10, pages 438-445	Lab 7: BSTs
	Mar 16	Test 2 in lab Test 2 Study Guide BST traversals, Balanced BSTs: AVL trees
9	Mar 21	Priority Queue ADT, Complete Trees, Heaps	Priority Queues Chapter 8, pages 322-348
	Mar 23	Heap implementation, Heapify, Heap Sort
10	Mar 28	Another Dictionary implementation: Hash Tables	Hash Tables Chapter 9, pages 375-386	Lab 8: Hash tables and Priority queues
	Mar 30	Linear Dictionary, implementing Hash Tables
11	Apr 04	Review Hash tables and Dictionaries, Introduce Graphs	Graph Introduction and Implementation Chapter 13, pages 594-606
	Apr 06	Implementing the Graph ADT
12	Apr 11	Graph algorithms: reachableDFS and shortestLengthPathBFS	Graph Algorithms Chapter 13, pages 607-636	Lab 9: Graphs
	Apr 13	Test 3 in lab Test 3 Study Guide Graph algorithms: Single Source Shortest Path
13	Apr 18	Graph algorithms: Topolgical Sort	More Graph Algorithms Chapter 13, pages 637-653
	Apr 20	Graph algorithms: Minimum Spanning Trees
14	Apr 25	Final Study Guide Growing Neural Gas Final review	Fun topic
	Apr 27	More review	Review
	May 08	Final exam 9am in SCI 199 ADTs summary