Greedy alogrithims

Duration: 1 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/algorithms/shortest-path-algos/bellman-ford-algo/asset-greedy-alogrithims after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | Compiler Design: 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video features an educational segment focused on algorithm classification, specifically distinguishing between Greedy algorithms and Dynamic Programming approaches within the context of computer science. The central visual is a multiple-choice question displayed on a white background with orange text. The question asks: "Which of the following standard algorithms is not a Greedy algorithm?" Five distinct options are listed vertically: (A) Dijkstra's shortest path algorithm, (B) Prim's algorithm, (C) Kruskal algorithm, (D) Huffman Coding, and (E) Bellmen Ford Shortest path algorithm. The instructor proceeds to analyze each option sequentially to determine its classification. He begins with option (A), underlining the text "Dijkstra's shortest path algorithm" and writing the word "Greedy" in parentheses next to it to classify it as a greedy approach. He moves to option (B), "Prim's algorithm," underlining it and similarly annotating it as "Greedy." Next, he addresses option (C), "Kruskal algorithm," underlining the text and adding the "(Greedy)" label to confirm its nature. He continues to option (D), "Huffman Coding," underlining it and marking it as "Greedy" as well. Finally, he examines option (E), "Bellmen Ford Shortest path algorithm." He underlines this text and writes "(Dynamic)" next to it, indicating it belongs to the Dynamic Programming category rather than Greedy. Below this option, he writes mathematical notation "(n-1) . n^2", likely referring to the time complexity or the number of relaxation steps involved in the algorithm. This systematic elimination process highlights the classification of standard algorithms used in computer science courses, clearly identifying Bellman-Ford as the exception among the choices provided.

Chapters

  1. 0:00 – 0:59 00:00-00:59

    The video presents a multiple-choice question asking to identify the non-greedy algorithm. The instructor systematically evaluates options (A) through (D), underlining Dijkstra's, Prim's, Kruskal's, and Huffman Coding, and writing "(Greedy)" next to each. He then focuses on option (E), Bellman Ford Shortest path algorithm, underlining it and writing "(Dynamic)" to classify it as Dynamic Programming. He also writes "(n-1) . n^2" below this option, likely indicating its time complexity or relaxation steps, effectively distinguishing it from the greedy algorithms listed above.

The lesson progresses from identifying standard greedy algorithms like Dijkstra, Prim, Kruskal, and Huffman to contrasting them with Bellman-Ford, which is classified as a Dynamic Programming algorithm based on its relaxation steps and complexity.

Loading lesson…