I want the syllabus of Design and Analysis of Algorithms of B.Tech CSE of Indian Institute Of Technology Roorkee so can you provide me?

I am providing you the syllabus of Design and Analysis of Algorithms of B.Tech CSE of Indian Institute Of Technology Roorkee.

IIT Roorkee B.Tech CSE Design and Analysis of Algorithms syllabus

Subject Code: CSN-212

Course Title: Design and Analysis of Algorithms

Examination Duration (Hrs.): Theory:3 Practical:0

Objective: To familiarize students with the design strategies and bounds on the performance of
different computer algorithms.

Contents

Review of Data Structures

Program Performance: Time and space complexity,
asymptotic notation, complexity analysis, recurrence equations
and their solution.

Algorithmic Techniques: Algorithm design strategies, divide
and conquer, merge sort, quick sort and its performance
analysis, randomized quick sort, Strassen’s matrix
multiplication; Greedy method and its applications, knapsack
problem; Dynamic programming and its performance analysis,
optimal binary search trees, 0/1 knapsack problem; Traveling
salesman problem; Back-tracking, n-queens problem, graph
coloring, Hamiltonian cycles, knapsack problem; Branch and
bound examples, 15-puzzle problem, 0/1 knapsack, traveling
salesman.

Graph Algorithms: DFS and BFS, spanning trees,
biconnectivity; Minimum cost spanning trees: Kruskal’s, Prim’s
and Sollin’s algorithms; Path finding and shortest path
algorithms; Topological sorting; Bipartite graphs.

Infeasibility: P and NP-classes, NP-hard problems, reduction.

Parallel Algorithms: Data and control parallelism, embedding
of problem graphs into processor graphs, parallel algorithms for
matrix multiplication.

Other Algorithms: Number theoretic algorithms, string
matching algorithms, approximation algorithms, randomized
algorithms.

Suggested Books:

Sahni, S., “Data Structures, Algorithms and Applications in C++”,
WCB/McGraw-Hill.
Mchugh, J.A., “Algorithmic Graph Theory”, Prentice-Hall.
Quinn, M.J., “Parallel Computing Theory & Practice”, McGraw-
Hill.
Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C.,
“Introduction to Algorithms”, 2nd
Ed., Prentice-Hall of India.
Dasgupta, S., Papadimitriou, C. and Vazirani, U., “Algorithms”,
Tata McGraw-Hill.

Contact-

Indian Institute of Technology Roorkee
Roorkee - Haridwar Highway, Roorkee, Uttarakhand 247667