ಬಿ.ಎಂ.ಎಸ್.

ತಂತ್ರಿ ಕಮತ್ತು ವ್ಯ ವ್ಸ್ಥಾ ಪನಾಮಹಾವಿದ್ಯಯ ಲಯ

BMSInstitute of Technology and Management
(An Autonomous Institution Affiliated to VTU, Belagavi)
Avalahalli, Doddaballapur Main Road, Bengaluru – 560064

Programme: B E – Computer Science and Engineering / Information

Science and Engineering
Internal Assessment – I
TERM : 2024 – 2025 COURSE NAME: ARTIFICIAL INTELLIGENCE
DATE : 27/11/2024 TIME: 9:30 AM to 11:00 AM COURSE CODE : BCS505B
COURSE COORDINATOR: Dr. Ambika G. N., Dr. Jai
SEMESTER: V (CSE & ISE) MAX MARKS: 40
Arul Jose G., Prof. Sowmya K., Prof. Spandana L.
Max. Marks: 40
Blooms
Levels
Q. NO Questions CO Marks
(L1 to
L6)*
1.a Identify the benefits and applications of AI in real time.
Ans:
Benefits of AI
1. Efficiency
2. Accuracy
3. Cost Reduction
4. Real-Time Insights etc
Applications of AI: L3 CO1 4M
1. Healthcare
2. Transportation
3. Finance
4. Education
5. Retail and E-Commerce etc

2M for each with explanation

1.b Make use of Architectures in AI to explain different types of
agents.

Ans:
types of Agents
1. Simple reflex agents L3 CO1 6M
2. Model-based reflex agents
3. Goal-based agents
4. Utility-based agents
5. Learning agents
Architecture and explanation: 2M each (any 3 )
OR
2 Apply the idea of agent function and agent program with the
vacuum cleaner world problem.

agent function:

L3 CO1 10 M

agent : program:

explanation, agent function agent program (2+4+4)M

3 Choose Performance measure, Environment, Actuators and

Sensors for Automatic Taxi Driver problem. Write the
properties of this task environment.

L3 CO2 10 M

(6 Marks - 1.5 Marks for each description)

(4 Marks)
 ಬಿ.ಎಂ.ಎಸ್.ತಂತ್ರಿ ಕಮತ್ತು ವ್ಯ ವ್ಸ್ಥಾ ಪನಾಮಹಾವಿದ್ಯಯ ಲಯ
BMSInstitute of Technology and Management
(An Autonomous Institution Affiliated to VTU, Belagavi)
Avalahalli, Doddaballapur Main Road, Bengaluru – 560064

OR
4 Construct the steps to find the path for the given Problem using DFS
algorithm considering A as initial state and M as Goal state.

L3 CO2 10 M

( 2.5 Marks for each level of the tree)

5 Analyze the Given 8 puzzle problem and write the steps to
reach the goal state.

L4 CO3 10 M

OR
 ಬಿ.ಎಂ.ಎಸ್.ತಂತ್ರಿ ಕಮತ್ತು ವ್ಯ ವ್ಸ್ಥಾ ಪನಾಮಹಾವಿದ್ಯಯ ಲಯ
BMSInstitute of Technology and Management
(An Autonomous Institution Affiliated to VTU, Belagavi)
Avalahalli, Doddaballapur Main Road, Bengaluru – 560064
6. Consider the missionaries and cannibals problem usually stated as
follows: “Three missionaries and three cannibals are on one side of
a river, along with a boat that can hold one or two people. Find a
way to get everyone to the other side without ever leaving a group
of missionaries in one place outnumbered by the cannibals in that
place”,
Analyze the problem precisely, making only those distinctions
necessary to ensure a valid solution. Draw a diagram of the
complete state space.
Simplify the problem optimally using an appropriate search
algorithm.

Ans:
•States:
–Combination of Missionaries, Cannibals and Boat on each side of
river.
–Each state can be represented as a tuple (M, C, B) where: M –
Number of missionaries on the starting side, C – Number of
cannibals on the starting side, and B – Location of the boat (0 for
the starting side (left), 1 for the other side (Right)).

L4 CO3 10 M

•Initial State:
•(3, 3, 0) — All three missionaries, three cannibals, and the boat are
on the starting side.
•Goal State:
–(0, 0, 1) — All three missionaries, three cannibals, and the boat
are on the other side.

•Constraints:
–At no point can cannibals outnumber missionaries on either side
of the river.
–The boat can hold one or two people.

–A move requires at least one person to be in the boat.

–The boat cannot cross the river empty.
 •Actions:
•Possible transitions involve moving 1 or 2 people from one side of
the river to the other. For example:
–Move one missionary. - Move one cannibal. - Move two
missionaries.
–Move two cannibals. - Move one missionary and one cannibal.
•State Space Transition Model:
–The state space consists of all valid states reachable from the
initial state. Invalid states (where cannibals outnumber
missionaries) are excluded.
•Path Cost:
Require minimum number of moves. (6 Marks)

