DSA

E0 251 (AUG) 3:1 Data Structures and Algorithms

Course Contents

Abstract data types and data structures, Classes and objects, Complexity

of algorithms: worst case, average case, and amoritized complexity.

Algorithm analysis. Algorithm Design Paradigms. Lists: stacks, queues,

implementation, garbage collection. Dictionaries: Hash tables, Binary

search trees, AVL trees, Red-Black trees, Splay trees, Skip-lists,

B-Trees. Priority queues. Graphs: Shortest path algorithms, minimal

spanning tree algorithms, depth-first and breadth-first search. Sorting:

Advanced sorting methods and their analysis, lower bound on complexity,

order statistics.

A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms,

Addison Wesley, Reading Massachusetts, USA, 1983

T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms,

The MIT Press, Cambridge, Massachusetts, USA, 1990

M.A. Weiss, Data Structures and Algorithms Analysis in C++,

Benjamin/Cummins, Redwood City, California, USA, 1994.

The course is taught by

    Prof V. Susheela Devi