SIMAD UNIVERSITY

FACULTY OF COMPUTING

SAMPLE MIDTERM EXAMINTION

ARTIFICIAL INTELLIGENCE
30% Marking
FULLNAME: _________________________________________IDNO:___________
Instructions: This Sample Midterm exam contains 4 parts. Attempt 3 parts only

[3 x 10.0 = 30.0]

PART I [ 10 Marks]
1. Using Magic Square with N = 13. Solve it by hand showing the algorithm used
firstly and then applying it step by step

2. Using TicTacToe concept, design 4 winning strategies for X if it were X’s turn

3. Using the Crytparithmatic problem with domain={0,1,2,3,4,5,6,7,8,9}, solve TEST

+ EXAM = PASS . Note: Identify the Unary, Binary and higher order Constraints
available in the above question if any

4. List the ways to Evaluate the performance of a search algorithm in four ways:

5. Using the Closed and Opened Arrays, Calculate following search methods if start
= 1 and goal = 12

Page 1 of 4
 a. Breadth-first: b. Depth-limited: c. Iterative deepening e. Lowest-Cost

PART II [ 10 Marks]
1. Compute time and space complexities If d = 6 and b =10
a. BFS: b. DFS: c. Iterative deepening d. Lowest-Cost-First Search

2. Show How many solutions of all the possible legal assignment of the following
variables: How many possible worlds can be found. Note: show the formula and
the output

a. If Variable A ={0,1,2} and Variable B = {x, y, z}

b. If 4 Octal variables

c. If 2 Decimal variables

d. If 5 Binary variables

3. Using CSP, assume you have the variables A, B, and C, each with domain {1, 2, 3,
4}. Suppose the constraints are (A < B)  (B < C). Show the possible legal
assignment using search tree

4. Using the Crytparithmatic problem with domain={0,1,2,3,4,5,6,7,8,9},, calculate

SAFAR + SAHAY = HODAN. Note: Identify the Unary, Binary and higher order
Constraints available in the above question if any

5. Using MIN and Max game with 9 Coins. Each player must divide the pile of 9 Coins
into two non-empty unequal piles. The player who can’t do that loses. Show the
solution

Page 2 of 4
6. Using Variable Elevation concept, Consider a CSP that contains the variables X, Y,
and Z, each with domain 3, 4, 5, 6}. Suppose the constraints that involve B are A
< B and B < C. Show eliminated solution

PART III [ 10 Marks]

1. In a Pick Stick Game between a user and a PC (the PC must win), the minimum
stick is 1 and the maximum stick is 3 with

a. What is the range of Picks Sticks of this game if # of rounds were 3?

b. How many stick in total are there if number of rounds were 5?. Note: Show
tabulation.
c. How many rounds are there if total stick were 40?. Note: Show tabulation.
d. What is the maximum and minimum moves if range of sticks were 6?
e. Give number of sticks that would allow the PC to win if the range was7
2. Number of dimensions of complexity exist in the design of intelligent agents
when defining the space of the AI. Different points in this space can be obtained
by varying the values of the dimensions. List at least 5 dimension values

3. True/ False: Breadth-first and depth-first searches can find paths in graphs
without any extra knowledge beyond the graph[____].

4. Using the Crytparithmatic problem with domain={0,1,2,3,4,5,6,7,8,9},, calculate

AABE + HOYO = WALID. Note: Identify the Unary, Binary and higher order
Constraints available in the above question if any

5. Write the win turns for a 25 pick stick game (for a computer and a user). You
decide the minimum and maximum sticks to be picked at a time and whether a
PC or the user has to win. Note: show your move result as a table.

6. Using TicTacToe Concept, show at least three different possible Winning

Strategies only

Page 3 of 4
PART IV [ 10 MARKS ]
1. Write the win turns for a 13 pick pennies’ for MAX and MIN

2. Using the Crytparithmatic problem, with domain={0,1,2,3,4,5,6,7,8,9}, calculate

SEND + MORE = MONEY . Note: Identify the Unary, Binary and higher order
Constraints available in the above question if any
3. Using Magic Square with N = 17. Solve it by hand showing the algorithm firstly
and then applying it step by step

4. There are five persons whose weights are 100K, 50K,100k, 50K, 100K respectively
on the left bank of a river. There is one boat which can hold only 100k weight
each and every time in every direction. Goal: Find a way to get everyone to the
right bank of the river.

5. Using the Delivery Robot concept with the class map, show how to convert state
space into Constraint Graph

6. Given the Propositional symbols:

A = “The car has gas” D = “I can buy food”

B = “I can go to the store” E = “The sun is shining”
C = “I have money” F = “I have an umbrella”
Write the propositional logic of the following statements. Note: Build Truth tables
a. If I can buy food and either the sun is not shining or I have an umbrella,
I can go to the store
b. If the car gas or I have money I can go to the store

End of Sample Midterm

Page 4 of 4