Introduction to Algorithms and Data Structures (EE255)
Programme:
B.Tech (E&E)
Semester:
Fourth
Category:
Programme Specific Electives (PSE)
Credits (L-T-P):
04 (3-1-0)
Content:
Mathematical basis and notions for algorithm analysis. Sorting, Divide and Conquer, Linear time sorting, Elementary Data Structures, Priority Queues, BST and RBT.
Design and Analysis Paradigms – Dynamic Programming, Greedy Algorithms, Graph Algorithms.
References:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest , C. Stein, Introduction to Algorithms, 2nd Edition, PHI, 2004.
2. D.E. Knuth, The Art of Computer Programming, Volumes I and III, Addison-Wesley, 1973.
3. Anany Levitin, Introduction to the Design and Analysis of Algorithms, Pearson Education, 2003.
Department:
Electrical and Electronics Engineering