Question Bank (Artificial Intelligence)

Unit1:
(1) What is AI? Explain task domains of AI.
(2) Explain: Turing test.

Unit2:
(1) Explain water jug problem.
(2) What are the requirements of a good control strategy?
(3) Define: Production system. Explain production system characteristics.
(4) Explain AI problem characteristics.
(5) Missionaries cannibals problem
(6) Solve the following crypt arithmetic (constraint satisfaction) problem:
SEND + MORE = MONEY
CROSS + ROADS = DANGER
BEST + MADE = MASER
DONALD + GERALD = ROBERT
(7) Explain BFS & DFS algorithm.
(8) Explain hill climbing algorithm.
(9) Explain the following problems and its solution: Local maxima, Plateau, Ridge
(10) Explain Best First Search algo.
(11) Explain simulated annealing algorithm. How it is differ from hill climbing?
(12) Explain A* algorithm.
(13) Explain problem reduction algorithm.
(14) Explain AO* algorithm.
(15) Explain Means-Ends Analysis.

Unit3:
(1) Define: (i) Representational Adequacy (ii) Inferential Adequacy (iii) Inferential
Efficiency (iv) Acquisitional Efficiency
(2) Explain various approaches to knowledge representation.

Unit4:
(1) Consider the following facts:
(i) Marcus was a man.
(ii) Marcus was a Pompeian.
(iii) All Pompeians were Romans.
(iv) Caesar was a ruler.
(v) All Romans were either loyal to Caesar or hated him.
(vi) Everyone is loyal to someone.
(vii) People only try to assassinate rulers they are not loyal to.
(viii) Marcus tried to assassinate Caesar.
 (ix) All men are people.
Prove using backward chaining that Marcus was not loyal to Caesar.
(2) Explain resolution algorithm. Consider the facts as in (18). Prove using resolution
that Marcus hate Caesar.
(3) Explain Unification algorithm.
(4) Consider the following sentences:
(i) John likes all kinds of food.
(ii) Apples are food.
(iii) Chicken is food.
(iv) Anything anyone eats and isn’t killed by is food.
(v) Bill eats peanuts and is still alive.
(vi) Sue eats everything Bill eats.
Prove that John likes peanuts using backward chaining and resolution.

Unit5:
(1) Explain: Procedural versus Declarative Knowledge.
(2) Explain: Forward versus Backward reasoning process.

Unit6:
(1) Explain Nonmonotonic reasoning.
(2) Explain default reasoning. (NL, DL, Abduction, Inheritance)

Unit7:
(1) Explain Baye’s theorem and Bayesian network.
(2) Differentiate Crisp logic and Fuzzy logic. Explain Fuzzy logic with example.
(3) Explain Dempster Shafer Theory.

Unit8:
(1) What is semantic net? Draw the semantic net for the following:
(i) The dog bit the mail carrier.
(ii) Every dog has bitten a mail carrier.
(iii) Every dog in town has bitten the constable.
(iv) Every dog has bitten every mail carrier.
(2) Explain Tangled Hierarchy. (Inferential Distance).

Unit9:
(1) Explain conceptual dependency.
(2) Explain Scripts.
(3) Explain CYC.

Unit10:
(1) Explain Minimax procedure with alpha beta cut.
(2) Explain components of a planning system.
(3) Explain goal stack planning.
 (4) Explain nonlinear planning.
(5) Explain hierarchical planning.

Unit11:
(1) What is underatanding? What makes it hard?
(2) Explain understanding as constraint satisfaction.

Unit12:
(1) Explain steps of NLP.
(2) Explain ATN.
(3) Explain four ways of handling sentences correctly.

Unit13:
(1) Explain hopfield network.
(2) Explain perceptron.
(3) Explain application of neural networks.
(4) Explain backpropagation network.
(5) Explain: Supervised Learning, Unsupervised Learning, Reinforce Learning,
Competitive Learning, Feed Forward network

Unit14:
(1) What is Prolog? How it is differ from other languages?
(2) Describe applications of Prolog.
(3) Explain features and limitations of Prolog.
(4) Explain cut and fail predicates in Prolog.
(5) Explain Repeat predicate with example. (Use of Recursion)
(6) Write a program for (i) Writing a list (ii) Append two lists (iii) Reverse the given list
(iv) Find last element of the list (v) Find nth element of the list.