DSA Lec 12 || Graphs Traversal ~ BFS and DFS | Connected Components and Spanning Tree | MST

Unit-1 Introduction Basic data structures such as arrays, linked list, stack, trees, queues and their applications, linked and sequential representation Basic Terminology, Elementary Data organization, Data Structure operations. Preliminaries of algorithm, Algorithm analysis and complexity. Stack Implementation of stack, operations on stack. Applications of stack: Conversion of o infix-expressions to prefix and postfix expressions, evaluation of postfix expression. express Unit-2 Queues Implementation of queues, Operations on Queue, Types of Queues - Circular queue, Dequeue and Priority Queue. Linked List Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, insertion and deletion to/from Linked Lists, insertion and deletion Algorithms, Doubly linked list, Header lists, circular lists, sorted lists Unit-3 Trees Basic terminology and definitions. Array and Linked Representation of Binary trees, Traversing Binary trees. Binary Search Trees: Binary Search Tree (BST), Traversal, Insertion and Deletion in BST, and Introduction to balanced BST (AVL Trees) Unit-4 Searching: Sequential search, binary search, comparison and analysis. Sorting Insertion Sort, Bubble Sort, Quick Sort, Two-Way-Merge Sort, Heap Sort, Sorting on Different Keys, Practical consideration for internal Sorting. Unit-5 Graphs Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees