Shree Swaminarayan Institute of Technology Semester: VII (2023)

Subject Name: Artificial Intelligence

Subject Code:3170716

Sr CHAPTER NO - 1 : What is AI: Marks

No
TOPIC:1 The AI Problems, The Underlying Assumption
DESCRIPTIVE QUESTIONS
1 What is Intelligence? Discuss types of problems requiring Intelligence to solve it. Define 05, 02,
AI. (Oct-2012) 03, 07,
What is artificial intelligence? Define the different task domains of artificial intelligence. 07, 07,
(Sep-2013) [New](June-2022) 03, 03
Enlist and discuss the major task domains of Artificial Intelligence. (Nov-2019)
Differentiate Natural & Artificial Intelligence. Explain types of problems which requires
AI techniques to be solved. (Nov-2017)
Explain AI Problems. Define and discuss different task domain of artificial intelligence.
(Nov-2018)
Define the term “Artificial Intelligence”. Explain how AI techniques improve real-world
problem solving. (Nov-2019)
What is Artificial Intelligence? List task of AI. [New](Dec-2021) [SSIT]
2 What are the Underlying Assumptions about AI? [SSIT] 04
3 List and Explain Application of AI. [SSIT] 07
4 Discuss various areas where Artificial Intelligence is used. [New](Dec-2022) [SSIT] 03
TOPIC:2 What Is An AI Techniques, The Level Of The Model, Criteria
For Success, Some General References, One Final Word
DESCRIPTIVE QUESTIONS
1 Discuss: Turing Test (Oct-2016) (Oct-2016) (May-2018) 3.5,
Explain the “Turing test”. Discuss its significance as a criteria for success of an intelligent 3.5,
machine. (May-2017) 04, 07,
Explain the “Turing test”. Discuss its importance in intelligence machine. (Nov-2019) 07, 04
What is the significance of the “Turing Test” in AI? Explain how it is performed. (Nov-
2019) [SSIT]
2 Explain AI Technique in details. [SSIT] 07
3 Explain “Intelligence Requires Knowledge”. [SSIT] 04
CHAPTER NO - 2 : Problems, State Space Search & Heuristic
Search Techniques:
TOPIC:1 Defining The Problems As A State Space Search, Production
Systems, Production Characteristics, Production System Characteristics,
And Issues In The Design Of Search Programs
DESCRIPTIVE QUESTIONS
1 Discuss State space of a problem (Oct-2016) 3.5,
What is state space of a problem? (May-2018) 03, 07
What is state space representation? Explain with an example. (May-2019) [SSIT]
2 Explain the State Space with the use of Water Jug Problem. (May-2012) 07, 07,
Explain state space representation using water jug problem. (Nov-2018) 07, 07,
What is state space representation of a problem? Show the state space of the water jug 07, 07,
problem. (April-2017) 09, 07,
What do you mean by state space representation of a problem? Illustrate how you can 07, 07,
represent following water jug problem as a state space search: There are two jugs (without 07, 07
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.
Artificial Intelligence (3161608) 2023 Page 1
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

(May-2014)
Solve Water Jug Problem using production rule system. (Nov-2014)(Nov-2017)(Oct-
2012)
Explain & Solve Water-Jug Problem. (Nov-2019) (May-2018)
Consider the Water Jug problem as stated here: “You are given two jugs, a 4- gallon one
and a 3-gallon one. Neither has any measuring markers on it. There is a pump that can be
used to fill the jugs with water. How can you get exactly 2 gallons of water into the 4-
gallon jug?” Represent this as a problem in State Space Search and state its Production
Rules. Show at least one solution to this problem. (May-2017)
For the Water Jug problem, describe state space representation, actions, start and end state.
(May-2019)
Consider the Water Jug problem stated below:
Water Jug Problem: “You are given two jugs, a 4-gallon one and a 3-gallon one. Neither
has any measuring markers on it. There is a pump that can be used to fill the jugs with
water. How can you get exactly 2 gallons of water into the 4-gallon jug? ”
Explain how this problem can be solved using State Space Search. Also, give the
Production Rules to solve this problem and derive ONE feasible solution using the same.
(Nov 2019) [SSIT]
3 Solve and suggest the appropriate strategy for the following water-jug problem. You are 04
given two jugs of capacity having 8 liters and 5 liters. There are no measuring markers on
jugs. You have to obtain exact 4 liters of water into 8 liters jug. .[New](Dec-2022) [SSIT]
4 Differentiate the DFS and BFS with merits and demerits. (May-2012) (Nov-2018) 07, 07,
Differentiate between Breadth First Search and Best First Search. (Nov-2019) 04, 07,
Explain & Compare DFS & BFS search algorithm. (Oct-2012) 07, 07,
Explain depth first search (DFS) and breadth first search (BFS) with suitable examples. 07, 07,
Why is ‘depth limited search’ necessary in DFS? (May-2014) 07, 04
Explain Depth first search and Breadth first search with example. (Nov-2014)
Given an example of a problem for which breadth-first search would work better than
depth-first search. (May-2016)(May-2018)
Describe DFS and BFS. How can they be used for searching? Give one application for
which DFS or BFS can be applied for searching the solution. (May-2019)
Compare Breath first search and Depth first search method. [New](Dec-2021) [SSIT]
5 What is depth first search? Explain algorithm and its advantages. (Sep-2013) [SSIT] 07
6 Explain Depth first search algorithm. (Nov-2018) [New](June-2022) 04, 04,
Describe Depth First Search. (May-2019)[SSIT] 04
7 Explain any problem solved using Depth First Search technique. (Nov-2017)(Nov- 07, 07
2019)[SSIT]
8 Describe Breadth First Search. Comment on the optimalality of this method. (May-2018) 04
[SSIT]
9 What are the Problem Characteristics of Artificial Intelligence? (May-2012)(Nov-2018) 07, 07,
Discuss the AI Problem Characteristics in detail. (May-2013) 07, 07,
Define AI? Explain the characteristics of AI problem. (Nov-2014) 07, 07,
How problem characteristics help in the selection of AI technique? Explain these 07, 07
characteristics with possible examples. (May-2015)
Discuss with examples: AI Problem Characteristic. (Nov-2017)
Discuss seven problem characteristics to decide appropriate A.I. technique to use for
problem solving. (May-2019)
What are the AI problem characteristics? Discuss in detail with example.[New](Dec-2022)
[SSIT]
10 Analyze (a) 8-puzzle, (b) Chess and (c) Tower of Hanoi problems with respect to the 07
following problem characteristics:(Oct-2016) [SSIT]
i. Is the problem decomposable?
ii. Can solution step be ignored?
iii. Is the good solution absolute or relative?
Artificial Intelligence (3161608) 2023 Page 2
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

iv. Is the solution state or a path?

v. What is the role of knowledge?
11 Discuss and Analyze Tower of Hanoi problem with respect to the seven problem 07
characteristics. (May-2018) [SSIT]
12 Solve 8 Puzzle problem by any AI Technique. (Oct-2012) 07, 07,
Explain the State Space with the use of 8 Puzzle Problem. (May-2013) (May-2016) 07, 07,
(May-2018) (Nov-2018) 07, 07,
Explain the State space search with the use of 8 Puzzle Problem. [New](June-2022) 07, 07,
Explain State Space Search using 8 Puzzle problem. (Nov-2017) (Nov-2019) 07, 07
What is state space representation of a problem? Show the state space of the 8 puzzle
problem. (Nov-2017)
Explain how a problem can be analyzed based on its characteristics. Analyze the game of
“8-Puzzle” based on these characteristics. (Nov-2019)[SSIT]
13 What is production system? Explain it with an example. Discuss the characteristics of a 05, 07
production system. (Sep-2013) (Nov-2018) [SSIT]
14 Explain the production system. [New](June-2022) 04
15 What is meant by “control strategy”? State the requirements of a good control strategy. 03
(Nov-2019)[SSIT]
16 Analyze following problems with respect to the 7 problem characteristics of AI. 07
i. 8-puzzle
ii. Traveling salesman(Dec-2015) [SSIT]
17 Discuss various issues in design of search program. (Nov-2017) 04, 04
Explain different issues in designing of search problems. [New](Dec-2022) [SSIT]
18 Explain what is meant by “Production System” with respect to AI. Discuss the 04
components of a Production System. (Nov-2019) [SSIT]
TOPIC:2 Additional Problems
DESCRIPTIVE QUESTIONS
1 In the Missionaries and Cannibals Problem, three missionaries and three cannibals must 07, 07,
cross a river using a boat which can carry at most two people, under the constraint that, 05
Number of cannibals should be lesser than the missionaries on either side. The boat cannot
cross the river by itself with no people on boat.
For the above mentioned problem, describe state space representation, actions, start and
end state. (May-2018) [New](Dec-2021)
Explain Missionaries and cannibals problem. [SSIT]
2 Explain Tower of Hanoi problem. [SSIT] 05
3 Solve Travelling Salesman Problem using any AI technique. (Nov-2014)(May-2016) 07, 07
[SSIT]
4 Explain Monkey and Banana problem. [SSIT] 05
TOPIC:3 Generate-And-Test, Hill Climbing, Best-First Search, Problem
Reduction, Constraint Satisfaction, Means-Ends Analysis, A* and AO*
search
DESCRIPTIVE QUESTIONS
1 What is heuristic function? Discuss with an example. (May-2019) [SSIT] 04
2 What is a heuristic? What care should you take while designing a heuristic function? 03
(Nov-2019) [SSIT]
3 Explain Generate-and-test Algorithm. [SSIT] 04
4 Explain Simple Hill Climbing. [SSIT] 04
5 What is Hill Climbing? Explain Simple Hill Climbing and Steepest- Ascent Hill Climbing. 07, 07,
(May-2016) (May-2012) (Nov-2018) (Nov-2019) 07, 07,
What is hill climbing? Explain steepest-ascent hill climbing algorithm. (Sep-2013) 07, 07,
Explain Steepest ascent Hill climbing algorithm. (Oct-2012) 03, 07,
Discuss steepest ascent hill climbing. (Nov-2017) 07
Explain the algorithm for Steepest-Ascent Hill Climbing. Briefly describe the situations in
Artificial Intelligence (3161608) 2023 Page 3
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

which hill climbing may fail to find a solution. (Nov-2019)

Discuss Steepest-Ascent Hill climbing algorithm and also state its limitations. [New]
(Dec-2021) [SSIT]
6 What do you mean by the problem of plateau occurring in hill climbing? How can it be 02
solved? (May-2014) [SSIT]
7 What is local maximum, Plateau and Ridge? (May-2013) 07, 03
Explain: 1) Local maximum 2) Plateau 3) Ridge. [New](June-2022)[SSIT]
8 Explain the method of Hill climbing. Also explain the problems associated with hill 07
climbing and possible solutions. (May-2015) [SSIT]
9 Discuss hill climbing search method. Also discuss limitations and ways to overcome these 07, 07,
limitations. (April-2017) (Dec-2015) 07, 03
Discuss limitations of Hill climbing search method. (Nov-2017)
Discuss limitation of hill-climbing method. (May-2019)[SSIT]
10 Explain the situations under which Hill Climbing may fail to find a solution. What can be 07
done to overcome these situations? (May-2017) [SSIT]
11 What is Hill Climbing algorithm? Discuss the cases where Hill climbing fails. [New](Dec- 07
2022) [SSIT]
12 Explain simulated annealing algorithm. (May-2014) (May-2018) 07, 07,
Discuss simulated annealing search method. Which types of problems are suitable to solve 07, 07,
using this method? (Dec-2015) 04, 07,
Explain Simulated Annealing search with suitable example. (Nov-2017) 07
Discuss Simulated Annealing method of search. (Nov-2017)
Discuss Simulated Annealing search method. Compare it with hill climbing method.
(May-2018) (May-2019) [SSIT]
13 Discuss Hill climbing and Simulated Annealing. State the differences between these two 07
methods. (Oct-2016) [SSIT]
14 Discuss Simulated Annealing search method. How is it different than greedy method? 07
(May-2019) [SSIT]
15 Explain OR graphs. [SSIT] 05
16 Explain A* algorithm. (Oct-2012)(Nov-2017)(Nov-2018) 07, 07,
Explain A* algorithm in detail. (Sep-2013)(May-2016)(May-2018) [New](June-2022) 07, 07,
Discuss A* algorithm. Give one example where it is suitable to apply. (Dec-2015)(Nov- 07, 07,
2019) 07, 07,
Discuss A* algorithm. Also give one example to explain it. (May-2019) [SSIT] 07, 07
17 What do you mean by admissibility of an algorithm? Is A* algorithm an admissible one? 02, 03
When? (May-2014)(Nov-2018)[SSIT]
18 Discuss A* algorithm. Compare it with hill climbing search method. (May-2019) [SSIT] 07
19 Explain AND-OR graphs. (May-2014) [New](June-2022) [SSIT] 02, 03
20 Explain Problem Reduction using “AND-OR” graph. (Nov-2019)[SSIT] 04
21 Consider the following initial and goal configuration for 8-puzzle problem. Draw the 07
search tree for initial three iterations of A* algorithm to reach from initial state to goal
state. Assume suitable heuristic function for the same. (May-2015) [SSIT]

