Calendar (M/W/F)
| Week | Class | Date | Topic | Reading | Assignment |
|---|---|---|---|---|---|
| 1 | 1 | Aug 26 | Introduction | Lab 0 | |
| 2 | Aug 28 | Introduction to Java | Loops Conditionals | ||
| 2 | 3 | Aug 31 | Introduction to Java | Data types | Labs 1 and 2 (Due Sept 13) |
| 4 | Sept 2 | Object-Oriented Programming | Java Programs | ||
| 5 | Sept 4 | Object-Oriented Programming | Classes (read through “method signatures and overloading”) | ||
| 3 | Sept 7 | No Class | |||
| 6 | Sept 9 | Inheritance | Classes (read “inheritance” section to end) | ||
| 7 | Sept 11 | Arrays and Generics | Arrays | ||
| 4 | 8 | Sept 14 | Collections and Iterators | Junit Iterators | Lab 3 (Due Sept 20) |
| 9 | Sept 16 | Array List | ArrayLists | ||
| 10 | Sept 18 | Array List | Array Operations: Reading Searching Insertion Deletion | ||
| 5 | Sept 21 | No Class | |||
| 11 | Sept 23 | Exam 1 Review | |||
| 12 | Sept 25 | Exam 1 | |||
| 6 | 13 | Sept 28 | Linked Lists | Linked Lists Implementation | Lab 4 (Due Oct 4) |
| 14 | Sept 30 | Linked Lists | Linked List Operations: Reading Searching Insertion Deletion | ||
| 15 | Oct 2 | Linked Lists | Doubly Linked Lists | ||
| 7 | 16 | Oct 5 | Queues and Stacks | Queues and Stacks - read whole chapter | Lab 5 (Due Oct 11) |
| 17 | Oct 7 | Queues and Stacks | |||
| 18 | Oct 9 | Complexity | Big O - read whole chapter | ||
| 8 | 19 | Oct 12 | Complexity | Big O in Everyday Code - read whole chaper | Complexity Assignment (No Lab) (Due Oct 18) |
| 20 | Oct 14 | Sorting (Selection, Insertion, Bubble) | Selection Sort Bubble Sort Insertion Sort | ||
| 21 | Oct 16 | Recursion, Merge Sort | Recursion - read whole chapter Merge Sort | ||
| Oct 19 | Fall Break | ||||
| Oct 21 | Fall Break | ||||
| Oct 23 | Fall Break | ||||
| 9 | 22 | Oct 26 | Trees | Trees | Lab 6 (Due Nov 1) |
| 23 | Oct 28 | Binary Search Trees | Binary Search Trees Searching Insertion | ||
| 24 | Oct 30 | Binary Search Trees | BST Deletion BST Example BST Traversal | ||
| 10 | 25 | Nov 2 | Exam Review | ||
| 26 | Nov 4 | Exam 2 | |||
| 27 | Nov 6 | Priority Queues (Heaps) | Priority Queues Heaps Heap Properties Heap Insertion Last Node | ||
| 11 | 28 | Nov 9 | Priority Queues (Heaps) | Heap Deletion Heaps vs Arrays Last Node Arrays as Heaps | Lab 7 (due Nov 15) |
| 29 | Nov 11 | Balanced Trees (AVL) | Balanced and Unbalanced Trees | ||
| 30 | Nov 13 | Balanced Trees (AVL) | AVL Trees | ||
| 12 | 31 | Nov 16 | Maps and Sets | Lists vs Maps vs Sets | Lab 8 (Due Nov 22) |
| 32 | Nov 18 | Hashtables | Hash Tables Hash Functions Using Hash Tables | ||
| 33 | Nov 20 | Hashtables | Lookups Collisions Efficiency | ||
| 13 | 34 | Nov 23 | Graphs | Graphs Directed Graphs | Lab 9 (Due Dec 6) |
| Nov 25 | Thanksgiving Break | ||||
| Nov 27 | Thanksgiving Break | ||||
| 14 | 35 | Nov 30 | Graphs | Implementing Graphs | |
| 36 | Dec2 | Graph Search Algorithms | Graph Search Breadth-First Search | ||
| 37 | Dec 4 | Graph Search Algorithms | Depth First Search Efficiency | ||
| 15 | 38 | Dec 7 | Graph Search Algorithms | Weighted Graphs Dijkstra’s Algorithm | |
| 39 | Dec 9 | Exam Review | |||
| Section 01 Final | Wednesday, Dec. 16 2:00–4:00 p.m. | ||||
| Section 02 Final | Wednesday, Dec. 16 9:00–11:00 a.m. |