Class activities
Regularly updated with information about lectures, labs, assignments, and reading.
| Week 1 : Aug. 25 - Aug. 29 | |
| Lectures | L1: Introduction and Course Info |
| L2: Basics of grammars and parsing | |
| Code from quiz 1 | |
| Answer key (with some explanations) for quiz 1 | |
| Reading | Prichard Ch. 6.2; Rosen Ch. 13.1 |
| Recitations | R1: Tour of CS200 RamCT; Grading system; Practice writing code; Java refresher as needed |
| Assignments | P1: Review; simple parsing and binary search (due Sep. 10) |
| Week 2 : Sep. 2 - Sep. 5 | |
| Lectures | Arithmetic Expressions; Parse code |
| L3:Stacks | |
| Recitations | R2: Using Scanner class; help for PA1; discrete math for grammars. Updated exercise sheet with more examples!. Answer key |
| Exams | Quiz 2 given through RamCT |
| Reading | Prichard Ch. 7 |
| Week 3 : Sep. 8 - Sep. 12 | |
| Lectures | More Stacks |
| L4: Recursion; Mathematical Induction | |
| Recitations | R3: examples/practice in recursive programming; Stacks |
| Reading | "Prichard Ch. 6.1 & 6.3 |
| Exams | Quiz 3 given during a lecture. Answer key |
| Assignments | WA1: Grammars (due Sep. 16) |
| Week 4 : Sep. 15 - Sep. 19 | |
| Lectures | L5: Queues |
| L6:Algorithm efficiency. Computational Complexity; Big-O analysis. | |
| Reading | Prichard Ch. 8 and 10.1 |
| Rosen Ch. 3.2-3.3 | |
| Recitations | R4: Strategies and tools for debugging in Eclipse; Worksheets on induction/recursion; Work in pairs on PA2. |
| Exams | Quiz 4 given through RamCT (9/16 11AM-9/18 9AM) |
| Assignments | PA2 Sorting & Advanced OO (due Oct. 1) |
| Week 5 : Sep. 22 - Sep. 26 | |
| Lectures | L7:MergeSort |
| More complexity | |
| Reading | Prichard Ch. 10 |
| Exams | Quiz 5 given in lab -- programming stacks and queues |
| Recitations | Quiz; working in pairs |
| Week 6 : Sep. 29 - Oct. 3 | |
| Lectures | More advanced sorting. |
| Quicksort | |
| Reading | Prichard Ch. 9 |
| Recitations | Big-O practice; Complexity worksheet1; Complexity worksheet 2;Quicksort; Midterm preparation; Complexity worksheet Answer Key |
| Exams | Quiz 6 given through RamCT (9/30 11AM-10/2 9AM) |
| Assignments | WA2: induction; complexity (due Oct. 7) |
| Week 7 : Oct. 6 - Oct. 10 | |
| Lectures | L8: Advanced Object Oriented programming concepts |
| Exams | Midterm 1 (Oct. 9) |
| Recitations | Programming question for midterm |
| Assignments | PA3: BSTs (due Mon. Oct. 20) |
| Week 8 : Oct. 13 - Oct. 17 | |
| Lectures | L9: Binary Trees |
| BSTs | |
| Reading | Prichard Ch. 11; Rosen Ch. 11 |
| Exams | Quiz 7 given through RamCT (10/14 11AM-10/16 9AM) |
| Recitations | Implementing trees; time for pair programming |
| Week 9 : Oct. 20 - Oct. 24 | |
| Lectures | Finish trees |
| Recurrence Relations and Divide & Conquer | |
| Reading | Rosen Ch. 8.1-8.3 |
| Exams | Quiz 8 given through RamCT (10/21 11AM-10/23 9AM) |
| Recitations | Discrete math on trees; Recurrence Relations & Master Theorem |
| Web page for new pairs | |
| Assignments | WA3: trees (due Oct. 28) |
| Week 10 : Oct. 27 - Oct. 31 | |
| Lectures | Tables and Priority Queues |
| Reading | Prichard Ch. 12 |
| Recitations | Misc programming skills; help with WA4; time for getting PA3 fixed |
| Make partner requests by noon on 10/30; see Partner Selection under Course Content on RamCT. View partner descriptions at partner page | |
| Exams | Quiz 9 given through RamCT (10/28 11AM-10/30 9AM) |
| Assignments | PA4: hashing (due Nov. 19) |
| WA4: recurrence relations (due Nov. 4) | |
| Week 11 : Nov. 3 - Nov. 7 | |
| Lectures | Heaps and Heapsort |
| Hashing | |
| Reading | Prichard Ch. 13.2 |
| Recitations | R11: Implementing heaps; Midterm guide and practice |
| Exams | Quiz 10 given through RamCT (11/4 11AM-11/6 9AM) |
| Week 12 : Nov. 10 - Nov. 14 | |
| Lectures | Midterm review (if time) |
| Exams | Midterm 2 |
| Recitations | Programming question for midterm; Tables |
| Week 13 : Nov. 17 - Nov. 21 | |
| Lectures | Graphs Part 1 Special guests from New Century Software |
| Graphs cont. | |
| Reading | Rosen Ch. 10; Prichard Ch. 14 |
| Recitations | R13: Representing graphs; Work on PA4; Review midterm |
| Exams | Quiz 11 given through RamCT (11/18 11AM-11/20 9AM) |
| Assignments | PA5: graphs (due Dec. 10) |
| Week 14 : Dec. 1 - Dec. 5 | |
| Lectures | Graphs Part 2 |
| Reading | Rosen Ch. 10; Prichard Ch. 14 |
| Recitations | R14: Implementing graphs; graph discrete math |
| Exams | Quiz 12 given through RamCT (12/2 11AM-12/4 9AM) LAST QUIZ! |
| Assignments | WA5:WA: team eval (due Dec. 12); spreadsheet in excel; spreadsheet in comma separated values |
| Week 15 : Dec. 8 - Dec. 12 | |
| Lectures | Graphs cont. Final review if time. |
| Reading | Prichard Ch. 13.1 & 15.3 |
| Recitations | Programming question for final |
| Week 16 : Dec. 15 | |
| Exams | Final 11:50AM-1:50PM; guide |