22 Consider the following initial and goal configuration for 8-puzzle problem. Draw the 07
search tree. Apply A* algorithm to reach from initial state to goal state and show the
solution. Consider Manhattan distance as a heuristic function (i.e. sum of the distance that
the tiles are out of place.). (April-2017)[SSIT]

Artificial Intelligence (3161608) 2023 Page 4

 Shree Swaminarayan Institute of Technology Semester: VII (2023)

23 Consider the following initial and goal state configuration of 8-puzzle problem. Apply A* 07
algorithm to reach from initial state to goal state by drawing search tree and show the
solution. Consider number of misplaced tiles as a heuristic function. [New](Dec-2022)
[SSIT]

24 Explain AO* algorithm.(Nov-2014) 07, 07,

Explain AO* algorithm with Example.(Oct-2016) 07
Discuss AO* algorithm. Give one example where AO* is suitable to apply (Dec-2015)
[SSIT]
25 Explain the Best-First-Search Procedure with example.(May-2013) 07, 07,
Define “Heuristic Search”. Explain the steps in “Best First Search” and illustrate it using a 04, 07
suitable example.(May-2017)
Explain Best First Search method. (Nov-2017)
Discuss Best –First search method with example. [New](Dec-2021) [SSIT]
26 Differentiate Generate and test algorithm with Best First Search algorithm. [New](Dec- 03
2022) [SSIT]
27 Differentiate Hill climbing and Best First search method. (Nov-2018) [SSIT] 03
28 What do you mean by constraint satisfaction problems? Explain constraint propagation 07
algorithm using suitable example. (May-2014) [SSIT]
29 Discuss with example: Constraint Satisfaction Problem. (May-2018) [SSIT] 03
30 Describe different heuristics for the Blocks world problem. (Nov-2017) [SSIT] 03
31 Describe heuristic function for the Travelling Salesman Problem. (May-2018) [SSIT] 03
32 Describe different heuristics for the following types of problems:(Dec-2015) [SSIT] 07
I. Blocks world
II. Tic Tac Toe
33 Describe heuristic function for 8 puzzle problem. [New](Dec-2021) [SSIT] 04
34 Explain mean-end analysis approach to solve AI problems. (Oct-2012)(Nov-218) [SSIT] 07, 07
NUMERICALS
1 Solve the following Cryptarithmetic Problem.(May-2012) [New](June-2022) [SSIT] 07, 07
SEND
+ MORE
MONEY
2 Solve the following Cryptarithmetic Problem. (May-2013)[SSIT] 07
BES T
+ MADE
MASER
3 Solve The following Crypt arithmetic problem: (Sep-2013) (May-2016)(May-2018) 07, 07,
CROSS 07, 07,
+ROADS 07
-------------------
DENGER
Solve the Crypt – arithmetic problem with the following constraints. Give
solution steps.(Oct-2016)(Nov-2019)[SSIT]
Constraints :- (i) Use decimal arithmetic
Artificial Intelligence (3161608) 2023 Page 5
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

