Algorithm Analysis, Asymptotic Notations
Search Algorithm and Analysis: Linear search and Binary Search
Sorting Algorithm and Analysis: Selection sort, Bubble Sort ,Insertion Sort, Merge Sort, Quick Sort
Abstract Data Types (ADT) - List ADT using Array, Linked List Implementations of List ADT - Stack ADT - Infix to Post fix conversion - Expression Evaluation - Queue ADT
Tree ADT - Tree Traversals: In-order traversal, Pre-order traversal, Post order traversal - Binary Tree ADT- Applications of Trees - Binary Search Tree ADT
Definitions - Topological Sort - Breadth First Traversal, Depth First Traversal - Minimum Spanning Tree, Prims and Kruskal Algorithm - Dijkstra’s Shortest Path Algorithm - Floyd’s Algorithm
Hashing: Separate Chaining, Open Addressing, Linear Probing - Double hashing - Rehashing
Binary Heap - Applications of Heap
Reference Book:
1.
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, Pearson Education, 2nd Edition, 2007. (Unit I-V)
2.
A. M. Tenenbaum, Y. Langsam and M. J. Augenstein, “Data Structures using C”, Pearson Education, 2nd Edition, 1998.(Unit I-V)
3.
T.H.Cormen, C.E.Leiserson, R.L.Rivest, and C.Stein, “Introduction to Algorithms”,Prentice Hall of India Ltd, 2nd Edition, 2001.(UNIT I )
Text Book:
M.A.Weiss ,”Data Structures and Algorithm Analysis in C”, Pearson Education, 2nd Edition, 2005. (Unit I-V)
