QUESTION BANK
Artificial Intelligence
Short Questions:
1. What is a AI?
2. What are goals of AI?
3. What are types of AI
4. What is Weak and strong AI
5. What are agents
6. What is rationality
7. What is an ideal rational agent?
8. What is an environment
9. What are properties of Search Algorithm.
10. What are the types of uninformed search?
11. What is difference between uninformed and informed search.
12. What is uniform cost search.
13. What is Heuristics function.
14. What are the features of hill climbing algorithm?
15. What is the local maximum and global maximum?
16. Define agent, rational agent and agent program.
17. What do you mean by local maxima with respect to search technique?
18. List out some of the applications of Artificial Intelligence.
19. Mention the criteria for the evaluation of search strategy.
20. Differentiate BFS & DFS.
21. With a suitable example explain multiple-connected graph.
22. What are the different types of planning?
23. List out the different types of induction heuristics?
24. Define an inference procedure.
25. What is the basic difference between A* and AO* algorithm?
26. What is futility cutoff in game playing?
27. Differentiate between Declarative and Procedural representation of knowledge.
28. State the significance of using Heuristic functions.
29. What do you mean by local maxima with respect to search technique?
30. What are the differences and similarities between Problem Solving and Planning?
31. ‘Minimax is not good for game playing when the opponent is not playing optimally.’ Justify
using suitable example.
32. When and why Nonmonotonic Reasoning is used?
33. Distinguish between Supervised learning and Unsupervised learning.
34. What is Blocks World Problem?
35. What is STRIPS?
36. What is planning in AI?
Descriptive Questions:
1. Write the advantages and disadvantages of AI
2. Describe any three applications of AI
3. Describe simple rational agent and Goal based agents.
4. Describe properties of Environment.
5. Describe types of search algorithm.
6. Describe DFS and BFS algorithm with their advantages and disadvantages.
7. Describe uniformed cost search with advantages and disadvantages.
8. Explain Greedy search algorithm with examples
9. Explain A* search algorithm with examples
10. Describe simple hill climb algorithm with example.
11. Describe mean-end analysis algorithm with examples
12. Describe Constraint satisfaction problem with examples.
13. What are the disadvantages of Steepest Hill Climbing Search Procedure? Using a suitable
search tree, illustrate that these drawbacks are eliminated in Best First Search.
14. Briefly explain about semantic network with its advantages and disadvantages. Construct a
semantic net representation for the following. -Ram gives Lucy a gift -Every dog has bitten a
mail carrier.
15. Using a suitable example, illustrate the steps of A* search. Why is A* search better than
Best-First Search?
16. Describe the Minimax algorithm for searching game tree. Explain the effect of the addition
of alpha-beta cutoffs to this search algorithm.
17. Write a short note on Natural Language Processing.
18. Draw and Explain the Architecture of the Expert System.
19. What are the different types of grammar used in Natural Language Processing? Explain each
with examples.
20. Assume the following facts 1.Ram likes only easy courses. 2. Engg. Courses are hard. 3.All
courses in Arts are easy. 4. AR04 is an Arts course. Use Resolution to answer the question,
“What courses would Ram like?”
21. Explain Forward and Backward Reasoning with the help of examples.
22. Explain about knowledge acquisition.
23. Explain the basic components of a heuristic systems
24. What are the different types of learning? Explain with suitable example.
25. How facts are represented using prepositional logic? give an example.
26. "As per the law, it is a crime for an American to sell weapons to hostile nations.
Country A, an enemy of America, has some missiles, and all the missiles were sold to it by
Robert, who is an American citizen."
Prove that "Robert is a criminal."
Explain the solution with forward chaining techniques.
27. Translate the following sentences into FOL.
a. Everything is bitter or sweet
b. Either everything is bitter or everything is sweet
c. There is somebody who is loved by everyone
d. Nobody is loved by no one
e. If someone is noisy, everybody is annoyed
f. Frogs are green.
g. Frogs are not green.
h. No frog is green.
i. Some frogs are not green.
j. A mechanic likes Bob.
k. A mechanic likes herself.
l. Every mechanic likes Bob.
m. Some mechanic likes every nurse.
n. There is a mechanic who is liked by every nurse.
28. What is Goal Stack Planning? Explain with one example.
29. A cryptography problem: In the following pattern
SEND
MORE
=========
MONEY
we have to replace each letter by a distinct digit so that the resulting sum is correct.
30. Explain different techniques used in statistical NLP.
