AI-Powered Learning Platform

Subject Syllabus

CB-402 - Design And Analysis of Algorithms

CSBS · Semester 4

Course Modules

Learn topic-wise with Hyper AI and revise using mapped PYQs.

Characteristics of Algorithm Analysis of Algorithm: Asymptotic analysis of Complexity Bounds – Best, Average and Worst-Case behavior Performance Measurements of Algorithm, Time and Space Trade-Offs Analysis of Recursive Algorithms through Recurrence Relations: Substitution Method, Recursion Tree Method and Masters' Theorem

Brute-Force, Heuristics, Greedy, Dynamic Programming, Branch and Bound and Backtracking methodologies Illustrations of these techniques for Problem-Solving, Bin Packing, Knapsack, Travelling Salesman Problem

Traversal algorithms: Depth First Search (DFS) and Breadth First Search (BFS)Shortest path algorithms, Transitive closure, Minimum Spanning Tree, Topological sorting, Network Flow Algorithm

Computability of Algorithms Computability classes – P, NP, NP-complete and NP-hard Cook's theorem, Standard NP-complete problems and Reduction techniques

Approximation algorithms, Randomized algorithms Class of problems beyond NP – P SPACE Introduction to Quantum Algorithms