Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation ––singly linked lists- circularly linked lists- doubly-linked lists – applications of lists –Polynomial Manipulation – All operations (Insertion, Deletion, Merge, Traversal)
Stack ADT – Operations - Applications - Evaluating arithmetic expressions- Conversion of Infix to postfix expression - Queue ADT – Operations - Circular Queue – Priority Queue - applications of queues
Tree ADT – tree traversals - Binary Tree ADT – expression trees – applications of trees – binary search tree ADT – AVL Trees – - Heap – Applications of heap.
Definition – Representation of Graph – Types of graph - Breadth-first traversal - Depth-first traversal – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs.
Searching- Linear Search - Binary Search. Sorting - Bubble sort - Selection sort - Insertion sort - Shell sort. Hashing- Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing
Reference Book:
1.Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education,1983. 2.Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Education 3.Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to Algorithms", Second Edition, Mcgraw Hill, 2002. 4.Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, “Fundamentals of Data Structures in C”, Second Edition, University Press, 2008
Text Book:
1.Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education,1997 2.Reema Thareja, “Data Structures Using C”, Second Edition , Oxford University Press, 2011