DIjakstra algorithim and bellaman ford Practice questions
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 conceptual question regarding shortest paths in weighted graphs. The central problem asks whether doubling the weight of every edge in a graph preserves the identity of the shortest path from a source to any destination, altering only the total weight. The instructor analyzes this by first reading the problem statement and underlining critical conditions. He then constructs a specific directed graph with four vertices (A, B, C, D) and assigns positive integer weights to the edges. Through step-by-step calculation, he compares the total weights of different paths before and after the modification to verify if the minimum weight path remains unchanged.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the problem statement: "Given a graph, suppose we have calculated shortest path from a source to all other vertices. If we modify the graph such that weights of all edges is becomes double of the original weight, then the shortest path remains same only the total weight of path changes." He underlines phrases like "shortest path from a source to all other vertices" and "weights of all edges is becomes double" to focus attention. To test the validity of this statement, he begins drawing a graph on the whiteboard. He sketches four nodes labeled A, B, C, and D. He draws directed edges from A to B with weight 2, A to C with weight 3, B to D with weight 5, and C to D with weight 7. This visual setup serves as a concrete test case for the question.
2:00 – 4:14 02:00-04:14
The instructor proceeds to calculate the shortest paths for the drawn graph. Initially, he computes the path from A to D. He identifies two possible paths: A->B->D with total weight 2+5=7, and A->C->D with total weight 3+7=10. Since 7 is less than 10, the shortest path is A->B->D. Next, he applies the modification: doubling all edge weights. The new weights become 4, 6, 10, and 14. He recalculates the path sums: A->B->D becomes 4+10=14, and A->C->D becomes 6+14=20. He observes that 14 is still less than 20, meaning the shortest path A->B->D remains the same. He generalizes this observation by writing inequalities showing that if w1 <= w2, then 2w1 <= 2w2. Consequently, he concludes the statement is valid and selects option (A) True.
The lecture demonstrates a fundamental property of shortest path algorithms: scaling all edge weights by a positive constant factor does not change the shortest path structure. By using a concrete example where path weights are compared before and after doubling, the instructor proves that the relative order of path costs is preserved. This confirms that the shortest path remains the same, validating the statement. The mathematical generalization provided at the end solidifies the understanding that scalar multiplication maintains inequality relationships between path sums.

