CS361 AI Midterm Exam (Model A - Fall 2022) ANSWER KEY

Model X
Helwan University | Faculty of Computers & Artificial Intelligence | Computer Science Dept.
Artificial Intelligence (CS-361) Midterm Exam Thur. Nov. 17th, 2022 (Time Allowed: 30 Mins.)
Attempt ALL Questions Num. of Pages: 2 Pages (1 Sheet) - Closed-book exam (Marks: 15)
PLEASE NOTE: Questions 1 to 15 must be answered in the External Answer Sheet.
Name: ........................................................................................... Group No. ......... Section No. .........
ID: ....................................................
Q.1 Choose the correct answer: [ 15 MARKS ]
1) In the game tree of Chess, the Minimax algorithm should be applied for choosing the next
move that minimizes the possible loss. (a) True. (e) False.
2) Choosing the next move in a game of Chess is considered an Adversarial Planning.
(a) True. (e) False.
3) Consider the following game tree in which root is a maximizing node and children are
visited right to left. What nodes will be pruned by the alpha-beta pruning?
E F G I J
H
2 3 1 2 4 6
(a) None (b) I J (c) E F (d) E G (e) F H
4) Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an
adjacent empty space. Given the initial state as below, which of the following states cannot
be reached? (a) A (b) B (c) C (d) D (e) None of the above.
Initial State (A) (B) (C) (D)

1 2 3 1 3 2 1 3
3 2 2 1 1 3 2
5) Specifying the task environment for an Intelligent Agent is usually done using PEAS. For
an Internet shopping agent, which of the following represents the P: (a) Current and future
Web sites, vendors, shippers, etc. (b) Display to user, follow URL, fill in form, etc. (c) Web pages
(text, graphics, scripts, etc.) (d) Quality, appropriateness, price, efficiency, etc.
6) Big data, it is often described using five Vs. Veracity refers to: (a) the vast amounts of data
generated every second. (b) the speed at which new data is generated and the speed at which
data moves around. (c) the different types of data we can now use. (d) the messiness or
trustworthiness of the data. (e) that unless we can turn it into value it is useless.
Page 1 of 2
7) In the given tree, during the few first steps of searching, ( [A], [B A], [D B A] ) can be a part
of: (a) Backtracking’s State List. (b) Depth-first search Closed structure. (c) Breadth-first search
Closed structure. (d) a & b. (e) a & c.
8) In the given tree, the node M is visited only when using: (a) Standard Backtracking algorithm.
(b) Breadth-first search. (c) Depth-first search. (d) a & c. (e) All of the mentioned.
A
C
B N is the goal
F
D G H
E
I J
M L
N K
9) Given that n is the number of nodes in the graph when solving a Travelling Salesman
Problem (TSP), the number of individual paths in a fully-connected TSP can be calculated
as: (a) n! (b) (n - 1)! (c) n * n (d) n! + 1
10) In Evolutionary Computation algorithms (e.g., Genetic Algorithms, etc.), as the population
converges, the candidate solutions are located closer to each other. (a) True. (e) False.
11) Predicting a student's mark in terms of a percentage is classification, while predicting a
student's performance in terms of a Pass/Fail is regression. (a) True. (e) False.
12) Which of the fowlloing is a decision system that receives rewards for its action at the end
of a sequence of steps? (a) Supervised learning. (b) Unsupervised learning. (c) Reinforcement
learning. (d) Deep learning.
13) If an Intelligent Agent is performing "Autonomous Driving", its environment can NOT be
described as: (a) Partially observable (not Fully observable). (b) Stochastic (not Deterministic
nor Strategic). (c) Sequential (not Episodic). (d) Continuous (not Discrete). (e) Static (not Dynamic
nor Semi-Dynamic).
14) Which of these fields is crucial to pass a Total Turing Test (which is the Turing Test
extended to include the physical aspects of human behavior)? (a) Natural Language
Processing. (b) Knowledge Representation. (c) Computer Vision. (d) Robotics. (e) All of the
mentioned.
15) For a proper implementation of the Best-First Search (BFS) algorithm and the Uniform-Cost
Strategy (UCS) algorithm, state which data structure you would use to store the fringe
nodes for each algorithm. (a) For BFS we use a queue, & for UCS we use a stack. (b) We use
a priority queue for both. (c) For BFS we use a stack, & for UCS we use a queue. (d) We use a
queue for both. (e) For BFS we use a priority queue, & for UCS we use a queue.
With my best wishes ..

Page 2 of 2

CS361 AI Midterm Exam (Model A - Fall 2022) ANSWER KEY

Uploaded by

Copyright:

Available Formats

CS361 AI Midterm Exam (Model A - Fall 2022) ANSWER KEY

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CS361 AI Midterm Exam (Model A - Fall 2022) ANSWER KEY

Uploaded by

Copyright:

Available Formats

Model X

Initial State (A) (B) (C) (D)

With my best wishes ..

You might also like