Topic

No. of hours

Lecture

Tutorial/Practical

Introduction to Analysis of Algorithms.

3

3

-

Mathematical Preliminaries.

3

3

-

Computational Complexity.

3

3

-

Calculating Asymptotic Complexity: Sorting Algorithms.

3

3

-

Recurrence Relations.

3

3

-

P, NP and NP-Completeness.

3

3

-

Network flow.

3

3

-

Greedy Algorithms.

3

3

-

Divide and Conquer.

3

3

-

Dynamic Programming.

3

3

-

Satisfiability Problems.

3

3

-

Evolutionary Programming and Genetic Algorithms.

3

3

-

Approximation Algorithms.

3

3

-

Theory of Randomization.

3

3

-