FAQs

1. What is minimax algorithm? 2. What is alpha-beta pruning? 3. What are the elements of the minimax method? 4. What is the difference between minimax and maximin? 5.What are the characteristics of Game playing? 6.What are the different types of Game Playing? 7.What is Alpha Cut-off? 8What is Beta Cut-off? 9.Explain Big O notation for time & space complexity? 10.Why games are important?

11. Expain Search Techniques in AI? 12. Differntiate between Informed Search & Blind Search? 13. What is Heuristics? 14. What is Heuristic Function? 15. Explain State Space Search Tree? 16. Explain Best First Search Algorithm ? 17. Explain A* Algorithm ? 18. Explain 8 Puzzle Problem? 19. Distinguish between DFS and BFS? 20. How to calculate heuristic function for 8 puzzle problem?

21.What is Unification ? 22.Give the properties of Knowledge Representation System. 23.Give different steps for Resolution Refutation Proving. 24.Give rules for Unification. 25.What is mean by Universal and Existential Quantifiers?

26.Give different types of Connectives.

27. What is the use of Resolution Principle? 28.Write Steps to convert English statement into Clause Form? . 29. Explain Syntax & Semantics of Propositional Logic?

30. What is prolog? What are the elements of prolog program? 31. What is meant by Facts & Predicate?

Consider the following Knowledge Base & give the answers of following questions
parent(pete,ian). % Pete is a parent of Ian parent(ian,peter). parent(ian,lucy). parent(lou,pete). parent(lou,pauline). parent(cathy,ian). female(cathy). % Cathy is female. female(lucy). female(pauline). female(lou). male(ian). % Ian is male. male(pete). male(peter). 32. Grandparent is defined as the parent of a parent. This can be encoded in Prolog as: A. grandparent(X,Y):- parent(X,Y),parent(X,Z). B. grandparent(X,Y):- parent(X,Z),parent(Y,Z). C. grandparent(X,Z):- parent(X,Y),parent(Y,Z).

D. grandparent(X,Z):- parent(X,Y),parent(Z,Y). E. grandparent(X,Z):- parent(Z,Y),parent(Y,X). ANS-______ 33. ?- male(X), parent(X, Y). A. No B. Yes C. X=ian Y=lucy D. X=ian Y=peter E. X=pete Y=ian ANS-________ 34 Consider the following Prolog program. append([], L, L). append([H|T], L, [H|R]) :- append(T, L, R). The number of solutions for the query append(X, Y, [a, b, c, d]). (if we type ; repeatedly to obtain all the solutions) is A. 0 B. 1 C. 2 D. 5 E. 6 ANS-________ 1. The following code, defining a list processing operation, is added to the program from Question 3. op([], []). op([H|T], R) :- op(T, R1), append(R1, [H], R). The query ?- op([a, b, c], X). gives the following result: A. Yes B. No C. X = [a, a, b, b, c, c] D. X = [a, b, c] E. X = [c, b, a]

ANS-_______ 35. Formulate a query to find all children of ian.

ANS.______________________________ 36. Formulate a query to find all the people who are parents.

ANS________________________________ 37. Define a relation longer(L1, L2) that is true if, and only if, L1 is longer than L2. For example, the query ?- longer([1, 2, 3], [a, b]). should return Yes the query ?- longer([1, 3], [a, b, c]). should return No and the query ?- longer([1, 3], [a, b]). should return No The following program prvovides the required functionality longer([H|T], []). longer([H1|T1], [H2|T2]) :- longer(T1, T2). but Prolog may complain about singleton variables (for example, H1 is not used in the body of anyrule). Therefore, it is better to use anonymous variables: longer([_|_], []). longer([_|T1], [_|T2]) :- longer(T1, T2).

Alternatively, we can use the listlength relation listlength([],0). listlength([H|Tail],Len1):listlength(Tail,Len2), Len1 is Len2 + 1. Then, the solution is longer(L1, L2) :listlength(L1, Len1), listlength(L2, Len2), Len1 > Len2. 38. Write a list processing procedure twice, whose first argument is a list, and the second is a list consisting of every element in the first list written twice. For example, the query ?- twice([a, 4], X). should return X = [a, a, 4, 4] The following program privides the required functionality twice([],[]). twice([H|T], [H|[H|T1]]) :- twice(T, T1). 41.What do you mean by Non-Monotonic Logic ?
42.What is Truth Maintenance System (TMS) ? 43. What are the different types of TMS ? 44.What is JTMS ? 45.What are nodes and justifications in JTMS ? 46. Mention a few properties of JTMS. 47. Explain the difference between JTMS and ATMS .

48. What is Logic Based TMS ? How is it different from JTMS ? 49. What is Dependency Network? 50. What is IN-list & OUT-list? 51. Explain Dependency Directed Backtracking in short? 52. What is Expert System?

53. Explain advantages and disadvantages of Expert System. 54. Draw general architecture of Expert System . 55. Explain Different applications of Expert System?. 56. Explain basic characteristic of Expert System. 57. Give Difference between Expert System & problem solving system?. 58. Explain Expert Systems Shells or Inference Engine?. 59. What is Knowledge Acquisition? 60. What is Neuron?. 61. What is CASNET ?.