AI Assignment 2 2024 25

Date:4/10/2024
M.G.M’s COLLEGE OF ENGINEERING, NANDED

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Practice Questions Bank-II
BTCOC701: ARTIFICIAL INTELLIGENCE
B. TECH CSE I & II
Q.
No Question CO
BT LEVEL
. Achieved
1 Which environment is used for adversarial search problems? CO1 Understand
2 Why we use evaluation functions in adversarial search? CO1 Analyze
3 When should one use adversarial search? CO1 Understand
4 What is Minimax strategy? CO1 Remember
5 What is Alpha Beta pruning in AI? Explain with example. Remember
CO2
6 Which search is implemented with an empty first in first out queue? Remember
CO2
7 What is the complexity of Minimax algorithm? Is Minimax always optimal? Remember
CO2
8 Illustrate Alpha Beta pruning with example. CO2 Understand
9 Explain the algorithm of A Simple Knowledge-Based Agent with example. CO3 Understand
10 List out the agent requirements. CO3
Understand
11 Give the Mapping between Facts and Representations with example. CO3
Remember
12 What are the Approaches to Represent the knowledge ? CO3

Remember
13 Write the steps of Property inheritance algorithm . CO3

Remember
14 What are the issues that arise in the process of Knowledge Representation ? CO3
Understand
15 How to represent simple fact in knowledge illustrate with example. CO3

Understand
16 Represent the Instance and ISA Relationship with three way of representing class Understand
membership . CO3
17 i) Let P(x, y) be the statement "student x has taken class y:’ where the domain for x Apply
consists of all students in your class and for y consists of all computer science courses
at your school. Express each of these quantifications in English.
a. ∃x∃y P (x, y)
CO3
b. ∃x∀y P (x, y)
c. ∀x∃y P (x, y)
d. ∃y∀x P (x, y)
e. ∀y∃x P (x, y)
f. ∀x∀y P (x, y)
ii) Let C(x, y) mean that student x is enrolled in class y, where the domain for x
consists of all students in your school and the domain for y consists of all classes
being given at your school. Express each of these statements by a simple English
sentence.
a. C(Randy Goldberg,CS 252)
b. ∃xC(x, Math 695)
c. ∃yC(Carol Sitea, y)
d. ∃x(C(x, Math 222) ∧C(x, CS 252))
e. ∃x∃y∀z((x6=y)∧(C(x, z)→C(y, z)))
f. ∃x∃y∀z((x6=y)∧(C(x, z)↔C(y, z)))
ii) Question 10 Let F(x, y) be the statement "x can fool y," where the domain consists
of all people in the world. Use quantifiers to express each of these statements.
a. Everybody can fool Fred.
b. Evelyn can fool everybody.
c. Everybody can fool somebody.
d. There is no one who can fool everybody.
e. Everyone can be fooled by somebody.
f. No one can fool both Fred and Jerry.
18 i)Write algorithm for Convert to clause form. Remember
ii) Write algorithm for Propositional Resolution.

CO3
iii) Write algorithm for Resolution.
iv) Write algorithm for Unify(L1,L2).
19 What is Natural Deduction .Illustrate with suitable example.

CO3
Remember
20 Which of the following are correct? CO3 Apply
j. (A ∨B)∧ ￢(A ⇒B)
k. (A ⇔B) ∧(￢A ∨B)
l. (A ⇔B) ⇔C has the same number of models as (A ⇔B) for any fixed set of
proposition symbols that includes A, B, C.
21 Apply
CO3
22 Explain with example Procedural versus Declarative Knowledge. Write PROLOG Apply
representation for logic given below.
CO3
23 I) Explain Forward Versus backward reasoning with suitable example. CO3

Understand
II) Explain which kind of matching between the current state and the preconditions of the
Rules.
III) Explain Control Knowledge with example.
24 Write rule for Equivalence, Validity, Satisfiability. CO3 Remember
25 Differentiate Forward Chaining vs. Backward Chaining. CO3 Apply
26 Suppose you are given the following axioms: Apply
1. 0 ≤3.
2. 7 ≤9.
3. ∀x x≤x.
4. ∀x x≤x + 0.
5. ∀x x+ 0 ≤x.
6. ∀x, y x + y ≤y + x. CO3
7. ∀w, x, y, z w ≤y ∧x ≤z ⇒w + x ≤y + z.
8. ∀x, y, z x ≤y ∧y ≤z ⇒x ≤z
a. Give a backward-chaining proof of the sentence 7 ≤3 + 9. (Be sure, of course, to use
only the axioms given here, not anything else you may know about arithmetic.) Show
only the steps that leads to success, not the irrelevant steps.
b. Give a forward-chaining proof of the sentence 7 ≤3 + 9. Again, show only the steps
that lead to success.
27 The following Prolog code defines a predicate P. (Remember that uppercase terms are Apply
variables, not constants, in Prolog.)
P(X,[X|Y]).
P(X,[Y|Z]) :- P(X,Z). CO2
a. Show proof trees and solutions for the queries P(A,[2,1,3])and P(2,[1,A,3]).
b. What standard list operation does P represent?
28 Prove Using Resolution Understand
1. John likes peanuts.
2. Sue eats peanuts.
3. Sue eats apples.
4. What does Sue eat?
• Translate to Sue eats X
• Result is a valid binding for X in the proof
Prove Using Resolution:
1. Tom likes bananas. CO3

2. Alice eats bananas.
3. Alice eats oranges.
4. What does Alice eat?
5. Bob drinks water.
6. Sarah drinks juice.
7. Sarah drinks water.
8. What does Sarah drink?
Ms. Nitu L. Pariyal

Ms. Nikita S. Pande
Subject-Incharge

AI Assignment 2 2024 25

Uploaded by

Copyright:

Available Formats

AI Assignment 2 2024 25

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

AI Assignment 2 2024 25

Uploaded by

Copyright:

Available Formats

Date:4/10/2024

M.G.M’s COLLEGE OF ENGINEERING, NANDED

12 What are the Approaches to Represent the knowledge ? CO3

13 Write the steps of Property inheritance algorithm . CO3

15 How to represent simple fact in knowledge illustrate with example. CO3

a. C(Randy Goldberg,CS 252)

b. ∃xC(x, Math 695)

d. ∃x(C(x, Math 222) ∧C(x, CS 252))

e. ∃x∃y∀z((x6=y)∧(C(x, z)→C(y, z)))

f. ∃x∃y∀z((x6=y)∧(C(x, z)↔C(y, z)))

a. Everybody can fool Fred.

b. Evelyn can fool everybody.

c. Everybody can fool somebody.

d. There is no one who can fool everybody.

e. Everyone can be fooled by somebody.

f. No one can fool both Fred and Jerry.

18 i)Write algorithm for Convert to clause form. Remember

ii) Write algorithm for Propositional Resolution.

iv) Write algorithm for Unify(L1,L2).

19 What is Natural Deduction .Illustrate with suitable example.

23 I) Explain Forward Versus backward reasoning with suitable example. CO3

Prove Using Resolution:

1. Tom likes bananas. CO3

Ms. Nitu L. Pariyal

You might also like