Wolkite University

Collage of Computing and Informatics

Department of Information Systems

Course Title: Artificial Intelligence

Prepared by: Dawit H.

Time Allotted: 3:00hrs

Name: _________________________________ ID No. __________ Section: _____

INSTRUCTIONS
❖ Don’t forget to switch off your cell phone!
❖ Read each question carefully.
❖ Please write neatly. Illegible answer will be assumed to be
incorrect.
❖ You are not allowed to leave the exam rooms before 30 minutes.
❖ Remember! Cheating is not allowed and action will be taken.
❖ Make sure the booklet contents five parts on 11 pages (including
the cover page and the answer sheet)!

Do Not Turn This Page Until You Are Told To Do So!

Part I: Choose the best answer (1 pt for each question)
1. ___________________ is turning data into information.
a. Deep learning c. Neural networks
b. Machine learning d. Classification

2. Which one of the statement is NOT CORRECT?

a. Completeness is the algorithm guaranteed to find a solution when there is one.
b. Optimality does the strategy find the complete solution.
c. Time complexity is measured in terms of the number of nodes generated.
d. Space complexity how much memory is needed to perform the search.
3. Represent the following sentence in first order logic “Everyone has a mother”.
a. ∀x Mother(x; y)
b. ∀x ∃y Mother(x ;y)
c. ∃y Mother(x; y)
d. ∃y ∀x Mother(x; y)
4. Which one is correct about uniform cost search
a. Uniform cost search is not a modification of breadth-first search
b. Uniform cost search is difference from breadth first search by queue ordered by
path cost.
c. Uniform cost search expands the node with the highest path cost g(n).
d. Uniform cost search works LIFO queue.
5. Represent the following sentence in first order logic “Brothers are siblings”.
a. ∃x; y (Brother(x; y)⇒Sibling(x; y))
b. ∀x; y (Sibling(x; y),⇔Sibling(y; x))
c. ∀x; y (Brother(x; y)⇒Sibling(x; y))
d. ∀x; ∃y (Brother(x; y)⇒Sibling(x; y))

6. In which of the following search algorithms is it possible to confuse a local maximum

with a global maximum?
a. Depth First c. Hill Climbing
b. A* d. Greedy Search

Page 1 of 11
 7. A set of procedures that use the representational language to infer new facts from known
ones or answer a variety of KB queries.
a. Inference engine. c. Knowledge base
b. Forward chaining d. Backward chaining

8. ___________is a collection of nodes that have been generated but not yet been expanded.
a. Parent node c. Fringe
b. Queue order d. Path cost

9. Which one is different from the other?

a. Deep learning
b. Neural networks
c. Reinforcement learning
d. Breadth-first learning

10. Which of the following search algorithms is not heuristic search?

a. Greedy search c. A*
b. Iterative deepening search d. Iterative deepening A* search

Part II: Write True if the statement is Correct and False if the statement is Incorrect (1 pt
for each question)

1. A robotics is a machine designed to execute one or more tasks automatically with speed
and precision.
2. In a feed forward neural network, data circulates back & forth until the activation of the
units is stabilized.
3. Natural language processing is a field of computer science, artificial intelligence and
linguistics concerned with the interactions between computers and human languages.
4. Uninformed Search Strategies have no additional information about states beyond that
provided in the problem definition.
5. In rule-based system, rules represent specialized knowledge regarding a domain.

Page 2 of 11
Part III: Match A with B (1 pt for each question)
A B
1. Plateaux a. Calculate by how much the disorder of a
2. Clustering set would reduce by knowing the value of
3. Communicating using Tell and Ask a particular attribute.
4. Supervised learning b. A form of communication in which
5. Information gain agents share the same internal
representation language and have direct
access to each using knowledge base.
c. is an area of the state space landscape
where the evaluation function is flat.
d. Is a situation in which both the inputs and
outputs of a component can be perceived.
e. Is a machine learning technique used to
predict group membership for data
instances.
f. The expected information content of a
given attributes to classify records into
classes
g. A form of communication in which
agents share the same internal
representation language and have direct
access to each other's knowledge bases
through the TELL and ASK interface.
h. Is a peak that is higher than each of its
neighboring states, but lower than the
global maximum.
i. is a division of data into groups of similar
objects.
j. Is learning when there is no hint at all
about the correct outputs.

Page 3 of 11
Part IV: fill the blank space (1 pt for each question)

1. The central component of a knowledge-based agent is_______________.

2. The search algorithm takes a problem as ________ and returns a __________ in the form
of action sequence.
3. ___________________ takes place as a result of the interaction between the agent and the
world, and from observation by the agent of its own decision-making processes.
4. ______________ is the systematic examination of states to find path from the start/root
state to the goal state.
5. ____________________algorithms help to gather data from varied sources, transform rich
data sets, and help us to take intelligent action based on the results provided.

Part V: Essay type question (total 15)

1. What are the four conceptual components of a learning agent? (2 pts)

2. Show that(prof) ￢ q → ￢ p ≡ p → q (2 pts)
3. Search problem, there are four operators, which move the blank up, down, left, and right.
The start and goal states are given below. Find the goal state by using breadth first search
technique. (2 pts)

2 3 1 2

1 3

Start state Goal state

4. Write down robotics design phases? (2 pts)

5. Consider the search space below (the figure is on the next page), where S is the start node
and G1 and G2 are goal nodes. Arcs are labeled with the value of a cost function g(n); the
number gives the cost of traversing the arc. Nodes are labeled with the value of a heuristic
function h(n); the number gives the estimate of the distance to the goal. Assume that
uninformed search algorithms always choose the left branch first when there is a choice.
For each of the following search strategies (Breadth-first and iterative deepening search)
show each step-in detail, indicate, List in order, all the states that are popped off the OPEN
list and popped in CLOSED list. (3 pts)
Page 4 of 11
 S
5 3
2

B 1 C
A 1
1 3
2
4
G1
0 5
8 5
D
9 1
2

F 7 G2
6 0

6. What are the architecture of neural network? (1 pt)

7. Represent the following sentence in first order logic. (3 pts)
a. There is someone who is loved by everyone
b. Someone at Wolkite is smart.
c. If two numbers have the same square, then they have the same absolute value.

Page 5 of 11
Bonus
1. What will be the output of the following program? (3 pts)
print(' 1 2 3 4 5 6 7 8 9 10')
print('+-----------------------------------------------')
for row in range(1,11):
if row<10:
print(' ', end="")
print(row, "| ", end="")
for column in range (1,11):
product =row*column;
if product<100:
print(end=" ")
if product <10:
print(end=" ")
print(product, end=" ")
print()
2. What will be the output of the following program? (3 pts)
n=10
for i in range(n-1):
numwhite=n-i
print (' '*numwhite +'*'*i + '*'*i)

Page 6 of 11
 Answer Sheet

ID_____________________________ Section_________________

Part I

1. _________ 6. _________

2. _________ 7. _________

3. _________ 8. _________

4. _________ 9. _________

5. _________ 10. _________

Part II Part III

1. _________ 1. ___________

2. _________ 2. ___________

3. _________ 3. ___________

4. _________ 4. ___________

5. _________ 5. ___________

Part IV

1. _________

2. _________

3. _________

4. _________

5. _________

Page 7 of 11
Part V

1.

Page 8 of 11
Page 9 of 11
Page 10 of 11
Page 11 of 11