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

lecture notes

 Introduction to the course and C++ Lab 1: Git and C++

Jan 23

lecture notes
2

Jan 28

lecture notes

 Objects and Memory

Jan 30

lecture notes

 Lab 2: More C++
3

Feb 04

lecture notes

 Big-O Notation and Sorting

Feb 06

lecture notes

Drop/add ends (Feb 07)

 Lab 3: OOP
4

Feb 11

lecture notes

Feb 13

Test 1 study guide

Test 1 in lab

lecture notes

 Lists Lab 4: Sorting and Big-O
5

Feb 18

lecture notes

Feb 20

   Classes and Labs canceled
6

Feb 25

lecture notes

 Lists continued

Feb 27

Zach Palmer's notes on
running GDB within VSCode

lecture notes

 Stacks and Queues Lab 5: Linked Lists
7

Mar 04

lecture notes

Mar 06

lecture notes

 Induction and Invariants Lab 6: Stacks and Queues
 

Mar 11

Spring Break

Mar 13
8

Mar 18

lecture notes

 Dictionaries and Binary Search Trees

Mar 20

Test 2 study guide

Test 2 in lab

lecture notes
9

Mar 25

lecture notes

 Balanced Binary Trees

Mar 27

lecture notes

CR/NC/W Deadline (Mar 28)

 Lab 7: BSTs
10

Apr 01

lecture notes

 Priority Queues

Apr 03

lecture notes
11

Apr 08

lecture notes

 Hash Tables

Apr 10

lecture notes

 Lab 8: Hash tables and Priority queues
12

Apr 15

lecture notes

 Graph Introduction and Implementation

Apr 17

Test 3 study guide

Test 3 in lab

lecture notes
13

Apr 22

lecture notes

 Graph Algorithms

Apr 24

lecture notes

 Lab 9: Graphs
14

Apr 29

Final Exam study guide

lecture notes

 More Graph Algorithms

May 01

  
 

May 08

Final Exam (7pm - 10pm, SCI CUNNIFF)