Course Details
Subject {L-T-P / C} : CS6103 : Data Structure and Algorithm Design { 3-0-0 / 3}
Subject Nature : Theory
Coordinator : Bibhudatta Sahoo
Syllabus
Module 1 : |
Introduction: introduction to the ideas of specification, correctness, and analysis of algorithms, proving algorithm correctness, analyzing algorithms asymptotic analysis and amortized analysis, analyzing the worst-case performance of algorithms.
|
Course Objective
1 . |
Synthesize efficient algorithms for the real-world problem. |
2 . |
Methods to be adopted to cope with NP-complete Problem |
3 . |
Application of data structures in problem representation and algorithm design |
4 . |
Apply important algorithmic design paradigms and methods of analysis in problem solving |
Course Outcome
1 . |
Argue the correctness of algorithms using inductive proofs and invariants. |
Essential Reading
1 . |
S. K. Basu, Design Methods and Analysis of Algorithms, Prentice Hall of India , Second Edition , February 2015 |
2 . |
Jon Kleinberg and Eva Tardos, Algorithm design, Pearson |
Supplementary Reading
1 . |
Ellis Horowitz, Sartaj Sahni, Dinesh Mehta, Fundamentals of Data Structures in C++, Universities Press |
2 . |
Steven S. Skiena, Algorithm Design Manual, Springer |
Journal and Conferences
1 . |
Journal of Algorithms, Elsevier. |