AI-Powered Learning Platform

Subject Syllabus

CSIT-403 – Analysis & Design of Algorithm (ADA)

CSIT · Semester 4

Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal

Course Modules

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

Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations Heap and heap sort Introduction to divide and conquer technique, analysis, design and comparison of various algorithms based on this technique Binary search Merge sort Quick sort Strassen's matrix multiplication

Study of Greedy strategy Optimal merge patterns Huffman coding Minimum spanning trees Knapsack problem Job sequencing with deadlines Single source shortest path algorithm

Concept of dynamic programming 0/1 Knapsack problem using DP Multistage graph Reliability design Floyd-Warshall algorithm

Backtracking concept 8 Queen's problem Hamiltonian cycle Graph coloring problem Introduction to branch & bound method, examples like traveling salesman problem Meaning of lower bound theory and its use in solving algebraic problem Introduction to parallel algorithms

Binary search trees Height balanced trees 2-3 trees B-trees Basic search and traversal techniques for trees and graphs (Inorder, preorder, postorder, DFS, BFS)NP-completeness