April 2022
April 2022
:
P814 [5870] - 1135
[Total No. of Pages : 2
Q1) a) Explain Alpha - Beta Tree search and cutoff procedure in deatil with
example. [9]
b) What are the issues that need to be addressed for solving esp efficiently?
Explain the solutions to them. [9]
OR
Q2) a) Explain in detail the concepts of back tracking and constraint propagation
and solve the N-queen problem using these algorithms. [9]
b) Write a short note on Monte Carlo Tree search and list its limitations. [5]
Q3) a) List the inference rules used in prepositional logic? Explain them in detail
with suitable example. [9]
b) Explain syntax and semantics of First Order Logic in detail. [8]
OR
Q4) a) Detail the algorithm for deciding entailment in prepositional logic. [8]
OR
OR
Q8) a) Explain the terms for time and schedule from perspective of temporal
planning. [9]
b) Write a detailed note on AI Architecture. [8]
[5870] - 1135 2