Data Structures and Algorithms in 'C' Notes in Hindi for M.Sc.(c.s.) 2nd Semester Makhanlal University
Topics -
Introduction to Data Structures, Abstract Data Types Stacks - Introduction to Stack & Primitive Operation on Stack, Stack’s Applications - Infix, Postfix & Prefix Expressions, Recursion, Multiple Stacks Queues -Introduction to Queues, Primitive Operations on Queues, Circular Queue, Dequeue, Priority Queue, Linked List - Introduction to Linked List, Memory Representation of Linked List, Operations on Linked List, Linked List Representation of Stack and Queue, Header Nodes. Types of Linked List - Doubly Linked List, Circular Linked List, Application of Linked List, Trees - Basic Terminology of Trees, Binary Trees, Tree Representations as Array & Linked List. Binary Tree Representation. Traversal of Binary trees - Inorder, Preorder & Postorder, Application of Binary Tree, Threaded Binary Tree, Balanced tree, AVL tree, B-tree, Analysis of Algorithm, Complexity with Big’O’ Notation. Searching - Sequential Search, Binary Search and their Comparison. Sorting - External & Internal Sorting, Insertion Sort, Selection Sort, Quick Sort, Bubble Sort, Heap Sort, Comparison of Sorting Methods. Hashing, Collision Resolution Techniques, Graphs - Introduction to Graphs, Basic Terminology, Directed, Undirected & Weighted Graph, Representation of Graphs, Warshall’s Algorithem for Path Matrix, Graph Traversals - Depth First & Breadth First Search. Spanning Trees, Minimum Spanning Tree, The Basic Greedy Strategy for Computing, Algorithm of Kruskal and Prim. Applications of Graphs : Shortest Path Problem using Dijkstra Method etc.
Click Here To Download
0 comments:
Post a Comment