CSCI 321 - Schedule - Fall 2007

• Week 15: Classes P, NP, and NPC (Dec 3 - 7)
  • Chapter 34: Classes P, NP, and NPC (REALLY COOL STUFF!)
  • Lecture - Transformations to show NP-Completeness
  • 'Dry' Lab this week - Practice showing P, NP, NPC
    worksheet handed out at this time.
  • Final Exam: Monday, December 10, 2:15 - 4:15
  • Thank you, John, Ryan, Adrian, Brandon, Steve, Bryce, Ryan, and Joe for sharing this course with me. I greatly appreciate your hard work this semester. Enjoy the holidays.

• Week 14: Exam 3, Presentations (November 26 - 30)
  • Monday: Ryan K (recording music) and Adrian A (subset partition)
  • Wednesday: Steve V (bitonic euler), John R (max subsequence), Bryce H (office party)
  • Friday: Ryan P (checkerboard), Brandon G (investing), Joe C (Printing Neatly)
  • Exam 3: Wednesday during lab time
  • Your Dyn. Prog. paper is due on Monday, December 3, class time.

• Week 13: Thanksgiving Vacation! ... Graph Algorithms (Nov 19 - 20)
  • Minimum Spanning Trees (Chap. 23) - Prim and Kruskal - very greedy!
  • Exam 3 - Next Week - Wednesday, November 28 - during lab time
  • In case you are bored over break ... (not an assignment) Lab 13: Relax while Implementing some Graph Algorithms

• Week 12: Dynamic Programming Algorithms and Graph Algorithms(Nov. 12 - 16)
  • Graph Representations and minimum spanning trees (Chap 23).
  • Dynamic Algorithms - Chapter 15, (Scheduling, Matrix Chaining, Longest Common Subsequence)
  • No class or lab on Wednesday due to advising. Most of you should be registering with KnightLine

• Week 11: Greedy Algs and Dynamic Programming Algorithms (Nov 5 - 9)
  • Greedy Algorithms - Chapter 16, Sections 1 and 2
  • Dynamic Algorithms - Chapter 15, (Scheduling, Matrix Chaining, Longest Common Subsequence)
  • Tuesday is advising day! No classes.
  • Lab 11: Handed out in class; Each of you will choose a problem from the list provided. Presentations/Paper will be due after Thanksgiving. hand out

• Week 10: Greedy Algorithms and Exam 2 (Oct. 29 - Nov. 2)
  • Ch. 16 - Greedy Algorithms: coins, scheduling, Huffman codes
  • Exam 2 during class time on Wednesday, October 31
  • Lab 10 Greedy Algorithm to construct Huffman Codes

• Week 9: Advanced Design Technique: Greedy Algorithms and Review for Exam (Oct. 22 - 26)
  • Beginning Chapter 16, Sections 1, 2, 3, 5 (not on Exam 2)
  • Lab this week is a continuation of last week's lab.
  • Warning! ... Exam 2 is during class time on October 31.

• Week 8: Order Statistics(Select) and Adversarial Arguments (Oct. 15 - 19)
  • Lecture: Chapter 8, Chapter 9, Sections 1 and 3.
  • Lab 8 More with sort and select
  • Early Warning! ... Exam 2 is during week of October 29.

• Week 7: "Sort Quick!": Linear Sorts and Order Statistics(Oct. 8 - 12)
  • Chapter 8, Section 1(Lower Bound for Comparison-based Sorts), Section 2(Counting Sort), Section 3(Radix Sort),and Section 4(Bucket Sort).
  • Lab 7 Adapting Comparison-Based Sorts

• Week 6: Heaps as Priority Queues, "Quick! Sort!" (October 1-3)
  • Long Weekend! - No class October 4-5
  • Lecture - Heaps (Chap 6), QuickSort(Chap 7)
  • Lab 6 Priority Queue using Heaps

• Week 5: Exam I, The Master Theorm, Using Heaps (Sept. 24 - 28)
  • Lecture:
     Chapter 4 Sections 1 and 2: Solving Recurrence Relations (exact, bounding, tree)
     Chapter 4, Sections 3 and 4 - Master Thm
  • Exam 1 is Friday, September 28 during class in COF 203
  • Lab 5 Comparison-Based Sorting and Heaps

• Week 4: The MASTER THEOREM, Asymptotic Notation (Sept. 17 - 21)
  • Lecture - Chapter 3 and Chapter 4
  • Lab 4: Algorithm Design, Implementation and Analysis
  • Reminder ... Exam 1 is Friday, September 28 (in class)
  • Exams from Fall 2001: Exam 1, Exam 2, Final Exam

• Week 3: Algorithm Analysis, Asymptotic Notation, and Recurrence Relations (Sept. 10 - 14)
  • Lecture - Chapter 2 and 3 - Analysis of SelectionSort and MergeSort, Big-O, Theta, Omega
  • Lab 3 Numeric evaluation of recurrences and Consequences of various parameter passing methods
    (It is more exciting than it sounds ... really!)

• Week 2: Classifying Complexity, Time Analysis, Proof of Correctness (Sept. 4 - 7)
  • Monday is Labor Day ... no class.
  • Lecture - Chapters 2 and 3, Appendices A and B - summations, worst case and average case analysis, complexity classes
  • Lab 2 - How Important is Asymptotic Order? (from Chapter 1)

• Week 1: Introduction (August 27 - 31)
  • Lecture - Preface and Chapter 1 - Read these!
  • Lab 1 - an exploration into why we study algorithms.