Basic
AI systems always give correct answers.
false
A search algorithm is said to have this property if it is guaranteed to find a solution whenever one exists.
What is completeness?
In a knowledge-based agent, which component contains the domain-specific facts and rules about the world?
The Knowledge Base (KB)
This type of function guides hill climbing by assigning a value to each state.
Evaluation or objective function
A system that uses knowledge to reason and make decisions is called this
KBA
The world in which an agent operates, encompassing everything it can perceive and act upon.
What is an environment?
AI can only work when it's connected to the internet.
NO
In DFS, what problem occurs if the search goes too deep?
It may get stuck in deep branches or infinite loops.
What is the primary purpose of the 'TELL' operation in a knowledge-based agent?
Agents tells the KB what it perceived from the environment.
Expert systems use which two main components?
✅ What are: Knowledge base and inference engine.
An AI agent is designed to trade stocks. The stock market is constantly changing due to other traders' actions, and the agent's actions can also influence the market. How would you classify this environment?
Dynamic and Multi-agent
The Turing Test checks if a computer can win a chess match.
False? (It checks for human-like conversation.)
A Hill Climbing algorithm is navigating a state space where it encounters a flat area of equal value, from which no upward move is possible. What is this specific problem called?
A Plateau
A simple 'Generate and Test' algorithm is tasked with solving an anagram. Why is this approach often called a 'brute-force' method?
Because it systematically generates and checks every single possible permutation of letters until the correct word is found.
A self-driving car's knowledge base includes the fact that 'wet roads are slippery' and the rule 'IF roads are slippery THEN increase following distance'. This represents which two primary facets of knowledge?
Declarative and Procedural
Hypothesis spaces are uncountably infinite
This is a property of a heuristic that ensures it never overestimates the cost, and is a prerequisite for the stronger property known as consistency.
What is admissibility?
This search algorithm balances the cost of the path already traveled with an estimated cost to the goal, ensuring optimality if its heuristic never overestimates the true cost.
A* Algorithm
A heuristic is a random guess.
❌ False? (It’s an informed guess.)
In A* search, if the heuristic function h(n) is consistently a very high, inadmissible value (it overestimates the cost), what is the likely outcome?
The search may find a sub-optimal solution, or fail to find one efficiently, because it will be misled into exploring unpromising paths.
The 'branching factor' in a state space search refers to:
The maximum or average number of successor states that can be generated from any given state.
Score
^
|
| *
| *
| *
| *
|__*___________________
can you name it
Ridge region