Prim's Algorithm

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/NTA-UGC-NET-PAPER-2/unit-7-data-structures-and-algorithms/minimum-spanning-trees/mst-prims-algo/asset-prims-algorithm after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Course Overview: About the Course
  2. Paper - 1 | Unit - 1 | Teaching Aptitude: शिक्षण की अवधारणा एवं उद्देश्य / Concept and Objectives of Teaching, शिक्षण के स्तर / Levels of Teaching, शिक्षार्थी की विशेषताएँ / Learner's Characteristics, अधिगम: प्रकृति एवं सिद्धांत / Learning: Nature and Theories, संज्ञान, स्मृति एवं अधिसंज्ञान / Cognition, Memory and Metacognition, शिक्षण को प्रभावित करने वाले कारक / Factors Affecting Teaching, प्रभावी शिक्षण एवं शिक्षक / Effective Teaching and the Teacher, अनुदेशनात्मक उद्देश्य एवं पाठ नियोजन / Instructional Objectives and Lesson Planning, शिक्षण विधियाँ / Methods of Teaching, ऑफ़लाइन एवं ऑनलाइन शिक्षण विधियाँ / Offline and Online Teaching Methods, शिक्षण सहायक प्रणाली / Teaching Support System, मूल्यांकन प्रणाली / Evaluation Systems, Sāṃkhya / सांख्य, व्यक्तिगत व्यवहार / Individual Behaviour, मानव संसाधन प्रबंधन / Human Resource Management, बाल्यावस्था में विकास के क्षेत्र / Domains of Child Development, संवेग का जैविक आधार / Biological Basis of Emotion, Upanishads and Bhagavad Gita / उपनिषद और भगवद्गीता, केन्द्रीय और परिधीय तंत्रिका तंत्र / Central and Peripheral Nervous Systems
  3. Paper - 1 | Unit - 2 | Research Aptitude: अनुसंधान: अर्थ, लक्षण व वैज्ञानिक विधि / Research: Meaning, Features and Scientific Method, अनुसंधान के प्रतिमान एवं उपागम / Research Paradigms and Approaches, अनुसंधान के प्रकार / Types of Research, चर एवं मापन / Variables and Measurement, अनुसंधान की विधियाँ / Methods of Research, अनुसंधान के चरण / Steps of Research, प्रतिचयन / Sampling, आँकड़ा संग्रह के उपकरण एवं विधियाँ / Tools and Methods of Data Collection, आँकड़ा विश्लेषण एवं शोध सांख्यिकी / Data Analysis and Statistics in Research, शोध-प्रबंध एवं लेख लेखन / Thesis and Article Writing, अनुसंधान में ICT का अनुप्रयोग / Application of ICT in Research, शोध नैतिकता / Research Ethics
  4. Paper - 1 | Unit - 3 | Comprehension: प्रत्यक्ष बोध / Literal Comprehension, गद्यांश में शब्दावली और भाषा / Vocabulary and Language in Context, निष्कर्षात्मक बोध / Inferential Comprehension, आलोचनात्मक बोध / Critical Comprehension, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Restoration and Eighteenth-Century Drama, Modern British Fiction, William Shakespeare, Mid-Twentieth-Century and Contemporary British Fiction, American Drama
  5. Paper - 1 | Unit - 4 | Communication: संचार: अर्थ, प्रकृति एवं प्रक्रिया / Communication: Meaning, Nature and Process, संचार के प्रकार एवं स्तर / Types and Levels of Communication, मौखिक एवं अमौखिक संचार / Verbal and Non-verbal Communication, संकेत विज्ञान एवं अर्थ / Semiotics and Meaning, संचार के मॉडल एवं सिद्धांत / Models and Theories of Communication, प्रभावी संचार / Effective Communication, संचार की बाधाएँ / Barriers to Communication, कक्षा संचार / Classroom Communication, जनसंचार माध्यम: प्रकार एवं विकास / Mass Media: Types and Evolution, जनसंचार एवं समाज / Mass Media and Society, डिजिटल एवं नव माध्यम / Digital and New Media, Static General Knowledge, Morphology and Syntax, जन स्वास्थ्य पोषण / Public Health Nutrition, Newtonian Motion and Stability, GK- Current Affairs, Indian Economy, Art and Architecture, India after Independence
  6. Paper - 1 | Unit - 5 | Mathematical Reasoning and Aptitude: संख्या पद्धति एवं सरलीकरण / Number System and Simplification, बीजगणित एवं आयु / Algebra and Ages, प्रतिशतता / Percentage, अनुपात, समानुपात, साझेदारी एवं मिश्रण / Ratio, Proportion, Partnership and Mixtures, औसत / Averages, लाभ, हानि एवं बट्टा / Profit, Loss and Discount, साधारण एवं चक्रवृद्धि ब्याज / Simple and Compound Interest, समय एवं कार्य / Time and Work, चाल, समय एवं दूरी / Speed, Time and Distance, क्षेत्रमिति एवं ज्यामिति / Mensuration and Geometry, श्रेणी / Series, कूटलेखन-कूटवाचन / Coding-Decoding, संबंध, दिशा एवं क्रम / Relationships, Directions and Ranking, व्यवस्था, पहेलियाँ, घड़ी एवं कैलेंडर / Arrangements, Puzzles, Clock and Calendar, Mathematical Foundations, Polity, जीवनी, Deconstruction, Gender and Queer Theory, Modern British and Irish Poetry, Central Force and Scattering, Chemical thermodynamics, Microscopic techniques, संविधान का दर्शन / Philosophy of the Constitution, Waves, Optics and Charged-Particle Motion, Membrane structure and function, Analysis
  7. Paper - 1 | Unit - 6 | Logical Reasoning: युक्ति की संरचना / Structure of Arguments, पद, परिभाषा एवं भाषा के उपयोग / Terms, Definitions and Uses of Language, निरुपाधिक प्रतिज्ञप्तियाँ / Categorical Propositions, निरुपाधिक न्यायवाक्य / Categorical Syllogism, वेन आरेख / Venn Diagrams, निगमन, आगमन एवं सादृश्यता / Deduction, Induction and Analogy, तर्कदोष / Fallacies, भारतीय तर्कशास्त्र: प्रमाण / Indian Logic: Pramanas, अनुमान एवं व्याप्ति / Anumana and Vyapti, हेत्वाभास / Hetvabhasa, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Aristotle, पाश्चात्य दर्शन की विचारधाराएँ / Western Schools of Philosophy, Kant, Sadhana Paada, Vaiśeṣika / वैशेषिक
  8. Paper - 1 | Unit - 7 | Data Interpretation: आँकड़े एवं आलेखीय निरूपण / Data and Graphical Representation, आँकड़ा निर्वचन: तालिका / Data Interpretation: Tables
  9. Paper - 1 | Unit - 8 | Information and Communication Technology: Computer Fundamentals and Hardware, Memory, Storage and Data Representation, Computer Software, Office Applications, Multimedia and File Formats, Computer Networks, Internet and World Wide Web, Email and Online Communication, Cyber Security, Digital Ethics, IPR and Society, Cloud and Distributed Computing, Emerging Technologies, ICT in Education and Governance, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Electronic Data Interchange and E-Commerce, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Emerging Technologies, Terms & Abbreviations, Society, Law & Ethics, Keyboard Shortcuts, Website, Browser & Services, भौगोलिक संकेतों का संरक्षण / Protection of Geographical Indications
  10. Paper - 1 | Unit - 9 | People Development and Environment: पारितंत्र और जैव विविधता / Ecosystems and Biodiversity, मानव और पर्यावरण की अंतःक्रिया / Human and Environment Interaction, विकास और पर्यावरण / Development and Environment, प्राकृतिक संसाधन: वन, जल और मृदा / Natural Resources – Forests, Water and Soil, ऊर्जा संसाधन / Energy Resources, वायु प्रदूषण / Air Pollution, जल प्रदूषण और उपचार / Water Pollution and Treatment, ध्वनि प्रदूषण / Noise Pollution, अपशिष्ट प्रबंधन / Waste Management, पर्यावरणीय स्वास्थ्य और विषविज्ञान / Environmental Health and Toxicology, जलवायु परिवर्तन और वैश्विक पर्यावरणीय समस्याएँ / Climate Change and Global Environmental Issues, प्राकृतिक प्रकोप और आपदा प्रबंधन / Natural Hazards and Disaster Management, भारतीय पर्यावरण कानून और नीतियाँ / Indian Environmental Laws and Policies, अंतर्राष्ट्रीय पर्यावरण समझौते / International Environmental Agreements, Environment, Geography, कारखाना और उद्योग व्यवस्थाएँ / Factory and Industry Systems, Earth Materials, Surface Features and Processes, संक्रामक रोग और प्रतिरक्षण / Communicable Diseases and Immunization
  11. Paper - 1 | Unit - 10 | Higher Education System: प्राचीन भारत में शिक्षा / Education in Ancient India, प्राचीन भारत के उच्च शिक्षा केंद्र / Ancient Centres of Higher Learning, औपनिवेशिक काल की शिक्षा नीतियाँ और आयोग / Colonial Education Policies and Commissions, औपनिवेशिक कॉलेज, विश्वविद्यालय व सुधारक / Colonial Colleges, Universities and Reformers, स्वतंत्र भारत में शिक्षा आयोग और नीतियाँ / Education Commissions and Policies after Independence, राष्ट्रीय शिक्षा नीति 2020 / National Education Policy 2020, उच्च शिक्षा संस्थानों के प्रकार / Types of Higher Education Institutions, अधिगम कार्यक्रम और अकादमिक क्रेडिट / Learning Programmes and Academic Credits, व्यावसायिक, तकनीकी और कौशल आधारित शिक्षा / Professional, Technical and Skill-Based Education, मूल्य शिक्षा और पर्यावरण शिक्षा / Value Education and Environmental Education, शासन, प्रशासन और वित्तपोषण / Governance, Administration and Financing, उच्च शिक्षा का नियमन, प्रत्यायन और रैंकिंग / Regulation, Accreditation and Ranking
  12. Paper 2 | Unit 1 | Discrete Structures and Optimization: Propositional and Predicate Logic, Set Theory, Relations, Functions, क्रमचय, संचय एवं प्रायिकता / Permutation, Combination and Probability, Graph Theory, Group Theory, Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Optimization, Markov Chains
  13. Paper 2 | Unit 2 | Computer System Architecture: Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Basics of COA, Register Transfer and Microoperations, Programming the Basic Computer, Instr Formats & Modes, Control Unit Design, Pipelining, Input Output Organisation, Cache Memory Organization, Multiprocessors
  14. Paper 2 | Unit 3 | Programming Languages and Computer Graphics: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, HTML Basics, XML, JavaScript-Basics, Java, Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java
  15. Paper 2 | Unit 4 | Database Management Systems: 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  16. Paper 2 | Unit 5 | System Software and Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  17. Paper 2 | Unit 6 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  18. Paper 2 | Unit 7 | Data Structures and Algorithms: 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
  19. Paper 2 | Unit 8 | Theory of Computation and Compilers: 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
  20. Paper 2 | Unit 9 | Data Communication and Computer Networks: 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, Mobile Technology, Cloud Computing and IoT, Cloud Computing, Mobile Computing
  21. Paper 2 | Unit 10 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  22. Live Classes: NTA UGC NET 2025 Live Class
  23. Paper 1 | Full Mock Tests:
  24. Paper 2 | Full Mock Tests:
  25. Paper 1 | Previous Year Papers:
  26. Paper 2 | Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video introduces Prim's Algorithm for finding the Minimum Spanning Tree (MST) of a weighted undirected graph. The lecture begins with a brief biography of Robert Clay Prim, the algorithm's namesake. The instructor then presents the pseudocode for the algorithm, highlighting its greedy nature. The core of the video is a detailed, step-by-step execution of the algorithm on a sample graph with 7 vertices (a through g) and weighted edges. The instructor uses a table to track the key (minimum weight to connect to the MST) and pi (parent vertex) for each node. He demonstrates the initialization phase, the selection of the minimum key vertex, and the relaxation of adjacent vertices. The process continues until all vertices are included in the MST, culminating in a visual representation of the final tree.

