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