Artificial Intelligence — Summer 2022

Define AI. What are the task domains of AI?

Explain Water Jug problem with Sate Space Search method.

Explain Best First Search with suitable example.

Define the following. 1. Modus Ponens 2. Horn Clause 3. Existential Quantifier

Explain Semantic Net with example.

Consider the following sentences:  Rita likes all kinds of food.  Apples are food.  Anything anyone eats and isn’t killed by is food.  Rahi eats peanuts and is still alive.  Tanvi eats everything Rahi eats. i. Translate these sentences into formulas in predicate logic. ii. Use resolution to answer the question, “What food does Tanvi eat?”

Explain Forward Reasoning and Backward Reasoning with example.

Explain Expert System Shell with example.

Explain MiniMax search procedure.

Explain Artificial Neural Network.

Draw and explain architecture of Expert System.

Show the use of Alpha-Beta pruning.

Explain Backpropagation algorithm in Neural Network.

Briefly explain any one application of Natural Language Processing.

Abag Icontains 4 white and 6 black balls while another Bag II contains white and 3 black balls. One ball is drawn at random from one of the bags, and it is found to be black. Find the probability that it was drawn from Bag I.

Explain Roulette-Wheel selection method of genetic algorithm.

Enlist and describe different phases involved in Natural Language Processing.

The task is to recognize English alphabetical characters (F, E, X, Y, I, T) in an image processing system. Define two fuzzy sets Iand Fto represent the identification of characters Iand F. I={(F, 0.4), (E, 0.3), (X, 0.1), (Y, 0.1), (I, 0.9), (T, 0.8)} F={(F, 0.99), (E, 0.8), (X, 0.1), (Y, 0.2), (I, 0.5), (T, 0.5)}1 Find the following. 1. I ∪ F 2. I− F

Describe the phases of genetic algorithm.

Explain planning problem.

Explain limitations of Hill Climbing algorithm.

Explain Cut and Fail predicates in Prolog.

Explain how planning is different from search procedure?

Compare DFS and BFS.

Write a Prolog program to merge two sequentially ordered (ascending) lists into one ordered list.