Data Structures |
Data Structures SyllabusUnit –1 Simple Linear Data Structure Array Representation of Linear Arrays in Memory, Traversing Linear Array, Inserting and Deleting, Searching: Linear and Binary, Sorting : Bubble, Selection, Insertion, Quick, Merge, Heap. Polynomial Addition, Representation of Multidimensional Array in memory, Representation of Sparse Matrices and its Transpose Algorithm. Unit-2 Linear Linked List Singly Linked List: Representation in Memory, Traversing, Searching, Memory Allocation, Garbage Collection, Insertion into a linked list, Deletion from a linked list, Header Linked List, Polynomial Addition, Circular Linked List, Operations on Doubly Linked List : traversing, Searching, Deleting, Inserting. Unit-3 Stack, Queue and Recursion Stacks: Array Representation, Linked Representation, Arithmetic Expression, Polish Notation, Recursion, Towers of Hanoi, Queues: Array Representation, Circular Queues, Linked Representation, D-Queues, Priority Queues. Unit-4 Non-Linear Data Structure Graphs Binary Tress, Representation of binary Trees in Memory, Traversing binary trees, Traversal algorithm using stacks, Header nodes, Threads, Binary search trees, Searching, Inserting and Deleting in a binary search trees, AVL search tree, Insertion and Deletion in an AVL search Tree, m-way search tree, Searching Insertion and Deletion in an m-way search tree, Searching, Insertion and Deletion in a B- tree. Unit-5 Non-Linear Data Structure Graphs Graph theory terminology, Sequential Representation of Graphs, Adjancy Matrix, Path Matrix, Warshall’s algorithm, Shortest Paths, Linked Representation of a Graph, Operations on Graph, Traversing on Graphs, Posets, Topological Sorting. |