CSC-652
BS
Advanced Analysis of Algorithms
(CC) Computing Core
Theory: 3 Cr. Hrs
Total: 3 Cr. Hrs
Mathematical foundations for analysis of algorithms; Classification of Algorithms; Analysis of Divide-and-Conquer algorithms; Dynamic Programming; Greedy Algorithms and their analysis; Graph Algorithms and their analysis; Encryption Algorithms and their analysis; String matching Algorithms and their analysis; Parallel Algorithms; NP-completeness; Approximation Algorithms;
In Programmes
MPhil
MPhil (Computer Science)
Semester 1 —
Core
(Current Scheme)
Taught By