CS8391 – NOTES & QP
| NOTES | CLICK HERE |
| SEMESTER QP | CLICK HERE |
CS8391 – SYLLABUS
UNIT I LINEAR DATA STRUCTURES — LIST
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).
UNIT II LINEAR DATA STRUCTURES — STACKS, QUEUES
Stack ADT — Operations — Applications — Evaluating arithmetic expressions- Conversion of Infix to postfix expression — Queue ADT — Operations — Circular Queue — Priority Queue — deQueue — applications of queues.
UNIT III NON LINEAR DATA STRUCTURES — TREES
Tree ADT — tree traversals — Binary Tree ADT — expression trees — applications of trees — binary search tree ADT –Threaded Binary Trees- AVL Trees — B-Tree — B+ Tree — Heap — Applications of heap.
UNIT IV NON LINEAR DATA STRUCTURES — GRAPHS
Definition — Representation of Graph — Types of graph — Breadth-first traversal — Depth-first traversal — Topological Sort — Bi-connectivity — Cut vertex — Euler circuits — Applications of graphs.
UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES
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.