Greedy BFS

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/ai-machine-learning-big-data-cloud/search-algorithms/best-first-search/asset-greedy-bfs 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, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, 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, Inequality, Data Sufficiency, Cubes & Dices
  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
  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 lecture introduces Greedy Best-first Search, defining it as an algorithm that always attempts to continue with the node that seems closest to the goal. The instructor distinguishes this from A* search by writing the evaluation function f(n) = h(n), indicating it relies solely on the heuristic. A diagram with nodes A, B, C, and D illustrates a scenario where the search might fail to find the best path. The lecture explicitly states that Greedy Best-first Search is neither optimal nor complete, similar to Depth-First Search. The session concludes by listing the algorithm's properties: it is not complete due to potential loops (e.g., Iasi -> Neamt -> Iasi), has a time complexity of O(b^m), a space complexity of O(b^m) because it keeps all nodes in memory, and is not optimal, demonstrated by a path cost comparison where the found path cost 450 versus an optimal cost of 418.

Chapters

  1. 0:00 – 1:38 00:00-01:38

    The video begins by defining Greedy Best-first Search as prioritizing nodes closest to the goal, writing the formula f(n) = h(n) to show it ignores path cost. A diagram with nodes A, B, C, and D illustrates a graph where the search might get stuck or take a longer route, leading to the text stating the method is 'not optimal' and 'not complete.' The instructor underlines these key limitations. The slide then transitions to a list of properties, detailing that the algorithm is not complete because it can get stuck in loops like Iasi -> Neamt -> Iasi. It lists time complexity as O(b^m) and space complexity as O(b^m), noting that a good heuristic can improve time but space remains high. Finally, it confirms the algorithm is not optimal, providing a specific example where a found path cost 450, while a better path (Arad to Bucharest) cost 418.

The lesson progresses from a conceptual definition of Greedy Best-first Search to its practical limitations and formal properties. By comparing it to A* and using a visual graph, the instructor highlights why relying solely on the heuristic h(n) leads to suboptimal solutions and potential infinite loops. The final slide consolidates these findings into standard search algorithm metrics (completeness, time, space, optimality), providing specific numerical examples to reinforce the theoretical claims.

Loading lesson…