Data Structure

Notes of data structure for computer science engineering & MCA.Learn Data Structure app is for engineering student BE, B-Tech,M-Tech,MCA,BCA,MS to learn data structure in easy way. it cover almost all topics given below.
Introduction: Basic Terminology, Elementary Data Organization, Structure operations, AlgorithmComplexity and Time-Space trade-off.Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, addresscalculation, application of arrays, Character String in C, Character string operation, Array as Parameters,Ordered List, Sparse Matrices and Vectors.Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, ArrayRepresentation of Stack, Linked Representation of Stack, Operations Associated with Stacks, Applicationof stack: Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression usingstack., Applications of recursion in problems like ‘Tower of Hanoi’.

Queues: Array and linked representation and implementation of queues, Operations on Queue: Create,Add, Delete, Full and Empty, Circular queues, D-queues and Priority Queues.Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversingand Searching of Linked List, Overflow and Underflow, Insertion and deletion to/from Linked Lists,Insertion and deletion Algorithms, Doubly linked list, Linked List in Array, Polynomial representation andaddition, Generalized linked list, Garbage Collection and Compaction.

Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, CompleteBinary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binarytrees, Threaded Binary trees, Traversing Threaded Binary trees, Huffman algorithm.Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, HashFunctions, Collision Resolution Strategies, Hash Table Implementation.

Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Two Way Merge Sort, Heap Sort, Sorting on DifferentKeys, Practical consideration for Internal Sorting.Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of SearchAlgorithm, Path Length, AVL Trees, B-trees.

Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, SequentialRepresentations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees,Minimum Cost Spanning Trees.File Structures: Physical Storage Media File Organization, Organization of records into Blocks,Sequential Files, Indexing and Hashing, Primary indices, Secondary indices, B+ Tree index Files, B Treeindex Files, Indexing and Hashing Comparisons.