Syllabus
Time complexity analysis. Big-Oh, Big-Omega, and Big-Theta notations. Data Types, ADTs, Various types of ADTs such as List, Set Ques, circular queue, trees, graphs etc.2-3 tree, red-black trees, binary trees, search trees, n-ary trees. Graph traversals, searching on graph, BFS, DFS, Spanning Tree, Minimum Spanning Tree, paths, shortest paths, TSP. Data structures for maintaining ranges, intervals and disjoint sets with applications. Binary heap, binomial and fibonacci heaps, skip lists, Hashing, universal hashing, integer sorting algorithms with analysis. Algorithm design: greedy, divide and conquer, dynamic programming, branch and bound, randomized algorithms. Advanced data structures.
Text Books
Same as reference
References
- Gregory L. Heileman , Data Structure, Algorithm and OOP, Tata Mc Graw Hill, NewDelhi.
- Adam Drozdek, "Data Structures & Algorithm in C++,Vikas publication House.
- Aho, Hopcroft, and Ulmann, "Data Structures and Algorithms," Pearson 1982.
- T. Cormen, C. Leiserson, R. Rivest, and C. Stein, "Introduction to Algorithms," 3Ed. MIT Press, 2009.
- DEBASIS SAMANTA, "Classic Data Structures," Prentice Hall India Learning Private Limited, 2009.