Data Structures And Algorithms
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.