COSC-330 Algorithms

Professor Kalyanasundaram

This course explores various techniques used in the design and analysis of computer algorithms. Starting with the divide-and-conquer technique, the course covers various general approaches such as the greedy method and dynamic programming. Depending on time, various examples from the following problem domains will be considered: graph theory, shortest path, max-flow, matching, FFT, data compression, cryptography, and computational geometry. The notions of NP-completeness and computability will be introduced. If time permits, students will be introduced to online and parallel algorithms. Prerequisite: COSC-173. Spring.

Other academic years
There is information about this course number in other academic years:

• 2005-2006 Fall and Spring
• 2007-2008 Fall and Spring
• 2008-2009 Fall and Spring
• 2009-2010 Fall and Spring
• 2010-2011 Fall and Spring

More information
Look for this course in the schedule of classes.

The academic department web site for this program may provide other details about this course.