(ii) No two letters possess same digit.

CROSS
+ROADS
-------------------
DENGER
4 Solve The following Crypt arithmetic problem: (Sep-2013) (May-2016) [SSIT] 07, 07
BASE
+ BALL
----------------
GAMES
5 Solve the following Crypt Arithmetic problem. (Nov-2014) [SSIT] 07
DONALD
+ GERALD
ROBERT
6 Solve following cryptarithmetic problem with appropriate strategy/steps:(Dec-2015) 07, 07
(May-2019) [SSIT]
E A T
+ T H A T
-----------------
A P P L E
7 Solve following cryptarithmetic problem with appropriate strategy/steps: [SSIT] 07
TWO
+TWO
-----------------
FOUR
8 Solve following cryptarithmetic problem with appropriate strategy/steps: [SSIT] 07
ODD
+ODD
-----------------
EVEN
CHAPTER NO - 3: Logical Agents:
TOPIC:1 Knowledge–based agents, The Wumpus world, Logic,
Propositional logic, Propositional theorem proving Effective
propositional model checking, Agents based on propositional logic
1 Define knowledge base agent in AI. [New](Dec-2021) 03, 07
Explain knowledge base agent in Detail. [SSIT]
2 What is Wumpus world? Explain in detail. [New](Dec-2022) 07, 07
Explain The Wumpus world problem and give the solution of Wumpus world problem.
[SSIT]
3 Define and explain Logic, Entailment and Models. [SSIT] 07
4 Explain Entailment in the Wumpus World problem. [SSIT] 07
5 Explain Propositional logic. [New](June-2022) [SSIT] 03
6 What is Propositional logic? Explain type and Syntax of propositional logic. [SSIT] 07
7 Explain Semantics of propositional logic. [SSIT] 03
8 Explain Logical Equivalence, Validity and Satisfiability. [SSIT] 07
9 What is inference rule? How these inference rules and equivalences can be used in the 07
Wumpus world? [SSIT]
10 Define Soundness and completeness in propositional logic. [New](Dec-2021) [SSIT] 03
11 How to concert propositional logic into Conjunctive Normal Form(CNF) explain with 04
example. [SSIT]
12 Convert following compound proposition to the CNF (Conjunctive Normal Form). 03
¬ (AB) V (CA) [New](Dec-2021) [SSIT]
13 Convert the logical statement � ⇔ � ∨ � to conjunctive normal form. [New](Dec- 04
Artificial Intelligence (3161608) 2023 Page 6
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

2022) [SSIT]
14 Show by means of a truth table that ¬(P ^ Q) ≡(¬� �¬�) [New](Dec-2021) [SSIT] 03
15 What is Horn Clauses & Definite clauses? [SSIT] 03
16 Explain forward chaining with example. [SSIT] 07
17 What is forward chaining? From the given rule prove that Q is true using forward 07
chaining. [SSIT]
P⇒Q
L∧M⇒ P
B∧L⇒ M
A∧P⇒ L
A∧B⇒ L
A
B
18 Explain backward chaining with example. [SSIT] 07
19 What is backward chaining? From the given rule prove that Q is true using Backward 07
chaining. [SSIT]
P⇒Q
L∧M⇒ P
B∧L⇒ M
A∧P⇒ L
A∧B⇒ L
A
B
20 Explain Agent based on Propositional Logic. [SSIT] 07
21 Differentiate declarative and procedural knowledge. [New](June-2022) [SSIT] 04
22 Discuss the different approaches to knowledge representation. [New](June-2022) [SSIT] 07
TOPIC:2 First Order Logic: Representation Revisited, Syntax and
Semantics of First Order logic, Using First Order logic
1 Explain Syntax of First Order Logic. [SSIT] 07
2 Explain Atomic Sentences and Complex Sentences. [SSIT] 04
3 Explain Quantifiers in First order logic. [SSIT] 04
4 Explain Quantifier. [New](June-2022) [SSIT] 03
CHAPTER NO - 4: Inference in First Order Logic:
TOPIC:1 Propositional Versus First Order Inference, Unification,
Forward Chaining, Backward Chaining, Resolution
1 What are the limitations of Propositional Logic? Explain how they can be overcome using 07
Predicate logic. (May-2017) [SSIT]
2 Explain Inference Rules for Quantifiers. [SSIT] 07
3 Explain the Modus Ponens inference rule with example. [New](Dec-2022) [SSIT] 04
4 State the purpose of unification in predicate logic. [New](Dec-2021) [SSIT] 03
5 Explain Predicate logic. [New](June-2022) [SSIT] 03
6 Explain Unification. [New](June-2022) [SSIT] 03
7 Differentiate propositional logic and predicate logic. [New](Dec-2022) [SSIT] 03
8 Explain forward and backward reasoning. (May-2012)(May-2016)(May-2018)(Nov- 07, 07,
2018)(Nov-2019) 07, 07,
Explain difference between forwards reasoning and backward reasoning. (April2017) 07, 07,
(Nov-2017) (May-2019) 07, 07,
Differentiate between Forward Reasoning and Backward Reasoning. (Nov-2019) 04, 04,
Differentiate forward chaining and backward chaining. [New](June-2022) 07, 07
Explain forward and backward reasoning in detail with suitable examples of each. (May-
2015) Explain forward and backward reasoning with example. [New](Dec-2021) [SSIT]
9 Consider the following problem: 07
Artificial Intelligence (3161608) 2023 Page 7
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

