Outline of Syllabus
C4:-Algorithm Analysis and Design
Topic
Duration (Hrs)
1
Introduction and Preliminaries: Asymptotic Analysis, Elementary
Data Structuring and Algorithmics
06
2
Sorting and Selection Algorithms : Worst- Case and Randomized
04
3
Graph Algorithms : Connectivity Problems, Shortest paths
and Spanning Trees, Use of various kinds of heaps and Queues in Graph
Algorithms
08
4
Network Flows and Bipartite Matchings in Graphs
08
5
Use of Dynamic Programming for Designing efficient Algorithms
for Optimization Problems
05
6
Use of Divide-and-Conquer in Design and Analysis of Sequential
and parallel Algorithms
05
7
NP-Completeness and Approximation Algorithms
05
8
Use of Amortization in Algorithms Analysis
07
9
Elementary Geometric Problems: Algorithms and Data Structures
08
10
String Matching Algorithms
04
Lecture =60
Practical =60
Total class =120
Practical =60
Total class =120
BOOKS RECOMMENDED FOR READING AND REFERENCE
MAIN READING
- Thomas H. Cormen, Charles E. Leiserson and Ronald L. Riveit, "Introduction to Algorithms"
- Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, 'The Design and Analysis of Computer Algorithms"
SUPPLEMENTARY READING
- Kurt Mehlhorn, "Data Structures and Algorithms:
- Michael T. Goodrich and Roberto Tamassia, "Algorithm Design: Foundations, Analysis and internet Examples"