The readings in the calendar below refer to texts on the Resources page. The reading listed for each week covers the same material as that week's lecture. You should read the material beforehand so that you are prepared for reading quizzes and are ready to participate in class.
Any examples I do in class are available in my public directory. After doing cd cs35, use the following command to copy the current week's examples over: cp -r /home/meeden/public/cs35/wXX/ .
where wXX is replaced with the particular week, such as w01, w02, etc.| WEEK | DAY | ANNOUNCEMENTS | TOPIC & READING | LAB |
| 1 | Sep 04 | Introduction to C++, Data Structures, and Algorithms
| Lab 1: Gitting started in C++ | |
Sep 06 |
Sylabus Quiz (in lab) | |||
| 2 | Sep 11 | Arrays, Objects, and Memory
| Lab 2: PicFilter | |
Sep 13 | ||||
| 3 | Sep 18 | Sorting and Big-O Notation
| Lab 3: Basic Encryption | |
Sep 20 | ||||
| 4 | Sep 25 | Lab 4: Quicksort and Big-O | ||
Sep 27 |
Test 1 (Study guide) | Lists
| ||
| 5 | Oct 02 | Lab 5: Linked Lists | ||
Oct 04 | Stacks and Queues
| |||
| 6 | Oct 09 | Zach Palmer lecturing | Lab 6: Stacks and Queues | |
Oct 11 | Induction and Invariants
| |||
Oct 16 | Fall Break | |||
Oct 18 | ||||
| 7 | Oct 23 | Dictionaries and Binary Search Trees
| ||
Oct 25 | ||||
| 8 | Oct 30 | Balanced Binary Trees
| Lab 7: Binary Search Trees | |
Nov 01 |
Test 2 (Study guide) | |||
| 9 | Nov 06 | Priority Queues
| ||
Nov 08 | ||||
| 10 | Nov 13 | Hash Tables
| Lab 8: Efficient Keyword Search | |
Nov 15 | ||||
| 11 | Nov 20 | Graph Introduction
| ||
Nov 22 | Thanksgiving | |||
| 12 | Nov 27 | Graph Implementation
| Lab 9: Railway Game | |
Nov 29 |
Test 3 (Study guide) | |||
| 13 | Dec 04 | Graph Algorithms | ||
Dec 06 | Concept inventory | |||
| 14 | Dec 11 | Review | ||
Dec 19 | Final exam (2-5pm) | |||