The law says that it is a crime for an American to sell weapons to hostile (Unfriend)
nations. The country Nono, an enemy (Opponent) of America, has some missiles, and all
of its missiles were sold to it by Colonel West, who is American. Prove that West is a
criminal Using Forward Chaining. [SSIT]
10 Consider the following problem: 07
The law says that it is a crime for an American to sell weapons to hostile (Unfriend)
nations. The country Nono, an enemy (Opponent) of America, has some missiles, and all
of its missiles were sold to it by Colonel West, who is American. Prove that West is a
criminal Using Backward Chaining. [SSIT]
11 Consider the following problem: 07
The law says that it is a crime for an American to sell weapons to hostile (Unfriend)
nations. The country Nono, an enemy (Opponent) of America, has some missiles, and all
of its missiles were sold to it by Colonel West, who is American. Prove that West is a
criminal Using Resolution. [SSIT]
12 Translate following sentences to predicate logic and prove that “West is criminal” using 07
resolution.
1. It is a crime for an American to sell weapons to hostile nations.
2. All the missiles were sold to Nono by West.
3. The country Nono is an enemy of America.
4. An enemy of America counts as hostile.
5. Nono has some missiles.
6. Missiles are weapons.
7. West is an American. [New](Dec-2022) [SSIT]
13 Describe following facts into predicate logic. 07
1. Every child loves Santa.
2. Everyone who loves Santa loves any reindeer.
3. Rudolph is a reindeer, and Rudolph has a red nose.
4. Anything which has a red nose is weird or is a clown.
5. No reindeer is a clown.
6. Scrooge does not love anything which is weird. (April-2017)[SSIT]
14 Describe following facts into predicate logic form. 03
1. Every child loves Santa.
2. Everyone who loves Santa loves any reindeer.
3. Rudolph is a reindeer, and Rudolph has a red nose. [New](Dec-2022) [SSIT]
15 Assume the following facts: 07, 07
 John likes all kinds of food.
 Apples are food.
 Chicken is food.
 Anything anyone eats and isn’t killed by is food.
 Bill eats peanuts and is still alive.
 Sue eats everything Bill eats.
