CS420dl Schedule

Introduction to the
Analysis of Algorithms

 ·  Home  ·  Syllabus  ·  Resources  ·  RamCT Blackboard Login  ·  Schedule  ·  Assignments  ·  Discussions

Period
From-To
Material Tasks
week 1
May 14 - May 20
Problems, Algorithms
  • Lecture 1 notes, slides
  • Discussion 0 due Fri May 18.
    Make sure you understand the instructions for discussions and quizzes, see the syllabus.
  • Discussion 1 due Wed May 23
  • Reading: The notes are always your first source
    On problems and (in)tractability, further reading is in CLRS (Cormen Leiserson Rivest Stein) Chapter 34.

week 2
May 21 - May 27
Math fundamentals
upper and lower bounds

week 3
May 28 - June 3
Recurrence Relations
  • Lecture 4 notes, slides
  • Assignment 0 due Sun June 3
  • Start working on Assignment 1
    due Sun June 10; Discussion 3 helps you with this.
  • Reading: CLRS 4.4, 4.5,
    Rosen Recurrence Relations (6th edition 7.1, 7.2, 7.3)

week 4
June 4 - June 10
Sorting complexity

week 5
June 11 - June 17
Test
  • Material from weeks 1, 2, 3, and 4.
    Math fundamentals and intro to sorting.
    Test format: a quiz, that can be taken ONCE over a period of 2 hours. The test period has been extended to June 24.

week 6
June 18 - June 24
Loops
Loop Analysis

week 7
June 25 - July 1
Graph Traversals
Greedy Algorithms


week 8
July 2 - July 8
Dynamic Programming

week 9
July 9 - July 15
Backtrack

week 10
July 16 - July 22
Knapsack

week 11
July 23 - July 29
Shortest paths
week 12
July 28 - Aug 1
Final Test
  • Graph Traversals to Shortest Paths
    Test in on line quiz format, open from Sat July 28 until Wed Aug 1

Copyright © Colorado State University. All rights reserved.