Faculty of Engineering & Technology

Department of Computer Science &

Engineering Question Bank

Subject: PRINCIPLES OF ARTIFICIAL INTELLIGENCE Semester: IV

Subject Code: 21AM551 Academic Year: 2022-23

Module I: Introduction to AI: History, Intelligent systems, foundation and sub area of AI, applications,
current trend and development of AI.
Problem solving: General problem solving, Characteristics of Problem, Exhaustive Searches-BFS,DFS,
Heuristic Searches- General purpose Heuristic’s, Generate and Test, Hill Climbing, Best first search, A*
algorithm.
Q. No. Questions CO PO RBT Marks
1. Define Artificial Intelligence. Explain its brief history. CO1 07M
2. Discuss the applications and sub areas of Artificial CO1 08M
Intelligence.
3. Define intelligent system and illustrate its CO1 08M
characterization.
4. Define general problem solving. CO1 10M
A Water Jug Problem: You are given two jugs, a 4-
gallon one and a 3-gallon one, a pump that has
unlimited water which you can use to fill the jug, and
the ground on which water may be poured. Neither jug
has any measuring markings on it. How can you get
exactly 2 gallons of water in the 4-gallon jug?
a. Write down the production rules for the above
problem.
b. Write any one solution to the above problem.
5. Solve the missionary’s and cannibals’ problems by CO1 10M
formulating the production rules.
6. Explain the state space representation of the CO1 08M
missionaries’ and cannibals’ problem
7. Discuss the Characteristics of a problem. CO1 06M
8. CO1 08M
Discuss State space search. Write its components
9. Discuss Breadth First Search (BFS) Algorithm with an CO1 10M
example.
10. Discuss the Depth First Search (DFS) Algorithm with CO1 10M
an example.
11. Differentiate Uninformed Search (Blind Search) and CO1 05M
Informed Search (Heuristic Search) strategies
12. List heuristic search techniques. Explain any two CO1 10M

Page 1 of 5
 techniques with algorithms.
13. Solve the 8-Puzzle problem using A* algorithm, and CO1 10M
show the steps involved in finding the solution to the
1 2 3 1 2 3 following problems.
4 6 4 5 6
7 5 8 7 8

Initial State Goal State

14. CO1 08M

Design A* algorithm.

Module II: Problem reduction and Game playing : Introduction, Problem reduction, game playing, Bounded
look-ahead strategy and use of evaluation functions, alpha-beta pruning, Two player perfect information
games.
1. Explain the AO* algorithm. Give one example where CO2 10M
AO* is suitable to apply.
2. Discuss status-Labelling procedure in Game tree with CO2 08M
an example.
3. Consider of Nim game with 7 matchsticks in the pile. CO2 10M
Draw game tree with
1) MAX as the first player
2) MIN as the first player.
4. Apply the AO* algorithm for the following example CO2 10M

5. CO2 10M
Explain the Minimax Procedure with an example.
6. Develop a Game tree with the steps involved for depth CO2 10M
3 and branching factor 3 using the Alpha-Beta
Pruning algorithm.
7. CO2 08M
Discuss Alpha-Beta Pruning.
8. CO2 10M
Write a MINIMAX algorithm

Page 2 of 5
 9. CO2 08M
Describe Two-Player Perfect Information Games.
10. Write a MINIMAX algorithm using α-β pruning
concept.
11. Give the Comparison of game problem and state space
problem.
12. CO2 08M
Discuss the refinements to α-β Pruning.
Module III: Logic concepts and logic Programming: Propositional calculus, Propositional logic, Natural
deduction system, Axiomatic System, Semantic tableau system, Resolution refutation, Predicate logic-
Predicate Calculus, First order Predicate Calculus, Logic programming.
1. Define Propositional Calculus. Discuss equivalence CO3 6M
laws in Propositional Calculus.
2. What is Propositional Logic? Show that the following CO3 6M
is a valid argument using a truth table. “If it is humid
then it will rain and since it is humid today it will
rain.”
3. State and describe the rules of the Natural Deductive CO3 10M
System.
4. Prove the theorem infer [(A→B)𝖠(B→C)]→(A→C) CO3 6M
using Natural Deduction system.
5. Define Axiomatic System. Establish that (A→𝐂) is a CO3 6M
deductive consequence of
{(A→B,B→C) i.e.{A→B,B→C}⊢(A→C)
6. State and explain the rules of the Semantic tableau CO3 10M
system in Propositional Logic.
7. Consider a set 𝑆={~(𝐴𝑉𝐵),(𝐶→𝐵),(𝐴𝑉𝐶)} of CO3 6M
formulae. Show that 𝑆 is unsatisfiable using the
tableau method.
8. Define resolution refutation method. Write the steps CO3 6M
taken to transform a Formula to its CNF.
9. Using the resolution refutation principle shows that C CO3 6M
𝐕 D is an a logical consequence of S={A 𝐕 B ,~A 𝐕
D,C 𝐕~B}
10. Write a short note on: CO3 10M
i) Predicate Logic
ii) Predicate Calculus
iii) First-Order Predicate Calculus
11. CO3 8M
Explain Logic Programming with an example.
12. Anything any one eats is called food. Mita likes all CO3 10M
kinds of food. Burger is a food. Mango is a food.
John eats pizza. John eats everything Mita eats “
Construct these sentences into formulae in predicate
logic and then to program clauses. Use resolution

