wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

AI Quiz 26/9

Total questions: 26

Worksheet time: 16mins

Name
Class
Date
1.

The “Father of Artificial Intelligence” is

a)
Alan turing
b)
Geoffrey Hinton
c)
John McCarthy
d)
None of the above
2.

Which famous AI system defeated the world chess champion
Garry Kasparov in 1997?

a)
Deep Blue
b)
HAL 9000
c)
R2-D2
d)
Watson
3.

The term "singularity" in the context of AI refers to

a)
The point in a neural network where learning stops
b)
A type of robotic technology used in space exploration.
c)
A famous AI research lab.
d)
A point in the future when AI will reach human-level intelligence.
4.

Which AI technique is inspired by the structure
and function of the human brain?

a)
Genetic Algorithms
b)
Fuzzy Logic
c)
Expert Systems
d)
Neural Networks
5.

Advantage of the Turing Test are

a)
Setting a benchmark
b)
Evaluates a machine's ability to mimic human conversation
c)
Ignores Background Knowledge
d)

None of these

6.

In BFS, what does the term "breadth" refer to in terms of the search strategy?

a)
The cost of the path from the root node.
b)
The depth of the search tree.
c)
The number of nodes expanded at each level.
d)
The heuristic value of the nodes.
7.

In which situations would you consider using Depth-First Search
as an appropriate option within the context of uninformed search algorithms?
(Please select all applicable scenarios from the list below)

a)
When the search space is small.
b)
When all paths have the same cost.
c)
When memory is limited.
d)
When you want to find the shortest path to the goal.
8.

What is the main drawback of BFS compared to DFS?

a)
BFS cannot handle cyclic graphs
b)
BFS is slower in terms of time complexity.
c)
BFS has a higher memory requirement.
d)
BFS may not find a solution if one exists.
9.

Which of the following is a characteristic of uninformed search algorithms?

a)
They use heuristics to guide the search.
b)
They are primarily used for game-playing AI.
c)
They do not have information about the goal state.
d)
They are always complete and optimal.
10.

In uninformed search, which data structure is NOT used to manage the order of nodes to be expanded?

a)
Queue
b)
Stack
c)
Priority Queue
d)
Set
11.

What is the primary advantage of using heuristics in informed search?

a)
They guarantee the shortest path to the goal.
b)
They can significantly reduce the search space, making the search more efficient.
c)
They eliminate the need for goal states in the search space.
12.

If an informed search algorithm has explored 100 nodes so far and found the goal, and another uninformed search algorithm explored 200 nodes to find the goal, what can you conclude about the efficiency of these algorithms?

a)
The informed search will take less time, thus efficient
b)
The uninformed search algorithm is always more efficient.
c)

It depends on the specific problem and heuristic at hand

d)
Both algorithms have the same efficiency.
13.

What happens if the heuristic function in an informed search algorithm consistently overestimates the true cost to reach the goal?

a)
The search becomes more efficient.
b)
The algorithm is guaranteed to find the optimal solution.
c)
The algorithm may overlook better paths to the goal.
14.
4) In A* search, you have two nodes with heuristic values h1 = 8 and h2 = 12. The corresponding g(n) values are g1 = 10 and g2 = 5. Calculate the f(n) value for each node and determine which one should be expanded first based on f(n).
a)
Node 1 with f(n) = 10
b)
Node 2 with f(n) = 12
c)
Node 1 with f(n) = 18
d)
Node 2 with f(n) = 17
15.

Under what condition is A* guaranteed to find the optimal solution path?

a)
When the heuristic is consistent
b)

When the heuristic is not admissible.

c)
A* is always guaranteed to find the optimal solution path
16.

Which informed search algorithm aims to strike a balance between the exploration of
unexplored areas of the search space and the exploitation of promising areas by using a weight factor?

a)
A* search
b)
Hill Climbing
c)
Weighted A* search
d)
Uniform Cost Search
17.

Hill climbing is commonly knows as ____ search because it grabs a suitable neighbor
state without being thoughtful onward about where to go next.

a)
Tabu search
b)
Heuristic local search
c)
Greedy local search
d)
Optimal local search
18.

Local search algorithms are not systematic, the main pros includes which of the followings?

a)
Less memory
b)

Provides optimal solution

c)
Search a solution in a big infinite space
19.

Hill-Climbing algorithm terminates in which of the following conditions?

a)

No neighbor has a lower value

b)

Global Max is achieved

c)

Local Max is achieved

d)
All of these
20.

In simulated annealing, what does the "temperature" parameter represent, and how does it influence the search process?

a)

Temperature keeps track of the number of iterations

b)

Temperature represents the current solution's quality, and it increases as the algorithm progresses

c)

Temperature determines the likelihood of accepting bad moves

d)

Temperature represents the number of candidate solutions generated per iteration

21.

Consider a simulated annealing algorithm applied to the Traveling Salesman Problem (TSP) with five cities.

The algorithm starts with an initial tour length of 400 units. The current temperature is set to 1000, and the cooling rate is 0.95. During the exploration process, the algorithm generates a neighboring tour with a length of 420 units in the next step. what is the probability of accepting this worse solution at the current temperature?

(Give the closest ans)

a)

e0.02e^{-0.02}

b)

e0.02e^{0.02}

c)

e0.42e^{-0.42}

d)

e0.4e^{0.4}

22.

Given a Map coloring problem with three colors (Red, Green, Blue), choose the variable, which should be filled first ?

a)

A

b)

B

c)

C

d)
Anyone can be chosen at random
23.

Which factor can significantly affect the performance of Adversarial Search algorithms?

a)
Depth of the search tree
b)
Number of players in the game
c)
Size of the game board
d)
All of the above
24.

Consider a CSP with three variables: A, B, and C. If the domains of A and B are {1, 2, 3} and the domain of C is {2, 3, 4}, how many possible assignments exist for the variables A, B, and C if no two variables can be same?

a)
6
b)

11

c)
12
d)
18
25.

In chess-playing AI, what is a common technique used to mitigate the Horizon Effect?

a)

Increasing the search depth for the chosen best move

b)
Decreasing the search depth to speed up decision-making.
c)
Ignoring the opponent's moves.
d)
Randomly selecting moves to confuse the opponent.
26.

In Expectiminimax, how are probabilities assigned to the various branches originating from a chance node?

a)
Probabilities are determined randomly during each traversal of the tree.
b)
Probabilities are based solely on the current game state.
c)
Probabilities are provided as part of the problem definition.
d)
Probabilities are calculated dynamically based on the possible outcomes.