Class activities
Information about lectures, labs, assignments, and reading.
| Week 1 : Aug. 21 | |
| Lectures | L1: Introduction and Course Info |
| L2: Stacks; LLStack.jar a linked list based implementation | |
| Reading | Prichard Ch. 7 |
| Recitations | No recits this week |
| Week 2 : Aug. 28 | |
| Lectures | P1 introduction; L3: Queues |
| Recitations | R1: Stacks and Recursion; Piazza is up; check the news |
| Reading | Prichard Ch. 7 and 8 |
| Week 3 : Sep. 4 | |
| Lectures | L4: Grammar basics; L5: Recursion and Induction |
| Recitations | R2: Implementing a Queue using a Linked List |
| Monday (Labor day) recitation people: go to other recitations or show your work to your TA next week | |
| Assignments | P1: due Sep. 8 23:59; late Sep. 12 23:59 |
| Reading | Prichard Ch. 6.1 & 6.3 |
| Week 4 : Sep 11 | |
| Lectures | L6: Computational Complexity; Big-O analysis |
| Recitations | R3: scanning and grammars |
| Assignments | HW1: Grammars and expressions (due Sep. 20 in class; late Sep. 22) |
| P2: Converting infix to postfix expressions and evaluating these | |
| Reading | Prichard Ch. 6 and 10.1 |
| Rosen Ch. 3.2-3.3 | |
| Week 5 : Sep 18 | |
| Lectures | L7: trees; InfixSum.jar an Infix sum example |
| Parsing infix expressions; building expression trees | |
| Recitations | R4: induction |
| Assignments | HW1: Grammars and expressions due Sep. 20 in class; late Sep. 22 |
| Reading | Prichard Ch. 6 and 10.1 |
| Rosen Ch. 3.2-3.3 | |
| Week 6 : Sep 25 | |
| Lectures | finishing L7: trees |
| Preparing for the mid term test: Thursday October 6 in class | |
| This week Thursday we will do in class quizzes (Grammars Induction Orders-of-Magnitude Trees) on thursday to prepare for the test | |
| Recitations | R5: Orders of Magnitude and Complexity |
| Reading | Prichard Ch. 11; Rosen Ch. 11.1; 11.2; 11.3 |
| Week 7 : Mid Term Exam | |
| Exams | Mid Term exam: Thursday Oct 6 |
| Material: up to and including L7: Trees | |
| Recitations | no recitations |
| Week 8 : Oct 9 | |
| Lectures | L8: Advanced Object Oriented programming concepts; InheritZoo.jar |
| Recitations | R6: Parsing infix arithmetic expressions |
| Assignments | P3: Parsing infix arithmetic expressions; building and evaluating expression trees |
| Reading | Prichard chapter 9 |
| Week 9 : Oct 16 | |
| Lectures | Finishing Advanced Object Oriented Programming; generics; Thing.java |
| L9: Advanced Sorting | |
| Recitations | R7: Binary Search Trees |
| Reading | Prichard chapter 10 |
| Week 10 : Oct 23 | |
| Lectures | Advanced Sorting; Cool Sorting Demos |
| L10: Divide and Conquer Analysis | |
| Recitations | R8: Class hierarchies |
| Assignments | P3 due |
| Reading | Prichard chapter 10 |
| Week 11 : Oct 30 | |
| Lectures | Priority Queues; Heapsort |
| L11: Priority Queues; IntegerMinHeap.java | |
| Recitations | R9: Recurrence Relations |
| Assignments | P4: Parsing and evaluating equations due week 12 Nov 10 late Nov 14 |
| HW2: Divide and Conquer Analysis (due week 13 Tuesday in class; late Thursday) | |
| Reading | Rosen Ch. 8.1;8.3 |
| Week 12 : Nov 6 | |
| Lectures | L12: Graphs Part 1 |
| Recitations | R10: In place heap sort; |
| Assignments | P4: Parsing and evaluating equations due week 12 Nov 10 late Nov 14 |
| Reading | Prichard chapter 12 |
| Week 13 : Nov 13 | |
| Lectures | L13: Graphs Part 2 |
| Recitations | R11: adjacency list representation of graphs |
| HW3: Graphs ( due Thu Dec 1 in class; late Dec 6 in class) | |
| Assignments | P5: Analysing equations |
| Reading | Prichard chapter 14 |
| Week 14 : Nov 27 | |
| Lectures | L14: Hash Tables |
| Recitations | R12: dependence graphs and topological sort |
| Reading | Prichard chapter 14 |
| Week 15 : Dec 4 | |
| Lectures | L15: Fun and Games with graphs; Wrap Up |
| Recitations | R13: hash tables |
| Assignments | P5 due ***TUESDAY*** Dec 6; late ***THURSDAY*** Dec 8 |
| Week 16 : Final Exam | |
| Exams | Section 1 Tuesday Dec 13 6:20-8:20 pm; Section 2 Monday Dec 12 6:20-8:20 pm |
| Material: from L6 Complexity up to and including L15: Fun and Games with graphs | |
