Addmissible hueristic

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/current-trends-technologies/search-algorithms/fundamentals-of-heuristic-search/asset-addmissible-hueristic after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment focuses on heuristic search strategies in Artificial Intelligence, specifically detailing the concept of admissible heuristics. The instructor begins by defining heuristics as a balance between exploring new possibilities and utilizing domain-specific knowledge. She then transitions to a practical example involving car prices to illustrate how admissible heuristics function as optimistic estimates that never overestimate the true cost. The lesson culminates in a formal definition of admissibility, presenting the mathematical condition required for optimality in search algorithms.

Chapters

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

    The instructor introduces the concept of heuristic search strategies, highlighting that they strike a balance between exploring new possibilities and using domain-specific knowledge. On the slide, she writes "Heuristic -> accurate information" and "Estimation [Domain knowledge]", circling the terms "Estimate" and "Domain Knowledge" to emphasize their importance. She introduces the term "Admissible heuristics" and writes "3/4/5", likely referencing a specific problem set or example values that will be used to explain the concept further.

  2. 2:00 – 5:00 02:00-05:00

    The lecture addresses a multiple-choice question regarding pattern matching before pivoting to a detailed explanation of admissible heuristics. The instructor creates a "Car Purchase" scenario, drawing a table with names (Shinang, Mahak, Preeti) and estimated prices (10 Lacs, 10.20 Lakh, 9 Lakh) against an "Actual cost" of 10.10 Lacs. She labels these estimates as h1, h2, and h3. She identifies h1 and h3 as admissible because their values are less than the actual cost, whereas h2 is not. She writes "Estimates < Actual cost" and "Admissible", circling h1 and h3. Finally, she writes "max(h1, h3)" to show how to combine admissible heuristics for a dominant estimate, emphasizing that the best heuristic is the one that provides the highest estimate without overestimating.

  3. 5:00 – 6:34 05:00-06:34

    The final section formalizes the concept with a slide titled "Conditions for optimality: Admissibility and consistency". The text defines an admissible heuristic as one that "never overestimates the cost to reach the goal" and notes they are "optimistic". The instructor writes the inequality h(n) <= h*(n) on the screen to mathematically represent this condition. She explains that straight-line distance is a classic example of an admissible heuristic because the shortest path between two points is a straight line, ensuring it cannot be an overestimate.

The video provides a comprehensive overview of admissible heuristics, moving from a theoretical definition to a practical application and finally to a formal mathematical condition. The instructor effectively uses a car pricing example to demonstrate that admissible heuristics must always be less than or equal to the actual cost, ensuring they are optimistic. By showing how to select the maximum of available admissible heuristics, she illustrates a method for creating a more informed search strategy. The lesson concludes by solidifying these concepts with the standard notation h(n) <= h*(n), which is crucial for understanding the optimality conditions in A* search algorithms. This progression helps students grasp not just the definition, but the practical implications of choosing the right heuristic for problem-solving.

Loading lesson…