CS 300 Schedule
Date
|
Topic
|
Notes
|
Assignments
|
Aug 26 | Syllabus | Linux Intro | Must bring your VM to class! | 01_UNIX |
VM Setup Assignment 0 - Linux Practice |
Aug 28 | Intro to C | Eclipse | 02BasicC ExamScores.c |
|
Aug 30 | C | Eclipse | 03Eclipse |
Assignment 0 DUE |
Sep 02 | Labor Day | ||
Sep 04 | Stack ADT | MeetShareReconnect Read 4.13 before class and do Activities 07Stack |
Assignment 1 - Character Static Stack (Import Eclipse Project) |
Sep 06 | Makefiles, test drivers using asserts | 04Makefiles C Strings |
|
Sep 09 | Linked List API | Read: 4.1-4.5, 4.14 Do: 4.2, 4.3, 4.14 10ListADT |
|
Sep 11 | Pointers / Dynamic Memory CODING STANDARDS Eclipse Preferences File (XML) |
Read: 21.1-21.6, 21.9-21.12 malloc/free Pacific Appropriate Use Policy for Information Technology 09DynamicMemory |
|
Sep 13 | Git | Git Prep Git & Eclipse |
|
Sep 16 | Pointers / Dynamic Memory / void * | Assignment 1 DUE Assignment 2 - Generic Linked List Pointers list.h schedule Create Eclipse Project |
|
Sep 18 | void*, Linked List walking | Exam Review ODT |
|
Sep 20 | Exam | |
|
Sep 23 | Valgrind Lab (ValgrindLinkedListLab: Arrays and Linked List) | Setup
Lab Read for Wednesday 4.6-4.9 4.15-4.16 Do: 4.15-4.16 |
Submit
From Eclipse |
Sep 25 | Queue Doubly Linked Queue, Circular Stack |
11QueueADT |
Assignment 2 - Part A DUE |
Sep 27 | Priority Queue | Queue
Backed By Array |
|
Sep 30 | Project Management | Multi Project Makefiles | ||
Oct 02 | Resume / Internships | Assignment 2 Part B DUE Assignment 3 - PQ |
|
Oct 04 | Fall Break | ||
Oct 07 | Handles | Operator
Precedence |
|
Oct 09 | More Handles | PQDriver &
Class hints |
|
Oct 11 | Extra Handles, with a List! | Extra |
|
Oct 14 | Design | Help I
built the wrong kind of project! |
|
Oct 16 | Argv /Argc / Files / Airport | ZyBook: File IO: 22.5 Argv/Argc: 25.3 Files and Argv/Argc: 25.9 |
Assignment 3 Due Assignment 4 -Airport |
Oct 18 | Exam | Exam Review PDF ODT |
|
Oct 21 | Complexity | PDF printf output formatting: 22.3 malloc/free |
|
Oct 23 | Complexity | |
|
Oct 25 | BST(search) | TreesIntro | |
Oct 28 | BST (insert) | ||
Oct 30 | BST (recursion) | ||
Nov 01 | BST (delete) Assignment |
Assignment 4 DUE Assignment 5 BST |
|
Nov 04 | Function Pointers | 14Generics |
|
Nov 06 | Hash Tables | HashTables chapter 5 |
|
Nov 08 | Hash Tables | HashTablesReview |
|
Nov 11 | String Processing Assignment |
Strings Binary |
Assignment 5 DUE Assignment 6 Hashtable |
Nov 13 | Hash Tables Function Pointers Void* and array |
||
Nov 15 | Exam | EXAM REVIEW |
|
Nov 18 | HashTable Review B-Trees |
B Trees |
|
Nov 20 | B-Tree Node, B-Tree Find | ||
Nov 22 | B-Tree Insert | ||
Nov 25 | B-Tree Insert Void* arrays (14 Generics) + pointer arithmetic |
TUTORING Monday Nov 25 6-8pm Scott 204 No tutoring Sunday Nov 24! |
Assignment 6 DUE [TUESDAY] |
Nov 27 | Thanksgiving break | ||
Nov 29 | Thanksgiving break | ||
Dec 02 | Last Day / Review |
Exam Review Editable Exam Review PDF |
|
Dec 04 | READING DAY | ||
Dec10 | TUESDAY Final Exam - 3:00 to 5:30 pm |