- Translate these sentences into formulas in Predicate logic
- Prove that John likes peanuts using backward chaining. (May-2013)

Translate following sentences to predicate logic and prove that John

likes peanuts using backward chaining.
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. [New](Dec-2022) [SSIT]
16 Consider the following sentences and Answer a,b,c given below: 09

Artificial Intelligence (3161608) 2023 Page 8

 Shree Swaminarayan Institute of Technology Semester: VII (2023)

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. Likex eats peanuts and is still alive.
6. Lovex eats everything Likex 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. (Oct-2012) [SSIT]
17 Consider the following facts. 07
1. The member of the St. Bridge club are Joe,Sally,Bill and Ellen.
2. Joe is married to Sally.
3. Bill is Ellen’s brother.
4. The spouse of every married person in the club is also in the club.
5. The last meeting of the club was at Joe’s house.
1) Translate the above sentences into formulas in predicate logic.
2) Prove that Ellen is not married. (Nov-2014) [SSIT]
18 Consider the following sentences: 07
 Prince is a mega star.
 Mega stars are rich.
 Rich people have fast cars.
 Fast cars consume a lot of petrol.
(1) Translate these sentences into formulas in predicate logic.
(2) Prove that Prince's car consumes a lot of petrol.(Sept-2013) [SSIT]
19 Represent following statements in Predicate Logic. 07
1. Raju only likes to see Hindi movies.
2. It is safe to assume a movie is American unless explicitly told otherwise.
3. The playhouse rarely shows foreign films.
4. People do not do things that will cause them to be in situations they do not like.
5. Rama does not go to the playhouse very often. (Nov-2017) [SSIT]
20 Translate these sentences into formulas in predicate logic. 07
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. (May-2014) [SSIT]
21 Convert the formulas derived in Q-20 into clauses. Prove that John likes peanuts using 07
resolution. (May-2014) [SSIT]
22 Consider the following sentences: 07, 07,
1. Raj likes all kinds of food. 07, 07
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.
Now, attempt following:
i. Translate these sentences into formulas in predicate logic.
ii. Use resolution to answer the question, “What food does Vinod eat?” (Oct-2016)
(April2017)[New](Dec-2021) [New](June-2022) [SSIT]
23 Consider the following sentences: (May-2018)(May-2017) [SSIT] 07, 07
 Tennis is a game.
 Chess is a game.
 John and Steve are students.

Artificial Intelligence (3161608) 2023 Page 9

 Shree Swaminarayan Institute of Technology Semester: VII (2023)

 John plays Tennis.

 Steve plays everything that John plays.
 Students who play Tennis, do not play Chess.
(i) Translate the above sentences into formulas in Predicate logic.
(ii) Prove using resolution that “Steve does not play Chess”
24 Assume the following facts : 07
 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?” (May-2012)
