Artificial Intelligence and Neural Network
III B Tech CSE, Sem II
1. Define Algorithm. With suitable example define Best first search Algorithm [5]
2. Compare between Greedy Best first search algorithm and A* Algorithm [5]
3.a. What is the condition for admissibility of A* Search Algorithm? [2]
b. What is resolution? Explain resolution refutation [3]
4. Define min-max procedure in Game playing and explain about alpha- beta pruning [5]
5. Define FOL, Explain the terms Literals, clauses. What are the rules of Inference? [5]
6.write the predicate calculus fot the statement [5]
“In every city there is thief who is beaten be every policemen in the city”’