Chapters

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

    The video opens with a slide introducing Robert Clay Prim, an American mathematician and computer scientist born in 1921. The instructor explains that Prim's Algorithm is a greedy algorithm used to find the Minimum Spanning Tree. He displays the pseudocode for Minimum_Spanning_Tree (G, W, R). The code initializes key[u] to infinity and pi[u] to NIL for all vertices. It sets key[r] to 0 for the root and initializes a priority queue Q with all vertices. The instructor then draws a table with columns for vertices a, b, c, d, e, f, g to track the algorithm's state. He fills the initial row with infinity for keys and NIL for parents, setting the key for the starting vertex 'a' to 0. This sets the stage for the iterative process where vertices are added to the MST one by one.

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

    The instructor begins the main loop of the algorithm. He selects vertex 'a' (key=0) as the starting point and extracts it from the queue. He examines neighbors 'b' and 'c'. The edge weight to 'b' is 5, so key[b] becomes 5 and pi[b] becomes 'a'. The edge weight to 'c' is 3, so key[c] becomes 3 and pi[c] becomes 'a'. Next, he selects 'c' (key=3) as the minimum. He updates neighbors 'b', 'd', and 'f'. The edge c-b (weight 4) is better than the current key of 'b' (5), so key[b] updates to 4 and pi[b] to 'c'. Edge c-d (weight 5) updates key[d] to 5. Edge c-f (weight 6) updates key[f] to 6. Then, 'b' (key=4) is selected. Its neighbor 'e' (weight 2) updates key[e] to 2. Finally, 'e' (key=2) is selected, updating neighbors 'f' (weight 3) and 'g' (weight 5). The table is updated at each step to reflect these changes, showing the dynamic nature of the priority queue.

  3. 5:00 – 8:32 05:00-08:32

    The algorithm continues with the remaining vertices. The current minimum key is 'f' (key=3). The instructor extracts 'f' and checks its neighbors. The edge f-g (weight 4) is better than the current key of 'g' (5), so key[g] updates to 4 and pi[g] becomes 'f'. Next, 'd' (key=5) is selected, but its neighbors are already in the MST or have better keys. Then 'g' (key=4) is selected. The queue becomes empty, and the algorithm terminates. The instructor summarizes the final pi array to identify the edges of the MST: (a,c), (c,b), (c,d), (b,e), (e,f), (f,g). He draws these edges on the graph to visualize the final Minimum Spanning Tree, confirming the total weight calculation. The visual reinforcement on the graph helps students understand the final structure of the MST. The final tree connects all vertices with the minimum possible total edge weight.

The lecture effectively demonstrates the mechanics of Prim's Algorithm through a concrete example. By maintaining a priority queue of vertices based on their minimum edge weight to the growing tree, the algorithm ensures optimality. The step-by-step table updates clarify how the key and pi values change, illustrating the greedy choice property where the locally optimal choice leads to a globally optimal solution. The visual reinforcement on the graph helps students understand the final structure of the MST. This method is crucial for network design problems where minimizing cost is essential. The instructor's clear explanation of the relaxation step is particularly helpful for understanding how the algorithm avoids cycles and ensures connectivity.

Loading lesson…