Introduction - algorithm definition and specification – Design of Algorithms, and Complexity of Algorithms, Asymptotic Notations, Growth of function
Elementary Data structures
Stacks and queues – Link Lists- Trees – priority queues –sets and disjoint set union – graphs – basic traversal and search techniques.
Divide – and – conquer:-
General method – binary search – merge sort – Quick sort – The Greedy method:-General method – knapsack problem – minimum cost spanning tree – single source shortest path
Dynamic Programming – general method – multistage graphs – all pair shortest path – optimal binary search trees – 0/1 Knapsack – traveling salesman problem
Backtracking:- general method – 8-Queens problem – sum of subsets
Hamiltonian cycles – knapsack problem – Branch and bound:- The Method – 0/1 Knapsack problem – traveling salesperson.
Links:
[1] https://www.csit.iisuniv.ac.in/courses/subjects/analysis-and-design-algorithm-0
[2] https://www.csit.iisuniv.ac.in/academic-year/2017-18