Calendar (T/Th)
| Week | Class | Date | Topic | Reading | Assignment |
|---|---|---|---|---|---|
| 1 | 1 | 8/27 | Introduction / Intro to Java | Lab 0 | |
| 2 | 2 | 9/1 | Introduction to Java / OOP | Loops Conditionals Data types | |
| 3 | 9/3 | OOP | Java Programs Classes (read through “method signatures and overloading”) | Labs 1 and 2 (Due Sept 13) | |
| 3 | 4 | 9/8 | Inheritance / Arrays | Classes (read “inheritance” section to end) Arrays | |
| 5 | 9/10 | Arrays / Generics | Junit Iterators | ||
| 4 | 6 | 9/15 | Collections / ArrayList | ArrayLists | Lab 3 (Due Sept 20) |
| 7 | 9/17 | ArrayList / Debugging | Array Operations: Reading Searching Insertion Deletion | ||
| 5 | 8 | 9/22 | Exam 1 Review | ||
| 9 | 9/24 | Exam 1 | |||
| 6 | 10 | 9/29 | Linked Lists | Linked Lists Implementation Linked List Operations: Reading Searching Insertion Deletion | Lab 4 (Due Oct 4) |
| 11 | 10/1 | Linked Lists | Doubly Linked Lists | ||
| 7 | 12 | 10/6 | Stacks and Queues | Queues and Stacks - read whole chapter | Lab 5 (Due Oct 11) |
| 13 | 10/8 | Complexity | Big O - read whole chapter Big O in Everyday Code - read whole chaper | ||
| 8 | 14 | 10/13 | Sorting | Selection Sort Bubble Sort Insertion Sort | Complexity Assignment (No Lab) (Due Oct 18) |
| 15 | 10/15 | Recursion | Recursion - read whole chapter Merge Sort | ||
| 9 | 16 | 10/27 | Trees / BST | Trees Binary Search Trees Searching Insertion | Lab 6 (Due Nov 1) |
| 17 | 10/29 | BST | BST Deletion BST Example BST Traversal | ||
| 10 | 18 | 11/3 | Priority Queues | Priority Queues Heaps Heap Properties Heap Insertion Last Node | Lab 7 (due Nov 8) |
| 19 | 11/5 | Heap Sort / AVL Trees | Heap Deletion Heaps vs Arrays Last Node Arrays as Heaps Balanced and Unbalanced Trees | ||
| 11 | 20 | 11/10 | AVL Trees / Review | AVL Trees | |
| 21 | 11/12 | Exam 2 | |||
| 12 | 22 | 11/17 | Hashtables | Lists vs Maps vs Sets | Lab 8 (Due Nov 22) |
| 23 | 11/19 | Hash Functions / Graphs | Lookups Collisions Efficiency | ||
| 13 | 24 | 11/24 | Graphs | Graphs Directed Graphs Implementing Graphs | Lab 9 (Due Dec 6) |
| 14 | 25 | 12/1 | BFS / Djikstra’s | Graph Search Breadth-First Search Depth First Search Efficiency | |
| 26 | 12/3 | Bellman Ford / Topological Sorting? | Weighted Graphs Dijkstra’s Algorithm | ||
| 15 | 27 | 12/8 | Review / End Times | ||
| Section 01 Final | Wednesday | Dec. 16 | 2:00 – 4:00 p.m. | ||
| Section 02 Final | Wednesday | Dec. 16 | 9:00 – 11:00 a.m. |