EC881 Computer Algorithms and Data Structures
Course Name:
EC881 Computer Algorithms and Data Structures
Programme:
M.Tech(SPML)
Category:
Elective (Ele)
Credits (L-T-P):
(3-0-2) 4
Content:
Algorithm analysis, Asymptotic notations. Divide and Conquer algorithms, Analysis of divide and conquer algorithms, master method, examples - merge sort, quick sort, binary search, Data structures, Linked list, stacks and queues, insertion/deletion and analysis, Binary search trees Hash Tables – hash function and properties, collision handling, bloom filters, Greedy algorithms and Dynamic programming examples. Graph traversal, DFS, BFS, shortest path algorithms Dijkstra’s and Bellman Ford algorithm.
References:
A.V. Aho, J.E. Hopcroft and J. D. Ullman, Data structures and Algorithms, Pearson, 2004.
T.H.Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, PHI, 2004.
Mark Allen Weiss, Data Struct & Algorithm Analysis in C Second Edition Pearson 2002