Artificial Intelligence — Winter 2021

What is a “control strategy” and what are its characteristics?

Describe in brief how Min-Max search procedure works.

Enlist and discuss major task domains of Artificial Intelligence.

Discuss briefly backward reasoning with example. 0

Explain with example how recursive predicate is defined in Prolog?

State Water Jug problem. Give its state space representation

Explain A* algorithm. What happens if h’ underestimates h and overestimates h?

Explain local maxima, plateau and ridge in brief

Discuss the approaches to knowledge representation

Demonstrate briefly the steps to convert given wff into clause form

Differentiate Informed & Uninformed search. Give examples.

Explain best first search algorithm.

Consider the following facts: * Hemant only likes easy courses. * Science courses are hard. * All the courses in basketweaving department are easy. * BK301 is a basketweaving course. Use resolution to answer the question,”What course would Hemant like?”

What is certainty factor?

Discuss Bayesian network and its application.

Explain connectionist models. What is perceptron? What is the concept of back propagation for ANNs?

What do you mean by Expert Systems? List out its four applications.

Discuss Goal Stack planning

Write about various defuzzification methods

Discuss cut and fail predicate in prolog

Describe working principle of Genetic Algorithm

What is nonmonotonic reasoning? Explain logics for nonmonotonic reasoning.

Write a prolog program to append two given lists into third

List out the genetic operators. Describe them briefly

Write a note on Natural Language Processing1