Vous êtes sur la page 1sur 2

.

KRISHNA INSTITUTE OF TECHNOLOGY, KANPUR


A
B.Tech – CSE 4th YEAR
CLASS TEST III (Odd Semester) , 2018-19 Maximizing ply
ARTIFICIAL INTELLIGENCE (NCS 702)

Time: 1:30 Hours Max. Marks: 20 B C D

SECTION – A ( -2) (5)


Attempt all parts. (1.5 x 4= 6 Marks) Minimizing ply

Ques 1. Define procedural knowledge with the help of an example. E


F
Ques 2. Write any three inference rules used in propositional logic.


Ques 3. Determine whether the following PL formula is satisfiable, Maximizing ply

valid or invalid : ( p  q)  r  q
G H I J
Ques 4. What are various components of predicate logic?
(5) (6) (7) (8)
SECTION – B
Ques 7. Given the following sentences, Prove their validity using inference
Attempt all parts
rules of propositional logic.
(i) Either Smith attended the meeting or Smith was not invited in
Ques 5. What is problem reduction technique? Explain the AO* search
meeting.
algorithm .In the graph given below explain when will the search terminate (ii) If directors wanted Smith in meeting then Smith was invited in me.
with AO* if F is expanded next and its successor is node A. Give the steps of (iii)Smith didn’t attended the meeting.
searching also. ( 5 Marks) (iv) If director’s didn’t want Smith in meeting and Smith was not invited
A to meeting, then Smith is on his way out of the company.
( 3 marks)

B Ques 8. Define the term logic. Compare Propositional logic with First order
D logic (Predicate Calculus). Also define logical implication and Causal
(50) (30) (13)
C Implication with a suitable example. (3 Marks)
(15)
(OR)

E Convert the following statements to first order predicate logic:


F
(35) (13)
(i) Sue eats everything Bill eats.
Ques 6. Define alpha beta pruning technique in game playing theory ? (ii) If x and y are both greater than zero , so is the product of
Perform alpha beta pruning search in the following game tree and x and y.
Determine the winning path and its cost: ( 3 Marks) (iii) Any student who does not study does not pass.