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 –application of trees- Binary Search Tree ADT – AVL Trees – Heap-Applications of heap.
Graph Definition – Representation of Graphs – 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:
A.V.Aho,J.E.Hopcroft and J.D.ullman,"Data Structures and Algorithms",Pearson Education,2nd Edition,2007[Unit IV] A.M.Tenenbaum,Y.Langsam and M.J.Augenstein,"Data Structures using C",Pearson Education,1st Edition,2003[UNIT I,II,V]
Text Book:
Mark Allen Weiss ,”Data Structures and Algorithm Analysis in C”, Pearson,2ND Edition, 1997. Reema Thareja, “Data Structures Using C”, Second Edition , Oxford University Press, 2011