Held: Wednesday, 9 December 2015

Back to Outline 40 - Looking Ahead: P vs. NP. On to Outline 42 - Evaluate and Debief.

Summary

We reflect on the primary learning outcomes of the course.

Related Pages

Overview

• Course goals.
• An inventory of learning outcomes.

Administrivia

• Update on grading
  • Everyone who has made reasonable effort will pass.
  • I will let you know your likely grade a week before I submit them. You can argue for higher or lower.

Upcoming Work

• Exam 2 due Friday.
• Final exam next Tuesday at 2pm.

Extra Credit

• CS Extras Thursday.
• Kington Downtown Chicago talk tomorrow.
• Composing class concert tonight (?)

The Subject Matter of the Course

Big Picture

• A toolkit for thinking about algorithm design
• An approach to thinking about the algorithms you design
• "The literature" - Important algorithms, ADTs, and data structures.
• Other Things

An Approach to Thinking About the Algorithms You Design

• Try examples by hand.
• Try to find a counter-example.
• Try again.
• If you can't find a counter-example, try to prove it correct.
• Show it to someon else.
• Compute its asymptotic behavior.

A Tookit for Thinking About Algorithm Design

• Primary techniques
  • Divide and conquer
  • Dynamic programmming
  • Greed and modifications thereof
  • Draw the right graph and use a graph algorithm
• "The Literature" (see below)

"The Literature"

• ...

Other Things