Gyanmanjari Institute of Technology

Department of Information Technology

Artificial Intelligence (3161608)
Question Bank

UNIT 1: What is AI?

1. What is Intelligence? Discuss types of problems requiring Intelligence to solve it. Define AI.
2. What is artificial intelligence? Define the different task domains of artificial intelligence.
3. Discuss the AI Problem Characteristics in detail.
4. What is Artificial Intelligence? List task of AI.
5. Discuss various areas where Artificial Intelligence is used.
6. What are the AI problem characteristics? Discuss in detail with example.

UNIT 2: Problems, State Space Search & Heuristic Search Techniques

7. Explain depth first search (DFS) and breadth first search (BFS) with suitable examples.
8. Why is “depth limited search” necessary in DFS?
9. Explain the State Space with the use of 8 Puzzle Problem.
10. What do you mean by state space representation of a problem? Illustrate how you can
represent following water jug problem as a state space search: There are two jugs (without
any measuring marks on them) of 4 and 3 liters capacity, respectively. There is a tap of water
to fill the jugs. The objective is to fill the 4-liter jug with exactly 2 liter of water.
11. What is production system? Explain it with an example. Discuss the characteristics of a
production system.
12. Solve The following Crypt arithmetic problem:

13. Explain the Best-First-Search Procedure with example.

14. What do you mean by constraint satisfaction problems? Explain constraint propagation
algorithm using suitable example.

Heuristic Search Techniques

15. What do you mean by the problem of plateau occurring in hill climbing? How can it be
solved?
16. What is local maximum, Plateau and Ridge?
17. Explain A* algorithm in detail.
18. What do you mean by admissibility of an algorithm? Is A* algorithm an admissible one?
When?
19. What is hill climbing? Explain Simple Hill Climbing and Steepest- Ascent Hill Climbing.
20. Explain AND-OR graphs.
21. Explain different issues in designing of search problems.
22. Explain mean-end analysis approach to solve AI problems.
23. Explain simulated annealing algorithm.
24. State problem characteristics with example.
25. Explain different heuristics for block world problem.
26.Consider the following initial and goal states of 8 puzzle problem. Draw the search tree.
Apply A* algorithm to reach from initial to goal state and show the solution. Consider
Manhattan distance as a heuristic function.(i.e. sum of distance that tiles are out of place).

1 2 3
7 8 4
6 2

Initial state

1 2 3
8 4
7 6 5

Goal state

23 ....... with suitable heuristic function.

1 2
3 4 5
6 7 8

Initial state

1 2 3
8 4
7 6 5

Goal state
1.

UNIT 3: Logic Agents / first order logic & UNIT 4: Inference in First Order Logic

1. Differentiate between declarative and procedural representation of knowledge.

2. Explain the different approaches to knowledge representation.
3. Explain different knowledge representation issues in detail.
4. Explain KBS.
5. Explain PEAS properties in wampus world and its working.
6. Explain different approaches of knowledge representation.
7. Differentiate between instance ad isa relationship with example.
8. Differentiate predicate and fact in Prolog programming.
9. Explain issues of knowledge representation.
10. Explain why it is necessary to choose granularity for knowledge representation.
11. Briefly discuss declarative and procedural knowledge.
12. Explain dreawbacks of propositional logic.
13. Explain the algorithm of predicate logic resolution.
14. Differentiate propositional logic and predicate logic.
15. Translate these sentences into formulas in predicate logic.
1. John likes all kinds of food.
2. Apples are food.
3. Chicken is food.
4. Anything anyone eats and isn’t killed-by is food.
5. Bill eats peanuts and is still alive.
6. Sue eats everything Bill eats.
Convert the formulas derived in to clauses. Prove that John likes peanuts using resolution.
Using the formulas derived in prove John likes peanuts using forward chaining as well as
backward chaining.

16. Consider the following sentences and Answer a, b, c given below:

1. Rama likes all kinds of vegetarian food.
2. Oranges are food.
3. Mutton is food.
4. Anything anyone eats and is not killed by is food.
5. Like x eats peanuts and is still alive.
6. Love x eats everything Like x eats.
(a) Translate these sentences into formulas in Predicate Logic.
(b) Prove that Rama likes peanuts using Backward Chaining.
(c) Prove Rama likes peanuts using Resolution.

17. Consider the following sentences:

• Prince is a mega star.
• Mega stars are rich.
• Rich people have fast cars.
• Fast cars consume a lot of petrol.
I. Translate these sentences into formulas in predicate logic.
ii. Prove that Prince's car consumes a lot of petrol.

18. Assume the following facts:

• Steve only likes easy courses.
• Science courses are hard.
• All the courses in the basketweaving department are easy.
• BK301 is a basketweaving course.
Use Resolution to answer the question, “What Course would Steve like?”
19. Explain forward and backword chaining.
20. Explain monotonic and non monotonic reasoning . explain their properties.
 21. Define term in the context of AI: Logical reasoning.
