CS420dl Introduction to the Analysis of Algorithms. Main Page
	·  Home  ·  Syllabus  ·  Resources  ·  RamCT Blackboard Login  ·  Schedule  ·  Assignments  ·  Discussions

CS 320 or an equivalent background in programming and analysis concepts. In particular, you need to be able to read and understand mathematical concepts such as induction, series, summations, products, differentials and integrals. (Appendix A in Cormen et.al.)

This course studies Problems, Complexity, Decidability and (In)tractability, Lowerbounds, Recurrence Relations, Graph Traversals and shortest paths, Greedy Algorithms, Dynamic Programming, and Backtrack.

Course Objectives

Upon completion of this course, students will be able (1) to understand the Mathematical techniques to analyze the complexity of problems and algorithms, (2) to apply algorithmic techniques such as greedy search, dynamic programming and backtrack and (3) to design efficient algorithms for complex problems

The schedule page contains the weekly schedule, links to lecture notes, quizzes, assignments , discussions, etc.

Notes

The lecture notes are brief. They are not meant to be complete study material, but initial pointers to what needs to be studied. For more complete material, see the resources page.

The quizzes are worth very few points, and we DROP your worst three quiz results. They are there for you to make sure you are getting the material, and whether you are studying enough.

Instructor Wim Bohm Email: bohm@cs.colostate.edu
Office hours: MW 1-2 pm, room 344 CSB

GTA Nissa Osheim Email: cs420dl@cs.colostate.edu

Copyright © Colorado State University. All rights reserved.