2019(2)

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/programming/shortest-path-algos/dijkstras-algorithm/asset-20192-9947 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 presents a multiple-choice question from the GATE 2019 exam about Dijkstra's algorithm. The instructor analyzes each of the four options to determine which statement is not true. He confirms that options (A), (B), and (D) are true: Dijkstra's algorithm can find the shortest path within the same graph data structure, it always selects the node with the smallest known distance, and it requires non-negative edge weights. He then focuses on option (C), which states that the shortest path always passes through the least number of vertices. To disprove this, he draws a graph with vertices S, A, B, C, and D, and demonstrates that the shortest path from S to D (S->A->B->D with a total cost of 8) is not the path with the fewest vertices (S->C->D with a cost of 9). This counterexample shows that the shortest path is based on minimizing total weight, not the number of vertices, making (C) the correct answer to the question.

Chapters

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

    The video begins with a question displayed on screen: 'When using Dijkstra's algorithm to find shortest path in a graph, which of the following statement is not true? (NET 2019 DEC)'. The four options are listed: (A) It can find shortest path within the same graph data structure, (B) Every time a new node is visited, we choose the node with smallest known distance/cost to visit first, (C) Shortest path always passes through least number of vertices, and (D) The graph needs to have a non-negative weight on every edge. The instructor, visible in the bottom right, begins to analyze the options. He marks (A) as true, explaining that the algorithm operates on the graph itself. He marks (B) as true, stating that the core of Dijkstra's algorithm is to always pick the node with the minimum distance. He then marks (D) as true, noting that negative weights can cause the algorithm to fail. He then focuses on option (C), which he identifies as the incorrect statement, and begins to explain why.

  2. 2:00 – 2:38 02:00-02:38

    The instructor draws a graph on the screen to provide a counterexample for option (C). The graph has vertices S, A, B, C, and D. The edges are S->A (weight 1), A->B (weight 1), B->D (weight 6), S->C (weight 2), and C->D (weight 7). He calculates the cost of the path S->A->B->D as 1+1+6=8. He calculates the cost of the path S->C->D as 2+7=9. He concludes that the shortest path from S to D is S->A->B->D, which has 3 vertices (A, B, D). The path S->C->D has only 2 vertices (C, D), which is fewer. Since the shortest path does not pass through the least number of vertices, the statement in (C) is false. He marks (C) as 'false' and confirms it is the correct answer to the question.

The video systematically evaluates four statements about Dijkstra's algorithm. It confirms that the algorithm operates on the same graph, always selects the node with the minimum known distance, and requires non-negative edge weights. The key insight is that the algorithm's goal is to minimize the total path weight, not the number of vertices. The instructor uses a clear counterexample to demonstrate that a path with a lower total weight can have more vertices than a path with a higher total weight, thereby proving that the shortest path does not necessarily pass through the least number of vertices. This logical disproof identifies (C) as the only false statement.

Loading lesson…