AI Series Questions
AI Series Questions
PART-B (2 x 16 = 32 Marks)
PART-A(9x2 18 Marks)
Write the pseudocode for hill-climbing search algorithm 4
2 2
2 Differentiate between prepositional versus first order logic 4
3 How does alpha beta
pruning technique works? 3 2
4 What do you mean by Manhattan distance 2 2 3
5 List out the limitations in
the knowledge base
using propositional logic to represent 2 3
6 Define physical composition
2 3
State in your own words about the successor state axioms
2 2
Define situation calculus
2 1
9 Define generalized events and
sub-events 2 1 3
PART-B (2 x 16 32 Marks)
10a ) Describe A* search and give the proof of optimality of A* 16 2 2
search strategy
(OR)
10b ) Deseribe alpha-beta search algorithm with example. 16 3 2
PART-B 2 16 32 Marks)
10a i) Explain in detail about Reinforcement learning with neat 16 2
sketch
OR)
10b i) Write short notes on the following 16 4
a) Inductive learning (8)
b) Ensemble techniques (8)