Data Structures and Algorithms(CMA701)
Course Name:
Data Structures and Algorithms
Programme:
Semester:
Category:
Credits (L-T-P):
Content:
Abstract data structures and their implementations: arrays, list, stack, queue. Tree data structures: Binary trees, Height balanced trees, priority queues, Tree traversal algorithms. Dynamic Data structures: 2-3 trees, Red-black trees, binary heaps, binomial and Fibonacci heaps, Skip lists, universal hashing. Graphs and algorithms: Breadth first search and Depth First Search, Shortest paths, minimum spanning trees. Introduction to analysis of algorithms: Big Oh, Omega and Theta notations. Basic algorithm design techniques: Dynamic programming and divide-and- conquer, Sorting algorithms with analysis