[SSIT]
25 Consider the following axioms: 07, 07,
1. Anyone whom Mary loves is a football star. 07
2. Any student who does not pass does not play.
3. John is a student.
4. Any student who does not study does not pass.
5. Anyone who does not play is not a football star.
Prove using resolution process that “If John does not study, then Mary does not love
John”. (May-2015)(Dec-2015) (May-2016) [SSIT]
26 Consider following facts. 07
1. Every child loves Santa.
2. Every child loves every candy.
3. Anyone who loves some candy is not a nutrition fanatic.
4. Anyone who eats any pumpkin is a nutrition fanatic.
5. Anyone who buys any pumpkin either carves it or eats it.
6. John buys a pumpkin.
7. Lifesavers is a candy.
Use resolution and prove: If John is a child, then John carves some pumpkin.
(April-2017)[SSIT]
27 Explain the algorithm of predicate logic resolution. (Sept-2013)(Nov-2014)(Nov-2018) 07, 07,
Explain the algorithm of predicate logic resolution. (May-2019) [SSIT] 07, 07
28 Explain Resolution in predicate logic. (May-2018) [SSIT] 04
29 Explain the steps of unification in predicate logic. Also discuss the steps of converting 07, 07
predicate logic wffs to clause form. (May-2015)
Explain the procedure to convert well formed formula to clause form with the help of
example. (Nov-2018) [SSIT]
30 Perform the unification of following atomic sentences. (i.e. Find the most general unifier.) 03
1. Knows(John, x); Knows(y, Mother(y))
2. Q(a, g(x, a), f(y)), Q(a, g(f(b), a), x) [New](Dec-2022) [SSIT]
31 Perform the unification of atomic sentences. (i.e. Find the most general 03
unifier.)
1. p(b, X, f(g(Z))) and p(Z, f(Y), f(Y)).
2. test (11), test(y) [New](Dec-2022) [SSIT]
32 Explain following terms in reference to predicate logic Resolution. 07
a. Unsuccessful attempt at resolution
b. Equality
c. Reduce
d. Trying several substitute. (May-2018) [SSIT]
33 Consider the following facts: 07
 Raghu likes all kinds of food.
 Mangoes are fruit.
 Cabbage is not fruit.
Artificial Intelligence (3161608) 2023 Page 10
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

 All fruits are food.

Represent the above facts using Predicate Logic and use Resolution to prove that “Raghu
likes Mangoes”. (Nov-2019)[SSIT]
CHAPTER NO - 5: Uncertainty:
TOPIC:1 Acting under Uncertainty, Basic Probability Notation, The
Axioms of Probability, Inference Using Full Joint Distributions
1 Explain Uncertainty in Details. [SSIT] 04
2 Explain Probability in Details. [SSIT] 07
3 What is proposition? Also explain Syntax for propositions. [SSIT] 07
4 Describe the axioms of probability theory. [New](Dec-2022) [SSIT] 04
5 Write inference using Full Joint Distributions with example. [New](Dec-2021) [SSIT] 04
6 Write Syntax for joint probability distributions. [SSIT] 04
7 Explain Conditional probability in Details. [SSIT] 07
CHAPTER NO - 6: Probabilistic Reasoning:
TOPIC:1 Representing Knowledge in an Uncertain Domain, The
Semantics of Bayesian Networks, Efficient Representation of Conditional
Distribution, Exact Inference in Bayesian Networks, Approximate
Inference in Bayesian Networks
1 From a standard deck of playing cards, a single card is drawn. The probability that the 04
card is king is 4/52, then calculate posterior probability P(King|Face), which means the
drawn face card is a king card. [New](Dec-2021) [SSIT]
2 Explain probability and Bay’s theorem. (May-2013)(Nov-2017) 07, 07,
Discuss Bay’s theorem. (Nov-2017) [New](Dec-2021) [New](June-2022) 03, 04,
Explain Bay’s theorem. (Nov-2018) [SSIT] 03, 04
3 Discuss Bayesian network and its application. (May-2019) [New](Dec-2021) 04, 04,
Discuss Bayesian network and its applications. [New](June-2022) [SSIT] 04
4 Explain the Semantics of Bayesian Networks. [SSIT] 07
5 Explain Representation of the joint probability distribution. [SSIT] 07
6 Explain Conditional independence relations in Bayesian networks [SSIT] 07
7 Explain Efficient Representation of Conditional Distributions. [SSIT] 07
8 Explain Exact Inference in Bayesian Networks. [SSIT] 07
9 Explain Approximate Inference in Bayesian Networks. [SSIT] 07
10 Explain Clustering algorithm in detail. [SSIT] 07
11 What is maximum a posteriori (MAP) learning in Bayesian learning? Explain it. 04
[New](Dec-2022) [SSIT]
CHAPTER NO - 7: Game Playing: Overview, and Example
Domain:
TOPIC:1 Overview, MiniMax, Alpha-Beta Cut-off, Refinements,
Iterative deepening, The Blocks World
DESCRIPTIVE QUESTIONS
1 Explain Alpha-Beta cutoff procedure in game playing with example. [New](June-2022) 07, 07,
Explain the Alpha-Beta Cutoffs Procedure in Game Playing.(May-2012) 04
Discuss Alpha-Beta Cutoffs Procedure in Game Playing. (Nov-2018) [SSIT]
2 Explain alpha-beta cut off search with an example. State a case when to do alpha pruning. 07
(Nov-2017) [ LJIET]
3 Discuss alpha-beta pruning and its advantages over min-max method. (May-2019)[SSIT] 07
4 ‘Minimax is not good for game playing when the opponent is not playing 02
optimally.’ Justify using suitable example. (May-2014)[SSIT]
5 Explain minimax procedure for game playing with example. [New](June-2022) 07, 07,
Explain Min max procedure for game playing with any example. (Oct-2012) 07,

Artificial Intelligence (3161608) 2023 Page 11

 Shree Swaminarayan Institute of Technology Semester: VII (2023)

Explain Game Playing using the Minimax Procedure. (May-2017) (May-2018) 07,07,
Explain Min-Max search procedure with an example. (Dec-2015)(Nov-2017)(May-2019) 07 07,
Explain Min-Max Search with example. (Nov-2019) 07, 07,
Explain the Minimax Procedure with example. (May-2013) 03, 07
Discuss Min-Max search method. (Nov-2017)
Explain Min max procedure in game playing. (Nov-2018) [SSIT]
6 We have two players: MIN who plays first and can make 4 moves, MAX who plays 07, 07
second and can make 2 moves. Suppose that after 1 turn, the values of the leaves are as in
the figure
Compute (with the algorithm minimax) the value of the root of the tree, than say which is
the most convenient move for MIN. Then tell with the reason, which parts of the tree are
not generated if we perform an alpha-beta pruning. (April-2017) [New](Dec-2021)
[SSIT].

