18AI55

Model Question Paper-1 with effect from 2019-20 (CBCS Scheme)

USN

Fifth Semester B.E. Degree Examination

Principles of Artificial Intelligence
TIME: 03 Hours Max. Marks: 100

Note: 01. Answer any FIVE full questions, choosing at least ONE question from each MODULE.

Module – 1
Define Artificial Intelligence. Explain the techniques of A.I. Also describe the
(a) 10M
characteristics of Artificial Intelligence.
Q.1 Show at-least two points of difference between:
(b) 04M
a. Systems that thinks like human and systems that acts like human.
b. Systems that thinks rationally and systems that acts rationally.
(c) Why did earlier AI programs like ELIZA failed to prove their intelligence? 06M
OR
Explain the state space representation of Water – Jug problem.
(a) 07M
Solve the crypt arithmetic puzzle. Write Constraint equations and fond one solution
(b) 06M
using DFS. Show the steps involved in finding the solution.
Q.2 CROSS
+ ROADS
DANGER
(c) The heuristic path algorithm is a best-first search in which the objective function is f(n) 07M
= (2 − w)g(n) + wh(n).
For what values of w is this algorithm guaranteed to be optimal.
What kind of search does this perform when w = 0?
Name of When w = 1? When w = 2?
Module – 2
(a) Explain AO* algorithm. Give one example where AO* is suitable to apply 10M
Q.3
(b) Explain the Minimax Procedure with example. 10M
OR
(a) Develop a Game tree with the steps involved for the depth 3 and branching factor 3 using 10M
Alpha-Beta Pruning algorithm..
(b) Construct an AND - OR graph algorithm for a generic problem using labelling 10M
Q.4 procedure.
Module – 3
Q.5 (a) What is predicate logic? Explain the predicate logic representation with reference to 07M
suitable example.
 18AI55
Prove the theorem infer [(A → B) ∧ (B → C)] → (A → C) using Natural Deduction 07M
(b)
system.

Establish that (A → 𝐂) is a deductive consequence of 06M

(c)
{(A → B, B → C) i. e. {A → B, B → C} ⊢ (A → C)
OR
(a) Anything any one eats is called food. Mita likes all kinds of food. Burger is a food. 10M
Mango is a food. John eats pizza. John eats everything Mita eats “
Q.6 Construct these sentences into formulae in predicate logic and then to program clauses.
Use resolution algorithm to answer the following.
i. What food does John eat?
ii.Does Mita like pizza?
iii.Which food does John Like?
iv.Who likes what foods?
v. Prove the statement “Mita likes pizza and burger” using resolution.

(b) Consider a set 𝑆 = {~(𝐴 𝑉 𝐵), (𝐶 → 𝐵), (𝐴 𝑉 𝐶 )} of formulae. Show that 𝑆 is 06M
unsatisfiable using the tableau method
(c) Using resolution refutation principle show that C 𝐕 D is alogical consequence of S = 04M
{A 𝐕 B , ~A 𝐕 D, C 𝐕~B}

Module – 4
(a) Evaluate and prove the transition’s involved in the given Start and Goal states 10M
Q.7
using the Sussman Anomaly problem.

(b) Consider the block world Problem given below, construct and evaluate it by 10M
using the GOAL STACK method.

OR
(a) Contrast the features of Non-Linear Planning Strategies. Illustrate with an example 10M
the working of Goal Set Method.
Q.8 “Means-Ends Analysis approach is a technique used to solve problems in Artificial 10M
(b)
intelligence”, Provide the conclusion with an example.
Module – 5
(a) Design a network of frames(NOF) with aki, a_part_of and inst links with the following 10M
characteristics:
a. Insert a frame in NOF with all slot values filled up.
Q.9 b. Delete a frame from NOF.
c. Update the values of the slot of a given frame.
d. Query module to ask questions using FBS.
 18AI55
Design and illustrate inferencing methods using ESNet representation for the 10M
(b) following problem which is denoted in casual form.
𝒊𝒔𝒂(𝑿, 𝒍𝒊𝒗𝒊𝒏𝒈_𝑻𝒉𝒊𝒏𝒈) ← 𝒊𝒔𝒂(𝑿, 𝒂𝒏𝒊𝒎𝒂𝒕𝒆)
𝒊𝒔𝒂(𝑿, 𝒂𝒏𝒊𝒎𝒂𝒕𝒆) ← 𝒊𝒔𝒂(𝑿, 𝒉𝒖𝒎𝒂𝒏)
𝒊𝒔𝒂(𝑿, 𝒉𝒖𝒎𝒂𝒏) ← 𝒊𝒔𝒂(𝑿, 𝒎𝒂𝒏)
𝒊𝒔𝒂(𝒋𝒐𝒉𝒏, 𝒎𝒂𝒏)
OR
(a) Contrast how an expert system different from a traditional program and production 10M
system different from an expert system? Explain the knowledge acquisition component
Q.10 of ES.
(b) Design a complete Frame Based System for Hospital Application using PROLOG. 10M
 18AI55

Table showing the Bloom’s Taxonomy Level, Course Outcome and Programme
Outcome

Question Bloom’s Taxonomy Level Course Programme Outcome

attached Outcome
Q.1 (a) L2 CO1 PO1
(b) L2 CO1 PO1
(c) L1 CO1
Q.2 (a) L2 CO1 PO2
(b) L3 CO1 PO1
(c) L1 CO1 PO1
Q.3 (a) L2 CO2 PO1
(b) L2 CO2 PO3
Q.4 (a) L3 CO2 PO2
(b) L3 CO2 PO1
Q.5 (a) L2 CO3 PO2
(b) L3 CO3 PO1
(c) L3 CO3 PO1
Q.6 (a) L3 CO3 PO8
(b) L2 CO3 PO8
(c) L2 CO3 PO1
Q.7 (a) L4 CO4 PO8
(b) L4 CO4 PO4,PO8
Q.8 (a) L4 CO4 PO2
(b) L4 CO4 PO1
Q.9 (a) L4 CO4 PO1
(b) L4 CO4 PO1
Q.10 (a) L4 CO4 PO1
(b) L4 CO4 PO1

Lower order thinking skills

Bloom’s Remembering( Understanding Applying (Application):
Taxonomy knowledge):𝐿1 Comprehension): 𝐿2 𝐿3
Levels Higher order thinking skills
Analyzing (Analysis): 𝐿4 Valuating (Evaluation): 𝐿5 Creating (Synthesis): 𝐿6