(4 Marks)

L4 CO3 10 M
ಬಿ.ಎಂ.ಎಸ್.ತಂತ್ರಿ ಕಮತ್ತು ವ್ಯ ವ್ಸ್ಥಾ ಪನಾಮಹಾವಿದ್ಯಯ ಲಯ
BMSInstitute of Technology and Management
(An Autonomous Institution Affiliated to VTU, Belagavi)
Avalahalli, Doddaballapur Main Road, Bengaluru – 560064

Analyze a given graph and find the cost of the path using
A* Informed Search Strategy and write the pseudocode
for the same.

(6 Marks)
 node ←a node with STATE = problem.INITIAL-STATE, PATH-COST = 0
/*Path-Cost is h(n)+g(n)
frontier ←a priority queue ordered by PATH-COST, with node as the only
element
explored ←an empty set
loop do
if EMPTY?( frontier) then return failure
node←POP( frontier ) /* chooses the lowest-cost node in
frontier */
if problem.GOAL-TEST(node.STATE) then return
SOLUTION(node)
add node.STATE to explored
for each action in problem.ACTIONS(node.STATE) do
child ←CHILD-NODE(problem, node, action)
if child .STATE is not in explored or frontier then
frontier ←INSERT(child , frontier )
else if child .STATE is in frontier with higher PATH-COST then
replace that frontier node with child

(4 Marks)

OR
8 Choose complete problem formulation for the following problem
“You have three jugs, measuring 12 gallons, 8 gallons, and 3
gallons, and a water faucet. You can fill the jugs up or empty them
out from one to another or onto the ground. You need to measure
out exactly one gallon.”

Ans:

•States:
–All configurations of the three jugs with different amounts of
water in each jug.
–The state is represented by a tuple (x, y, z) where:

–x: the amount of water in the 12-gallon jug (initially 0 gallons).

L5 CO4 10 M
–y: the amount of water in the 8-gallon jug (initially 0 gallons).
–z: the amount of water in the 3-gallon jug (initially 0 gallons).
•Initial State:

•(0, 0, 0) — All three jugs are empty.

•Goal State:
–A state (x, y, z) satisfies the goal if any jug contains exactly 1
gallon: x == 1, y == 1, or z == 1.

–(variant: A jug has 1 gallon of water in it and the other jugs are
empty)
•Constraints:
–Fill a jug from the faucet:
ಬಿ.ಎಂ.ಎಸ್.ತಂತ್ರಿ ಕಮತ್ತು ವ್ಯ ವ್ಸ್ಥಾ ಪನಾಮಹಾವಿದ್ಯಯ ಲಯ
BMSInstitute of Technology and Management
(An Autonomous Institution Affiliated to VTU, Belagavi)
Avalahalli, Doddaballapur Main Road, Bengaluru – 560064
•Fill(J) where J is one of the jugs (12, 8, or 3 gallons).
•Result: The specified jug is filled to its maximum capacity.
–Empty a jug onto the ground:
•Empty(J) where J is one of the jugs.

•Result: The specified jug is emptied entirely (water discarded).

–Pour water from one jug into another:
•Pour(J1, J2) where J1 and J2 are two different jugs.
•Result: Water from J1 is poured into J2 until either:

–J2 is full, or
–J1 is empty.
–The remaining water in J1 and the final state of J2 are updated
accordingly.

•Actions:
•Actions represent the possible ways to manipulate the water in the
jugs. Each action transforms the current state into a new state: For
example:

–Fill(12): Fill the 12-gallon jug to its full capacity.

–Empty(12): Empty the 12-gallon jug onto the ground.
–Pour(12, 8): Pour water from the 12-gallon jug into the 8-gallon
jug until the 8-gallon jug is full or the 12-gallon jug is empty.

–etc.
•State Space Transition Model:
–The state space consists of all valid states reachable from the
initial state.

•Path Cost:
–Assume a uniform cost for simplicity: Each action (filling,
emptying, or pouring) has a cost of 1 unit.
(6 Marks)
 (4 Marks)

Course Outcomes (COs)

CO1: Apply AI Concepts for solving different problems in real time.

CO2: Apply AI algorithms and Knowledge base sentences to solve complex problems.
Analyze the concepts of expert systems, uncertain Knowledge and Reasoning for problem
CO3:
solving.
CO4: Select appropriate AI tools to provide solutions for real time applications.
Bloom’s Level

Remember Understand Apply Analyze Evaluate Create

(L1) (L2) (L3) (L4) (L5) (L6)

Course Module Program

BoE Chairman
Coordinator (s) Coordinator (s) Coordinator (s)