single source shortest path practice question
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- DBMS: 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
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video addresses a theoretical question in graph theory concerning the stability of shortest paths under uniform weight modification. The instructor begins by presenting the problem statement displayed on the screen: "If we increase weight of every edge by 1, the shortest path always remains same." He asks if this statement is true or false. To investigate this, he constructs a counterexample on the whiteboard. He writes "ex." and draws a graph with a source node 'S' on the left and a destination node 't' on the right. He creates two distinct paths between them. The first path, S -> A -> B -> C -> D -> t, consists of 5 edges with weights 2, 4, 5, 6, and 7 respectively, drawn in the upper section. The second path, S -> E -> t, consists of 2 edges with weights 10 and 15, drawn in the lower section.
Initially, the total weight of the first path is calculated as 2 + 4 + 5 + 6 + 7 = 24. The total weight of the second path is 10 + 15 = 25. Since 24 is less than 25, the first path is the shortest path. The instructor then applies the condition of the problem: increasing every edge weight by 1. The new weights for the first path become 3, 5, 6, 7, and 8, summing to 29. The new weights for the second path become 11 and 16, summing to 27. Comparing the new totals, 27 is now less than 29. This demonstrates that the shortest path has shifted from the first path to the second path. Consequently, the instructor concludes that the statement is false, marking "No" as the correct answer. He circles the "No" option to emphasize the conclusion.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the problem statement regarding shortest paths and edge weight modification. He begins drawing a graph with source 'S' and destination 't', creating a multi-edge path S->A->B->C->D->t and a two-edge path S->E->t. He writes down the initial weights for each edge: 2, 4, 5, 6, 7 for the first path and 10, 15 for the second.
2:00 – 4:21 02:00-04:21
The instructor calculates the initial total weights (24 vs 25) to establish the baseline shortest path. He then applies the transformation of adding 1 to every edge weight. He writes the new weights (3, 5, 6, 7, 8 and 11, 16) and calculates the new totals (29 vs 27). He demonstrates that the path with fewer edges becomes shorter, proving the statement false and selecting option (B) No.
The lesson demonstrates a critical property of shortest path algorithms: they are sensitive to uniform weight shifts if paths have different numbers of edges. By adding a constant to every edge, paths with more edges accumulate a larger total increase than paths with fewer edges. This example highlights that shortest paths are not invariant under such transformations, a key concept for understanding algorithm behavior in weighted graphs.

