Kruskal Algo Part-2

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/programming/minimum-spanning-trees/mst-kruskals-algo/asset-kruskal-algo-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Pipe and Cistern, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Cubes & Dices, Number System, Powers, Surds and Logarithms, Mathematical Operations, Simplification and Approximation, Percentages, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Transformation of Shapes, Signal Space and Optimum Detection, Alphabet and Word Tests, Syllogisms and Venn Diagrams, Analogy and Classification, Mensuration, Constraint Puzzles, Patterns in Two-Dimensional Figures, Three-Dimensional Patterns and Visualization, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Numerical Reasoning, Assembling and Grouping of Shapes, Coding and Decoding, Cubes and Dice, Series Completion, Direction Sense, Logical Deduction and Induction, Order, Ranking and Sequence, Clocks and Calendars, Critical Reasoning, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Algebra, Data Interpretation, Time and Work, Probability, Speed, Time and Distance, Statistics, Data Sufficiency, Trigonometry, Differential Calculus, Blood Relations, Mixture and Alligation, Speed Time and Distance, Combinatorics
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes, Semiconductor Memories and Programmable Logic
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a detailed lecture on Kruskal's algorithm for finding the Minimum Spanning Tree (MST) of a graph. The instructor begins by presenting the pseudocode, explaining the initialization of disjoint sets for each vertex and the sorting of edges by weight. He then demonstrates the algorithm step-by-step on a sample graph, visually adding edges in increasing order of weight while using the Union-Find data structure to avoid cycles. The lecture concludes with a summary of the greedy nature of the algorithm and the final return statement.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video starts with the pseudocode for Minimum_Spanning_Tree (G, w). The instructor explains the initialization phase where the set A is initialized to empty (A <- phi). He then explains the loop For each vertex v in V(G) do Make_Set(v), emphasizing that initially, every vertex is in its own disjoint set. He underlines the sorting step: Sort the edges of E into non-decreasing order by weight w. He also underlines for each edge (u, v) in E, indicating the iteration over sorted edges. The instructor uses a red pen to underline key phrases on the screen to draw attention to the algorithm's structure.

  2. 2:00 – 5:00 02:00-05:00

    The instructor moves to the core logic of the algorithm. He underlines the condition if (Find_Set(u) != Find_Set(v)). He explains that if the two vertices of an edge belong to different sets, the edge is added to the MST (A <- A U {(u, v)}) and the sets are merged (UNION (u, v)). He then demonstrates this on the graph shown on the right. He starts by identifying the edge with the minimum weight, which is (b, e) with weight 2, and draws a red zig-zag line on it. Next, he considers edges with weight 3, adding (a, c) and (e, f) with red zig-zags. He proceeds to weight 4, adding (b, c) and (f, g). He crosses out edges that would form cycles, such as (a, b) with weight 5, because 'a' and 'b' are already connected. He continues this process, crossing out edges with weight 5 like (e, g) if they form cycles, but actually adds (c, d) with weight 5 to connect vertex 'd'. He crosses out edges with weight 6 like (b, d), (c, f), (d, e), and (d, f) as they would create cycles. The visual demonstration clearly shows the construction of the MST step-by-step.

  3. 5:00 – 5:43 05:00-05:43

    The instructor concludes the lecture by pointing to the final line of the pseudocode, Return A. He explains that the algorithm returns the set of edges A which constitutes the Minimum Spanning Tree. He summarizes that Kruskal's algorithm is a greedy algorithm that builds the MST by adding the cheapest edge that doesn't form a cycle. He reiterates the importance of the Union-Find data structure in efficiently checking for cycles. The video ends with the instructor looking at the camera, having completed the explanation of the algorithm.

The lecture systematically breaks down Kruskal's algorithm, starting with the theoretical pseudocode and moving to a practical visual demonstration. The instructor emphasizes the greedy strategy of selecting edges by weight and using Union-Find to prevent cycles. The visual aids, including red zig-zags for added edges and crosses for rejected edges, effectively illustrate the algorithm's execution on a sample graph, culminating in the final Minimum Spanning Tree.

Loading lesson…