Ai Cat I
Ai Cat I
Ai Cat I
[2 Marks]
Intelligence is the computational part of the ability to achieve goals in the world. Varying kinds
and degrees of intelligence occur in people, animals and some machines.
2. Describe the four categories under which AI is classified with examples. [2 Marks]
4. List the fields that form the basis for AI. [2 Marks]
Manufacturing
Human resource
Marketing
Finance
Computer science- researchers have created many tools to solve the most difficult problems in computer
science. Many of their inventions have been adopted by mainstream computer science
Linguistic- communication
Biology- Human /animals brain activity
Psychology- the study of rule of reasoning
No information about the number of steps The path cost from the current state to goal state
(or) path cost from the current state to goal state is calculated, to select the minimum path cost as the
next state
12 Less effective in search method More effective
f) Bi-directional search
15. Define the logic behind – Hill climbing, Best-First Search, BFS and DFS. [2 Marks]
Hill climbing is a search technique that moves in the direction of increasing value to reach a peak state. It
terminates when it reaches a peak where no neighbor has a higher value. The Hill-climbing algorithm is
simply a loop that continually moves in the direction of increasing value –that is uphill. It terminates
when it reaches its peak where no neighbor has a higher value. The algorithm does not maintain a search
tree so the current node data structure need only record the state and its objective function value. Hill-
climbing does not look ahead beyond the immediate neighbors of the current state.
Best-first Search is a combination of depth-first and breadth-first search algorithms. Forward motion is
from the best open node so far, no matter where it is on the partially developed tree. The second step of
the algorithm changes as:
Until the queue is empty or the goal has been reached, determine if the first element in the queue
is the goal node.
If the first element is the goal do nothing.
If the first element is not the goal node remove the first element from the queue and add the first
element's children if any to the queue and sort the entire queue by estimated remaining distance.