Class activities
Information about lectures, labs, assignments, and reading.
| Week 1 : Jan 15 | |
| Lectures | L1: Introduction and Course Info |
| L2: Stacks; LLStack.jar a linked list based implementation | |
| Assignments | P1 Run Time Stacks |
| Reading | Prichard Ch. 7 |
| Recitations | No recits this week |
| Week 2 : Jan 22 | |
| Lectures | L3: Queues |
| Recitations | R1: Stacks and Recursion |
| Assignments | P2 Converting infix to postfix expressions and evaluating these |
| Reading | Prichard Ch. 7 and 8 |
| Week 3 : Jan 29 | |
| Lectures | L4: Grammar basics; L5: Recursion and Induction |
| Recitations | R2: Implementing a Queue using a Linked List |
| Assignments | P1 due |
| Reading | Prichard Ch. 6.1 & 6.3 |
| Week 4 : Feb 5 | |
| Lectures | L6: Computational Complexity; Big-O analysis |
| Recitations | R3: scanning and grammars |
| Reading | Prichard Ch. 6 and 10.1 |
| Rosen Ch. 3.2-3.3 | |
| Week 5 : Feb 12 | |
| Lectures | L7: trees; InfixSum.jar an Infix sum example |
| Parsing infix expressions; building expression trees | |
| Recitations | R4: induction |
| Assignments | HW1: Grammars and expressions (due Tuesday Feb 14 in class; late Thursday) |
| Reading | Prichard Ch. 6 and 10.1 |
| Rosen Ch. 3.2-3.3 | |
| Week 6 : Feb 19 | |
| Lectures | finishing L7: trees |
| Recitations | R5: Orders of Magnitude and Complexity |
| Assignments | P2 due |
| Reading | Prichard Ch. 11; Rosen Ch. 11.1; 11.2; 11.3 |
| Week 7 : Feb 26: Mid Term Exam | Lectures | Mid Term prep | Mid Term exam: Thursday Mar 2 in class | Material: up to and including L6 | Recitations |
| Week 8 : Mar 5 | |
| Lectures | L8: Advanced Object Oriented programming concepts |
| InheritZoo.jar; Staff.jar | |
| Recitations | R6: Parsing infix arithmetic expressions |
| Assignments | P3: Parsing Boolean infix expressions; building and evaluating expression trees (due Mar 23) |
| Reading | Prichard chapter 9 |
| Spring Break : Mar 12 | |
| Week 9 : Mar 19 | |
| Lectures | Finishing Advanced Object Oriented Programming; generics; Thing.java |
| L9: Advanced Sorting; Sorting Demo | |
| Assignments | P3: Parsing Boolean infix expressions; building and evaluating expression trees due |
| Recitations | R7: Binary Search Trees |
| Reading | Prichard chapter 10 |
| Week 10 : Mar 26 | |
| Lectures | L10: Divide and Conquer Analysis |
| Recitations | R8: Inheritance |
| Reading | Prichard chapter 10 |
| Week 11 : Apr 2 | |
| Lectures | L11: Priority Queues; Heapsort IntegerMinHeap.java |
| L12: Graphs Part 1 | |
| Recitations | R9: Recurrence Relations |
| Assignments | HW2: Divide and Conquer Analysis (due week 12 Tuesday in class; late Thursday) |
| P4: Parsing and evaluating equations due week 13 | |
| Reading | Rosen Ch. 8.1;8.3 |
| Week 12 : Apr 9 | |
| Lectures | L12: Graphs Part 1: shortest paths |
| L13: Graphs Part 2; spanning trees; topological sorting | |
| Recitations | R10: In place heap sort |
| Assignments | HW2 due Tuesday in class; late Thursday |
| Reading | Prichard chapter 12 |
| Week 13 : Apr 16 | |
| Lectures | finish L13: Graphs Part 2 |
| L14: Hash Tables | |
| Recitations | R11: adjacency list representation of graphs |
| Assignments | P4 due; P5: Analysing equations |
| Reading | Prichard chapter 14 |
| Week 14 : Apr 23 | |
| Lectures | L15: Fun and Games with graphs |
| Recitations | R12: dependence graphs and topological sort |
| Assignments | HW3: Graphs due Thursday in class; late Tue week 15 in class |
| Reading | Prichard chapter 14 |
| Week 15 : Apr 30 | |
| Lectures | Wrap Up |
| Recitations | R13: hash tables |
| Assignments | P5 due ***TUESDAY MAY 2***; late ***THURSDAY MAY 4***; LAST QUIZ: fun and games with graphs om THURSDAY. |
| Week 16 : Final Exam | |
| Exams | Thursday May 11 6:20-8:20 pm in class |
| Material: from L6 Complexity up to and including L15: Fun and Games with graphs | |
