COSC803-Advanced Computer Algorithms

  1. Course Syllabus
Review of data structures; linear data structures, hashing, trees, graphs, recursion. Complexity classes; empirical measurements of performance; time and space tradeoffs analysis. Algorithmic strategies: Brute-force algorithms; greedy algorithms; divide-and-conquer; backtracking; branch-and-bound; minimum spanning tree, heuristics; pattern matching and string/text algorithms; numerical approximation algorithms. Tractable and intractable problems.

Reference Textbook
“Introduction to the Design & Analysis of Algorithms”, 3rd Editiion by Analy Levitin, Pearson Education, Inc.  Upper Saddle River, NJ, 2002.
  1. Course Material
                  
S/No
 Topic
 Chapter
1.
 Introduction
 Chapter 1
2
 Fundamentals of the Analysis of Algorithm Efficiency
 Chapter 2
3
 Brute Force and Exhaustive Search
 Chapter 3
4
 Decrease-and-Conquer
 Chapter 4
5
 Divide-and-Conquer
 Chapter 5
6
 Transform-and-Conquer
 Chapter 6
7
 Space and Time Trade-Offs
 Chapter 7
8
 Dynamic Programming
 Chapter 8
9
 Greedy Technique
 Chapter 9
10
 Iterative Improvement
 Chapter 10
    • Assignments
    • Students' Grades