Design and Analysis of Algorithms For BS Program

 

Objectives of this course:

 Detailed study of the basic notions of the design of algorithms and the underlying data structures. Several measures of complexity are introduced. Emphasis to be on the structure, complexity, and efficiency of algorithms.

Things you will cover in this  course:

• Introduction
• Asymptotic notations
• Recursion and recurrence relations
• Divide-and-conquer approach
• Sorting
• Search trees
• Heaps
• Hashing
• Greedy approach
• Dynamic programming
• Graph algorithms
• Shortest paths
• Network flow
• Disjoint Sets
• Polynomial and matrix calculations
• String matching
• NP complete problems
• Approximation algorithms.

Reference material:

1. Introduction to Algorithms, T. H. Cormen, C. E. Leiserson, and R. L.Rivest, MIT Press, McGraw-Hill, 3rd Edition, New York, NY, 2010.
2. Algorithms in C++; Robert Sedgewick

Other Information:

Course code:  CS304

Prerequisites:  Data Structures and Algorithms

Credit Hours: 3

Lectures: 2

Labs:      1