### Lectures

Material to be posted/updated before class.

- Lecture 1:
*update*slides (after class) - nonrecursive algorithms - Lecture 2
- Lecture 3:
*update*slides - recursive algorithms - Lecture 4
- Lecture 5:
*update*slides - exercise and programming discussion - Lecture 6
- Lecture 7: last big idea to conclude crash course + project 1 discussion
- Lecture 8
- Lecture 9:
*update*slides combinatorial problems (part 1) - Lecture 10: part 2
- ☽ Lecture 11:
*update*slides - NP completeness (part 1) - Lecture 12: part 2
- ☽ Lecture 13: part 3
- Lecture 14: part 4
- ☽ Lecture 15: Overcoming NPC (if time permits)
- Lecture 16 (Wed Mar 27): project 1 presentation + submission
- Lecture 17: slides - back from Eid holiday
*CONT.*overcoming NPC - Lecture 18: project 2 assignment + discussion
- Lecture 19: slides - multipoint polynomial evaluation (part 1)
- Lecture 20: part 2 (strategies, algorithm design)
- Lecture 21: intro FFT
- ★Lecture 22: final project assignment + discussion
- Lecture 23: help desk TBA
- Lecture 24

### My Web Links

Some links may require Java

- al Khawarizmi: contribution to modern computing
- Wolfram Mathworld:

### Student Picks

Your picks for most helpful webpages