CS 9, Fall 2025
Course Information
Labs
| num | ready? | description | assigned | due |
|---|---|---|---|---|
| lab00 | true | Getting Started, Python Review | Thu 09/25 11:59PM | Sun 10/05 11:59PM |
| lab01 | true | Grocery Store | Sun 10/05 11:59PM | Sun 10/12 11:59PM |
| lab02 | true | Coffee Shop | Sun 10/12 11:59PM | Sun 10/19 11:59PM |
| lab03 | true | Recursion | Sun 10/19 11:59PM | Sun 10/26 11:59PM |
| lab04 | true | Maze Solver using Stacks | Sun 10/26 11:59PM | Sun 11/02 11:59PM |
| lab05 | true | Ordered Linked Lists | Sun 11/02 11:59PM | Sun 11/09 11:59PM |
| lab06 | true | Sorting Apartments | Sun 11/09 11:59PM | Sun 11/16 11:59PM |
| lab07 | true | Fresh Tea Shipping System | Sun 11/16 11:59PM | Sun 11/23 11:59PM |
| lab08 | true | BST Course Catalog | Sun 11/23 11:59PM | Fri 12/05 11:59PM |
Hwk
| num | ready? | description | assigned | due |
|---|---|---|---|---|
| h00 | true | Academic Integrity Contract, Python Review, Chapter 1.1 - 1.12 | Thu 09/25 11:59PM | Tue 10/07 11:00AM |
| h01 | true | Exceptions, Object Oriented Programming Chapter 1.11, 1.13 - 1.13.1, 1.14 - 1.15 | Sun 10/05 11:59PM | Tue 10/14 11:00AM |
| h02 | true | Inheritance, Intro to Algorithm Analysis Chapter 1.13, 3.1 - 3.3 | Sun 10/12 11:59PM | Tue 10/21 11:00AM |
| h03 | true | Algorithm Analysis cont., Recursion Chapter 3.4 - 3.7, 5.1 - 5.6 | Sun 10/19 11:59PM | Tue 10/28 11:00AM |
| h04 | true | Stacks, Queues, Deques, Linked Lists Chapter 4.1 - 4.7, 4.10 - 4.13, 4.15 - 4.21 | Sun 10/26 11:59PM | Tue 11/04 11:00AM |
| h05 | true | Ordered Linked Lists, Sequential / Binary Search, Bubble / Selection / Insertion sort Chapter 4.22 - 4.23, 6.1 - 6.4, 6.6 - 6.9 | Sun 11/02 11:59PM | Tue 11/11 11:00AM |
| h06 | true | Merge Sort, Quick Sort, Trees Chapter 6.11 - 6.12, 7.1 - 7.3 | Sun 11/09 11:59PM | Tue 11/18 11:00AM |
| h07 | true | Priority Queues / Heaps Chapter 7.8 - 7.10 | Sun 11/16 11:59PM | Tue 11/25 11:00AM |
| h08 | true | Binary Trees / Binary Search Trees Chapter 7.5, 7.7, 7.11 - 7.14 | Sun 11/23 11:59PM | Fri 12/05 11:59PM |
Lectures
| num | date | description |
|---|---|---|
| Lecture 1 | Thu 09/25 | Introduction, Python Review |
| Lecture 2 | Tue 09/30 | Python Review cont. |
| Lecture 3 | Thu 10/02 | Python Classes, Shallow vs. Deep Equality |
| Lecture 4 | Tue 10/07 | Python Errors, Exception Handling, Testing |
| Lecture 5 | Thu 10/09 | Pytest, Operator Overloading, Inheritance |
| Lecture 6 | Tue 10/14 | Inheritance cont., Runtime Analysis |
| Lecture 7 | Thu 10/16 | Recursion, Python Lists vs. Dictionaries |
| Lecture 8 | Tue 10/21 | Binary Search |
| Lecture 9 | Thu 10/23 | Stacks, Queues, Deques, Midterm Guide |
| Lecture 10 | Tue 10/28 | Linked Lists |
| Lecture 11 | Thu 10/30 | Midterm (Linked Lists cont., Quadratic Sorting Algorithms) |
| Lecture 12 | Tue 11/04 | Quadratic Sorting Algorithms cont. |
| Lecture 13 | Thu 11/06 | Mergesort |
| Lecture 14 | Thu 11/13 | Quicksort, Trees |
| Lecture 15 | Tue 11/18 | Priority Queues, Heaps |
| Lecture 16 | Thu 11/20 | Binary Trees, Tree Traversals |
| Lecture 17 | Tue 11/25 | Binary Search Trees |
| Lecture 18 | Tue 12/02 | Binary Search Trees cont. |
| Lecture 19 | Thu 12/04 | Wrap up / Review |