7 Explain the MiniMax search procedure for Game Playing using suitable example. What is 07
the significance of Alpha and Beta cut-offs? (Nov-2019) [SSIT]
8 Consider the game tree of Fig. 1 in which the static scores are from first player’s point of 07
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. (May-2014)
[SSIT]

Fig-1
9 Consider the following 2 player game tree in which static scores are given from the first 07
player’s point of view:

Artificial Intelligence (3161608) 2023 Page 12

 Shree Swaminarayan Institute of Technology Semester: VII (2023)

Suppose the first player is the maximizing player. What move should be chosen? Why?
Use Mini-Max search to solve.Also explain limitations of Mini-Max search. How to
overcome them? (Oct-2016) [SSIT]
10 Consider the game tree given in Fig. 1, in which the evaluation function values are shown 03
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. Compute
the backed-up values computed by the minimax algorithm by writing values at the
appropriate nodes in the tree given. (May-2018) [SSIT]

11 For the game tree given in Fig. 1(Question-10), which nodes will not be examined by the 04
alpha-beta pruning algorithm? Show the process of alpha-beta pruning to justify your
answer. (May-2018) [SSIT]
12 Show the alpha-beta cutoff in min-max algorithm by drawing suitable game tree. [New] 07
(Dec-2022) [SSIT]
13 Discuss Iterative Deepening Search. Also give one example to explain. (Nov-2017) 07, 03,
Discuss Iterative deepening search method. (May-2019) 07, 07
Discuss Iterative Deepening search. [New](Dec-2021)
Explain Iterative deepening. [SSIT]
14 Explain Depth First Iterative deepening with Example. [SSIT] 07
15 Explain Iterative deepening-A* with Example. [SSIT] 07
16 What is “iterative deepening”? How is it useful in time constrained search? (Nov-2019) 03
[SSIT]
TOPIC:2 Components of A Planning System, Goal Stack Planning,
Nonlinear Planning Using Constraint Posting, Hierarchical Planning,
Reactive Systems, Other Planning Techniques
DESCRIPTIVE QUESTIONS
1 Explain Goal Stack planning using suitable example.(May-2014) 07, 07,
Explain goal stack planning in detail.(May-2015) 04, 04,
Discuss Goal Stack planning. (Nov-2018) [New](June-2022) 04
What is goal stack planning? Give example of initial state and goal state in goal stack
planning using some predicates. [New](Dec-2022) [SSIT]
Artificial Intelligence (3161608) 2023 Page 13
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

2 Explain components of planning system. [SSIT] 07

3 Discuss Nonlinear Planning using Constraint Posting with example. (May-2018) (May- 07, 07
2019) [SSIT]
4 Explain Hierarchical Planning. [New](June-2022) 04, 07
Explain Hierarchical planning in detail. [SSIT]
CHAPTER NO - 8: Statistical Learning Methods:
TOPIC:1 Statistical Learning, Learning with Complete Data Learning
with Hidden Variables: EM Algorithm
Write a short note on statistical learning. [New](June-2022) 04, 07
1
Write a note on Statistical Learning. [SSIT]
2 Explain Learning with Complete data. [SSIT] 07
How is learning done with hidden variables? Explain Unsupervised clustering with hidden 07
3
variables. [SSIT]
Explain EM Algorithm with example. [New](Dec-2021) 04, 07
4
Explain EM Algorithm. [SSIT]
5 How statistical learning method differs from reinforcement learning method? [SSIT] 07
6 What are the methods of statistical learning? [New](Dec-2021) [SSIT] 04
CHAPTER NO - 9: Introduction to Prolog:
TOPIC:1 Introduction To Prolog: Syntax and Numeric Function Basic
List Manipulation Functions In Prolog
1 Demonstrate the use of ‘cut’ and ‘fail’ predicates in Prolog with the help of a suitable 07, 07,
example. (Nov-2019) 04, 07,
Demonstrate the use of cut and fail predicates in Prolog with example. (May-2012) 07, 07,
Explain cut and fail predicate in prolog. (Nov-2017) 07,
What is use of cut and fail predicates in Prolog with example. (Nov-2017) 04,07,
Explain cut and fail predicate in prolog with example. (Nov-2014)(Dec-2015)(Oct-2016) 04, 03,
Discuss cut and fail in prolog. (Nov-2017) (May-2019) 03, 04
Discuss cut in prolog. (May-2018)
Discuss Fail predicate in prolog. (Nov-2018)
Discuss Fail in prolog. (May-2019)
Explain fail predicate in Prolog with example.[New](Dec-2022) [SSIT]
2 Explain CUT, FAIL & REPEAT predicates in PROLOG. (Nov-2018) 07, 07
Explain CUT, FAIL and REPEAT predicates in PROLOG. [New](June-2022) [SSIT]
3 Demonstrate the use of Repeat Predicate in Prolog with example. (May-2013)(Dec-2015) 07, 07
[SSIT]
4 What is red cut and green cut in Prolog? (May-2013) [SSIT] 07
5 Discuss how the following list function can be implemented in Prolog. 07
1. Append 2. Reverse (Nov-2018) [SSIT]
6 Explain following terms with reference to Prolog programming language: 07, 07,
Caluses, Predicates, Domains, Goals, Cut, Fail, Inference engine. (May-2015) (May- 03
2018)
Explain following terms with reference to Prolog programming language: Clauses,
Predicates, Domains. (Nov-2018) [SSIT]
7 Explain different types of Predicates with reference to Prolog programming language. 07
[SSIT]
8 Differentiate predicate and fact in Prolog programming.[New](Dec-2022) [SSIT] 03
9 List and state input predicates in turbo prolog. [New](Dec-2021) [SSIT] 03
10 Discuss recursion in prolog. [New](Dec-2021) [SSIT] 03
11 Explain how list is used in Prolog. Discuss how following list functions can be 07, 07
implemented in Prolog. (1) Checking membership of an item in a given list (2)
Concatenating two lists (3) Deleting an item in a given list. (May-2014)(Oct-2016)[SSIT]
12 Justify using an example that Prolog uses Backward chaining to prove or answer any 04
Artificial Intelligence (3161608) 2023 Page 14
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

