CS 5329 - Algorithm Design and Analysis

Course Description:

Introduction to algorithm design and analysis, computational complexity, and NP-completeness theory.


Course Objectives:

  1. Basic concepts of computational complexity.

  2. Fundamental algorithm design strategies(divide-and-conquer, dynamic programming, back-tracking, and etc.)

  3. Important algorithms(sorting, dictionary operations, algorithms on trees and graphs,and etc.)

  4. NP-Hard and NP - Complete concepts, proving NP- Completeness.

Course Notes:


Section Info:

Lecture/Lab Hours: 3 hours lecture, 0 hours lab
Offered: Very frequently (typically once a year, Fall or Spring).