22. State the purpose of unification in predicate logic.
23. Write inference using Full Joint Distributions with example.
24. Translate following sentences to predicate logic and prove that John likes peanuts using backward
chaining.
1. John like all kinds of food.
2. Bill eats peanuts and is still alive.
3. Apples are food.
4. Sue eats everything Bill eats
5. Chicken is food.
6. Anything anyone eats and isn’t killed by is food.
25. Consider the following sentences:

1. Raj likes all kinds of food.

2. Apples are food.
3. Anything anyone eats and isn’t killed by is food.
4. Sachin eats peanuts and is still alive.
5. Vinod eats everything Sachin eats.
Attempt following: i. Translate these sentences into formulas in predicate logic ii. Use resolution to answer
the question, “What food does Vinod eat?

UNIT 5: Uncertainity

1. Explain the Bay’s theorem.

2. Explain the process of inference using full joint distribution.
3. Explain uncertainity in deatails.

UNIT 6: probabilistic reasoning

4. Explain the Bayesian Networks.

5. Describe any one conflict resolution approach used in rule based systems.
6. Explain Probability and Bay s Theorem.
1.What is Semantic Nets? Consider the following statements and draw the semantic net:
Tom is a cat.
Tom caught a bird.
Tom is owned by John.
Tom is ginger in color.
Cats like cream.
The cat sat on the mat.
A cat is a mammal.
 A bird is an animal.
All mammals are animals.
Mammals have fur.
7. Represent following sentence using semantic net: `Sita gave the pearl garland to Hanuman.‟
8. Construct the partitioned semantic net representations for the following: • Every batter hit a
ball. • All the batters like the pitcher.
9. Explain probabilistic inference in Bayesian network with the help of suitable example.
10. Discuss Bayesian network and its applications.
11.Differentiate fuzzy logic and crisp logic. Also describe set operations on fuzzy and crisp
logic.
12. Explain difference between Boolean and fuzzy set membership using a suitable example.
13.What is the importance of fuzzy logic? How do you perform union , intersection and
complement operation on fuzzy sets?
14.Write inference using Full Joint Distributions with example.

UNIT 7: Game playing: overview, example domain

15. Explain Goal Stack planning using suitable example.

16. Explain the Minimax Procedure with example.
17. Explain the Alpha-Beta Cutoffs Procedure in Game Playing.
18.Consider the game tree of Fig. 1 in which the static scores are from first player‟s point of
view. Suppose the first player is maximizing player. Applying mini-max search, show the
backed-up values in the tree. What move will the MAX choose? If the nodes are expanded
from left to right, what nodes would not be visited using alpha-beta pruning

19. Explain various planning techniques.

20. Write algorithms for TWEAK and STRIPS.
21. Explain goal stack planning with suitable example.
22. Write a short note on hopefield network.
23. Explain non linear planning using constraint posting with example.

24.Consider the game tree given below, in which the evaluation function values are shown
below each leaf node for the max player. Assume that the root node corresponds to the
minimizing player. Assume that the search always visits children left-to-right. Compare the
backup values computed b the minimax algorithm by writing values at the appropriate nodes
in the tree given.

4 4 4 4 4 4 4

UNIT 8: Statistical learning methods

25. What is mean by percepton? Give one example.

26. Define epoch with respect to ANN.
27. Enlist some applications of neural network.
28. What do you understand by classification in neural network? Briefly explain percepton
algorithm and also narrate its limitations.
29. Explain feedforward and recurrent nueral netwok.
30. Explain back propogation process with its algorithm.
31. How statistical learning method differes from reinforcement learning method.

UNIT 9: Introduction to Prolog

1. What are the Applications, Features and Limitations of Prolog?
2. Justify using an example that Prolog uses Backward chaining to prove or answer any given
goal.
3. What is Red Cut and Green Cut in Prolog?
4. Write a prolog program to reverse the given list.
5. Checking membership of an item in a given list, concatenating two lists, and deleting an n
item in a given list.

6. Write a prolog program to find factorial of a given number.

7. Explain how list is used in Prolog.
8. Demonstrate the use of Repeat Predicate in Prolog with example.
9. Write a prolog program to solve Tower of Hanoi Problem.
10. Demonstrate the use of Cut and Fail Predicates in Prolog with example.
11. Write a prolog program to count vowels in a list of characters.
12. Write a prolog program to find the sum of elements of a List.
13. Write following Prolog programs:
1. To copy one list to another list.
2. To check whether given number is odd or even.
14. What will be the output of following Prolog program if program is called with test(10,2)? Also explain
the reason of your output.
test(X,Y):-write('Hello'),X>=Y,!.
test(X,Y):-write('Hi'),X<Y.
15. Write following Prolog programs:
• To find the greatest variable among the three variables.
• To count odd and even elements from a list.
16. Write following prolog programs:
i. To find the factorial of a positive integer number.
ii. To find the nth element of a given list.