given goal. (Nov-2018) [SSIT]

13 Write a Prolog program to solve Tower of Hanoi problem. (Oct-2012)(May-2013)(Nov- 07, 07,
2017)(Nov-2018)(Nov-2019) 07, 07,
Explain & write solution of Tower of Hanoi with PROLOG. (May-2018) [SSIT] 07,07
14 Write a Prolog program to count vowels in a list of characters. (Oct-2012)(Nov- 07, 07
2018)[SSIT]
15 Write a PROLOG program to count total occurrence of a character in a given list of 07
characters.(May-2019)[SSIT]
16 Write a Prolog program to find sum of elements of a list. (Oct-2012)(Nov-2014)(May- 07, 07,
2016) [New](June-2022) 07, 07,
Write a prolog program to find sum of all the numbers of a list. (May-2018) (Nov-2019) 07,07
[SSIT]
17 Write a Prolog program to find factorial of a given number. (Oct-2012)(Dec-2015)(Oct- 07, 07,
2016)(Nov-2017) [SSIT] 07, 04
18 Write following prolog programs: 07
(i) To find the sum of first n natural numbers.
(ii)To append List2 to List1 and bind the result to List3. (April-2017) [SSIT]
19 Write a prolog program 07
(i) Find the sum of first N natural numbers
(ii) ii. Find the length of the given list. [New](Dec-2021) [SSIT]
20 Write following prolog programs: 07, 07
(i) To find the factorial of a positive integer number.
(ii)To find the nth element of a given list. (April-2017) [New](Dec-2021) [SSIT]
21 Write a Prolog program to reverse a given list. (Sept-2013)(Nov-2017)[SSIT] 07, 07
22 Write a program to find maximum number from a list. (Nov-2014)(May-2016)(May- 07, 07,
2018) [SSIT] 07
23 Write a Prolog program for finding a set, which is result of the intersection of the two 07
given sets.
Hint: Goal: intersect([1, 2, 3], [2, 3, 4], A)
A = [2, 3]
Goal: intersect([d, f, g], [a, b, c ], X)
X = [] (May-2015)[SSIT]
24 Write a Prolog program to merge two sequentially ordered (ascending) lists into one 07
ordered list.
Hint: Goal: merge([1, 3, 5, 7], [0, 2, 4, 6], L)
L = [0, 1, 2, 3, 4, 5, 6, 7] tttttttttt
Goal: merge ([a, c], [b, d], [a, b, c, d])
Yes (May-2015) [SSIT]
25 Write a Prolog program that verifies whether an input list is a palindrome. 07
Hint: Goal: palindrome([r,a,c,e,c,a,r])
Output: Yes
Goal: palindrome([a,b,c])
Output: No (May-2017)[SSIT]
26 Write a Prolog program to find: the last element and the nth element (where ‘n’ indicates 07
position), of an input integer list.
Hint: Goal: last_element([1, 2, 3, 8, 9], X)
Output: X = 9
Goal: nth_element([1, 2, 3, 8, 9], 4, X) (Here, n = 4)
Output: X = 8 (May-2017)[SSIT]
27 Write a PROLOG program to find GCD of two numbers. (May-2018) [SSIT] 04
28 Write a PROLOG program Checking for Password. 07
1. Give an opportunity to user to re-enter the password ‘n’ no. of times, on entering
wrong password using Repeat predicate.
2. Give an opportunity to user to re-enter the password three (03) times, on entering
Artificial Intelligence (3161608) 2023 Page 15
 Shree Swaminarayan Institute of Technology Semester: VII (2023)

wrong password. (May-2018) [SSIT]

29 Write a Prolog program to 07
i. Merge two lists. ii. To check whether the number is +ve or –ve. (May-2019) [SSIT]
30 Write a prolog program to check whether or not given number is positive. (May-2019) 03
[SSIT]
31 Write Prolog programs to perform the following: 07
i) Find the last element of a list
ii) Merge two sorted integer lists L1 and L2 to generate a final sorted list L3.
(For example, if L1= [1,3] and L2=[2,5,8], then L3=[1,2,3,5,8]). (Nov-2019)[SSIT]
32 Write following Prolog programs: 07
1. To copy one list to another list.
2. To check whether given number is odd or even. [New](Dec-2022) [SSIT]
33 Write following Prolog programs: 07
1. To find the greatest variable among the three variables.
2. To count odd and even elements from a list. [New](Dec-2022) [SSIT]
34 What will be the output of following Prolog program if program is called with test(10,2)? 03
Also explain the reason of your output. [New](Dec-2022) [SSIT]
test(X,Y):-write('Hello'),X>=Y,!.
test(X,Y):-write('Hi'),X<Y.

Artificial Intelligence (3161608) 2023 Page 16