Page 3 of 5
 algorithm to answer the following.
i. Does Mita like pizza? .
ii. What food does John eat?
13. Discuss three types of resolution Methods with CO3 9M
examples
Module IV: Advanced problem solving paradigm: Planning: Types of planning System, Block world
problem, Logic based planning, Linear planning using a goal stack, Means-ends analysis, Nonlinear planning
strategies-Goal set Method, Learning plans.
1. Define planning. Explain elementary techniques are CO4 1,2,3,4,6,9, L1 6M
required to perform problem solving system. 11,12
2. What are the phases of advanced problem solving and CO4 1,2,3,4,6,9, L1 6M
explain how components are represented. 11,12
3. Explain the following planning systems CO4 1,2,3,4,6,9, L2 10M
i) Operator based planning system 11,12
ii) Case based planning
4. CO4 1,2,3,4,6,9, L2 8M
Describe logic based planning
11,12
5. 1,2,3,4,6,9, L1 10M
Write goal stack algorithms
11,12
6. Consider the Block World problem given below, CO4 1,2,3,4,6,9, L3 10M
construct and evaluate it by using the GOAL 11,12
STACK method.

7. Evaluate and prove the transition’s involved in the CO4 1,2,3,4,6,9, L3 10M
given start and goal states using the Sussman 11,12
Anomaly Problem.

8. “Means-Ends Analysis approach is a technique CO4 1,2,3,4,6,9, L3 10M

used to solve problems in artificial intelligence”, 11,12
Provide the conclusion with an example.

9. Contrast the features of Non-Linear Planning CO4 1,2,3,4,6,9, L2 8M

Strategies. 11,12
10. Illustrate with an example the working of Goal Set CO4 1,2,3,4,6,9, L2 8M
Method. 11,12
11. CO4 1,2,3,4,6,9, L1 10M
Write a note on learning plans.
11,12

Page 4 of 5
Module V: Knowledge Representation, Expert system: Approaches to knowledge representation, knowledge
representation using semantic network, Extended semantic networks for KR, Knowledge representation using
Frames.
Expert system: Introduction phases, Expert System Architecture, Expert System verses Traditional system

1. What is Knowledge Representation? Explain The CO5 1,2,3,4,6,9, L1 8M

different approaches to Knowledge Representation. 11,12
2. Discuss Knowledge Representation using semantic CO5 1,2,3,4,6,9, L2 10M
network. 11,12
3. Design a complete Frame Based System for Hospital CO5 1,2,3,4,6,9, L3 10M
Application. 11,12
4. Design and illustrate inferencing methods using CO5 1,2,3,4,6,9, L3 10M
ESNet representation for thefollowing problem 11,12
which is denoted in casual form.
𝒊𝒔𝒂(𝑿, 𝒍𝒊𝒗𝒊𝒏𝒈_𝑻𝒉𝒊𝒏𝒈) ← 𝒊𝒔𝒂(𝑿, 𝒂𝒏𝒊𝒎𝒂𝒕𝒆)
𝒊𝒔𝒂(𝑿, 𝒂𝒏𝒊𝒎𝒂𝒕𝒆) ← 𝒊𝒔𝒂(𝑿, 𝒉𝒖𝒎𝒂𝒏)
𝒊𝒔𝒂(𝑿, 𝒉𝒖𝒎𝒂𝒏) ← 𝒊𝒔𝒂(𝑿, 𝒎𝒂𝒏)
𝒊𝒔𝒂(𝒋𝒐𝒉𝒏, 𝒎𝒂𝒏)

5 What is Expert System. Explain the phases in building CO5 1,2,3,4,6,9, L1 10M
Expert System. 11,12
6 How Knowledge Engineer interact with Domain CO5 1,2,3,4,6,9, L2 8M
expert to create a Expert System 11,12
7 With neat diagram explain the Expert System CO5 1,2,3,4,6,9, L2 10M
Architecture 11,12
8 Distinguish between Expert System and Traditional CO5 1,2,3,4,6,9, L2 8M
system 11,12

9 CO5 1,2,3,4,6,9, L1 8M
Write the characteristics of Expert System.
11,12
10 Write the advantages and disadvantages of Expert CO5 1,2,3,4,6,9, L1 10M
System 11,12

Page 5 of 5