Meets: Tuesdays & Thursdays 12 - 1:15 and 1:30 - 2:45PM; Fulton Hall 250.
Instructor: Robert Muller
Office: St. Mary's South 277; Office Hours Tuesdays 3PM - 5PM, Wednesdays 10AM - 12PM.
Teaching Assistants:
- Brendan Gregory (gregorbc): Office Hours Saturdays 12PM - 3PM, Fulton Hall 160;
- William (Billy) Hufnagle (hufnaglw): Office Hours Saturdays 3PM - 6PM, Fulton Hall 160;
- Darius Russell Kish (russeldk): Office Hours Mondays & Wednesdays 7PM - 8PM, Fulton Hall 160;
- Yuning (Tommy) Yang (yangaeb): Office Hours Thursdays 5PM - 6PM, Fulton Hall 160.
About — Textbooks — Grading — Canvas — Piazza — Java SE8 — algs4 — algs4 GitHub
| Week | Mtng | Topic | |
|---|---|---|---|
| 1 | 1 | T 08/28/18 | Overview, Administration, Java Setup and Introduction. |
| 2 | R 08/30/18 | Introduction to Java; libraries, compilation & execution | |
| 2 | 3 | T 09/04/18 | ADTs — specifications & implementations |
| 4 | R 09/06/18 | Understanding static and this in Java |
|
| 3 | 5 | T 09/11/18 | The Java class Hierarchy; The StringStack ADT; postfix Expression Evaluation |
| 6 | R 09/13/18 | Parametric Polymorphism/Generics and code Reuse; Sequential VS Linked Representations of the Generic Stack ADT. | |
| 4 | 7 | T 09/18/18 | Linked & Sequential Representations of the Generic Stack ADT |
| 8 | R 09/20/18 | The Queue ADT: A linked implementation | |
| 5 | 9 | T 09/25/18 | The Queue ADT: A circular sequential implementation; the Deque ADT |
| 10 | R 09/27/18 | Order-sensitive data structures — the Priority Queue ADT; Sets & Trees | |
| 6 | 11 | T 10/02/18 | Binary Heap implementation of PQ ADT; Heapsort |
| 12 | R 10/04/18 | First Exam | |
| 7 | T 10/09/18 | No Meeting | |
| 13 | R 10/11/18 | Relations; Orders and Comparability; Orders, Equality; Maps | |
| 8 | 14 | T 10/16/18 | Analysis of Work; Big-O notation |
| 15 | R 10/18/18 | The Huffman Coding Algorithm | |
| 9 | 16 | T 10/23/18 | Binary & Hex; Working with Bits in high-level languages |
| 17 | R 10/25/18 | Binary Search Trees | |
| 10 | 18 | T 10/30/18 | Balanced Binary Search Trees; 2-3 Trees & Red/Black Trees |
| 19 | R 11/01/18 | More on Red/Black Trees | |
| 11 | 20 | T 11/06/18 | Hashing and Hash Tables |
| 21 | R 11/08/18 | Double Hashing | |
| 12 | 22 | T 11/13/18 | Game Trees: Minimaxing |
| 23 | R 11/15/18 | Immutable Data Structures; Immutable Lists | |
| 13 | 24 | T 11/20/18 | Second Exam |
| R 11/22/18 | Thanksgiving | ||
| 14 | 25 | T 11/27/18 | Mergesort; Deep vs Shallow Copying |
| 26 | R 11/29/18 | Graphs & their representations | |
| 15 | 27 | T 12/04/18 | Dijkstra's Shortest Path Algorithm |
| 28 | R 12/06/18 | Last Meeting Review and wrap-up |