Scribd
Upload
134 views3 pages

AI Question Bank

Uploaded by

mrunalk2021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
134 views3 pages

AI Question Bank

Uploaded by

mrunalk2021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1. List any two applications of AI.

a. x ∀ : student (x) ⇒ smart (x)


2. Translate the following FOL(first-order-logic) statement into English.

3. State the types of supervised learning.


4. Write heuristic function used in A* algorithm.
5. What is time complexity of best first search?
6. What is heuristic search?
7. Describe state space search.
8. Define Search Strategy.
9. What is Predicate Logic.
10. Explain any two problem characteristics with example .
11. State any two approaches for knowledge representation.
12. What is propositional logic?
13. Define “local maximum” that is reached when you apply hill climbing search.
14. What are the disadvantages of depth first search algorithm?
15. State any two limitations of semantic networks.
16. Comment “The minimax search procedure is a depth first, depth limited search
procedure”. List the criteria to measure the performance of different search
strategies.
17. Define “Platue” in terms of hill climbing search .
18. What is Knowledge representation? State techniques of Knowledge
representation.
19. Differentiate between Uninformed and informed searching.
20. What is state space search in AI? Write function for state
space.
21. Explain generate and test algorithm.
22. What is Game tree.
23. Discuss why alpha beta pruning is used over MINIMAX algorithm .
24. Write a short note on SMA* algorithm.
25. Explain AO* algorithm. Comment on the significance of using the OR graphs for this
type of search.
26. Explain backward chaining with example.
27. Represent the following using semantic nets “Every batsman hit the ball”.
28. Explain best first search.
29. Explain A* algorithm with example.
30. Write short note on game theory.
31. Given an initial state of a 8-puzzle problem and final state to be reached:
32. Solve above problem by calculating heuristic value.
33. Perform the Uniform Cost Search algorithm on the following graph with path costs and
mention its applications.
34. Consider the following 3 FOPL statements. Using resolution prove FIDO WILL
DIE.

35. Write short note on Semantic knowledge representation.


36. Explain in detail Limitations of game search algorithms.
37. Prove that,(P->Q) ^ (Q->P) is tautology or contradiction(Use Propositional Logic.

38. Differentiate between Breadth First Search and Depth First Search.
39. Find the best move for MAX player using minimax procedure & perform left-to-right
alpha-beta pruning on the tree indicate where cut-offs occur.

40. What is Rule of Inference. State and explain any two types of inference rules.
41. Convert given axioms in FOL and prove that Scrooge is not a child. ,
a) Every child loves Santa.
b) Everyone who loves Santa loves any reindeer.
c) Rudolph is a reindeer, and Rudolph has a red nose.
d) Anything which has a red nose is weird or is a clown.
e) No reindeer is a clown.
f) Scrooge does not love anything which is weird.
(Conclusion) Scrooge is not a child.
42. Write state space representation of water jug problem. We have 2 jugs of water of size 4L
& 2L resp. We want 2ltr. water in 4ltr. jug.

You might also like