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