👁️ 130 views
University of Barishal Logo

University of Barishal

Department of Computer Science and Engineering

Final Exam

Course Title: Artificial Intelligence (CSE-3205)

Semester: 6th | Session: 18-19

Time: 180 minutes | Marks: 60.00

Answer any five Questions from the followings.

1.


a) What is AI? Differentiate between the strong Al and Weak AI.

Please SUBSCRIBE to view full question

Topics: Basic AI Solution is Coming!
3 Marks
b) Identify the four sources that demonstrate Evidence of Human Intelligence.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
3 Marks
c)

Distinguish between the following properties of a task environment:

i. Static or dynamic

ii. Discrete or continuous

iii.Single or multi-agent

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
3 Marks
d) Briefly explain the PEAS description of the task environment for an automated taxi.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
3 Marks
2.


a) Describe the function of vacuum cleaner as an Agent with suitable diagram.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
3 Marks
b)

Convert the following

 

SQ Image

sentence into clausal form:

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
4 Marks
c)

For the following database facts, write a completion formula that states that Johny is the only person that lives in Barishal.

LIVESIN (johny, Barishal)

LIVESIN(alice, Pabna)

LIVESIN(darth, bogura)

OWNS(johny, smartphone)

STUDENT(darth)

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
5 Marks
3.


a) Define the following terms in your own words: state, state space, search tree, search node, goal, action, transition model, and branching factor.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
4 Marks
b) Perform A* Algorithm on the following figure. Explicitly write down the queue at each step

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
8 Marks
4.


a) Give the values calculated by minimax for all states in the tree. Do not use alpha-beta pruning.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
6 Marks
b) Indicate which branches of the tree will be pruned by alpha-beta pruning?

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
6 Marks
5.


a)

Consider the search space below, where S is the start node and G1 and G2 are goal nodes. Arcs are labeled with the value of a cost function; the number gives the cost of traversing the arc. Above each node is the value of a heuristic function; the number gives the estimate of the distance to the goal. Assume that the algorithms do not keep track of and recognize repeated states.

 

For each of the following search strategies,

BFS, DFS, GBFS

i. indicate which goal state is reached first (if any) and

ii. List in order, all the states that are popped off the OPEN list.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
12 Marks
6.


a) The graph above shows the step costs for different paths going from the start (S) to the goal (G).Use uniform cost search to find the optimal path to the goal.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
8 Marks
b) Write down the advantage of IDS over BFS and DFS. Also, shows times and space complexity among them.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
4 Marks
7.


a) What is probabilistic reasoning? How is probabilistic reasoning different from logical reasoning?

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
3 Marks
b)

A simple Bayesian Network, with corresponding conditional probability tables, is given below:

From the Bayesian network, answer the following questions:

i) What is the probability that it is cloudy, it is raining, the sparkler is off, and the grass is wet?

ii) What is the probability that it is not cloudy, it is not raining, the sparkler is on, and the grass is wet?

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
6 Marks
c) Explain backward chaining algorithm with suitable example.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
3 Marks
8.


a)

Translate each of the following sentences into First Order Logic (FOL):

i. Not all cars have carburetors

ii. Everyone loves everyone.

iii.Every connected and circuit-free graph is a tree iv. All that glitters is not gold

v. Not all that glitters is gold

vi.There is a barber who shaves all men in the town who do not shave themselves

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
6 Marks
b) Discuss the limitations of first-order logic when it comes to expressing certain types of statements or reasoning.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
2 Marks
c)

A proposition with three variables, A, B, and C. Prove that proposition A∧¬A∧(BVC) is a contradiction.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
2 Marks
d)

Prove (AVB)and[(¬A)∧(¬B)] are equivalent.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
2 Marks

Contributors of this Question:

Role Name Date
Uploaded By: Onebyzero Edu (Test User) July 30, 2024, 7:15 p.m.
Converted By (Img/PDF to Text): Nahare Jannat Nov. 23, 2025, 10:18 p.m.
Reviewed By: Obaydul Hasan Nayeem Nov. 24, 2025, 7:10 p.m.