[PDF] CS8391 Data Structures (DS) 2017 Regulation Syllabus, Notes and Question Banks/Important Questions for Anna University Students

Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation––singly linked lists- circularly linked lists- doubly-linked lists – applications of lists –PolynomialManipulation – All operations (Insertion, Deletion, Merge, Traversal).

Stack ADT – Operations - Applications - Evaluating arithmetic expressions- Conversion of Infix topostfix expression - Queue ADT – Operations - Circular Queue – Priority Queue - deQueue –applications of queues.

Tree ADT – tree traversals - Binary Tree ADT – expression trees – applications of trees – binarysearch tree ADT –Threaded Binary Trees- AVL Trees – B-Tree - B+ Tree - Heap – Applications ofheap.

Definition – Representation of Graph – Types of graph - Breadth-first traversal - Depth-firsttraversal – Topological Sort – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs.

Searching- Linear Search - Binary Search. Sorting - Bubble sort - Selection sort - Insertion sort -Shell sort – Radix sort. Hashing- Hash Functions – Separate Chaining – Open Addressing –Rehashing – Extendible Hashing.