Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list implementation – Singly linked lists – Circularly linked lists – Doubly-linked lists – Applications of lists
Stack ADT – Array and Linked list implementation of Stack Operations – Balancing Symbols – Infix to Postfix conversion – Evaluating arithmetic expressions - Function Calls – Queue ADT – Array and Linked list implementation of Queue Operations – Circular Queue – Applications of Stack and Queues in Operating systems.
Tree ADT – Tree Traversals – Binary Tree ADT – Expression trees – Binary Search Tree ADT – Balanced Binary Trees - AVL Trees – Priority Queue (Heaps) – Binary Heap
B-Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of Graph – Graph Traversal techniques - Breadth-first traversal – Depth-first traversal –– Bi-connectivity and its Real-world applications – Euler circuits – Topological Sort – Dijkstra’s algorithm – Minimum Spanning Tree – Prim’s algorithm – Kruskal’s algorithm – Applications of graphs in Networking
Searching – Linear Search – Binary Search – Sorting – Bubble sort – Quick sort – Insertion sort –Merge Sort – Hashing – Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing
Reference Book:
1 A.V.Aho, J.E.Hopcroft and J.D.Ullman,“Data Structures and Algorithmsâ€, Pearson Education, 2ndEdition, 2007 2 A.M.Tenenbaum, Y.Langsam and M.J.Augenstein, “Data Structures using Câ€, Pearson Education, 1st Edition, 2003 3 Reema Thareja, “Data Structures Using Câ€, Oxford Second Edition, 2014 4 Sahni Horowitz, “Fundamentals of Data Structures in Câ€, Universities Press; Second edition2008 5 Noel Kalicharan, “Data structures in Câ€, Create Space Independent Publishing Platform;1st Edition 2008
Text Book:
M.A. Weiss, “Data Structures and Algorithm Analysis in Câ€, Pearson Education, 8th Edition,2007
