Quiz-I: Set-A

Roll Number: Name: Group:

Thapar Institute of Engineering and Technology, Patiala
Department of Computer Science

UG: Semester IV UCS411: Artificial Intelligence

17 February 2023
Time: 10 mins; M. Marks: 10 Faculties: ABJ, JYT, PYL, SWT

Q1. Consider the water jug problem: if [maximum capacity of x, y-(maximum capacity of x-x)] is not in
current state and y>0 and (x+y)>0 and (x+y)>= maximum capacity of x then choose the appropriate value of
x&y
A. y=y - (maximum capacity of x -x), x= maximum capacity of x A
B. y=x - (maximum capacity of y -y), x= maximum capacity of y
C. x=y - (maximum capacity of x -x), y= maximum capacity of x
D. x=x - (maximum capacity of y -y), y=maximum capacity of y
Q2. Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-
first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in
the traversal. Which of the following statements is always true?
A. {u,v} must be an edge in G, and u is a descendant of v in T C
B. {u,v} must be an edge in G, and v is a descendant of v in T
C. If {u,v} is not an edge in G then u is a leaf in T
D. If {u,v} is not an edge in G then u and v must have the same parent in
T
Q3. Which of the following statement is false?
A. DFS is not guaranteed to find an optimal path; iterative deepening is. C
B. For infinite search spaces also, DFS-ID will never stuck into blind
alley.
C. The space complexity of DFS-ID is same as that of BFS
D. In DFS-ID all nodes at a given depth are checked for the goal node
before moving to the next iteration with increased depth.
Q4. Following are two statements about Best first search.
1. A "best-first search" utilises a heuristic to assess how close the end of a path is to a solution by
maintaining a priority queue.
2. Best first search is always able to find the optimal solution for a problem.
Which of the above given statements are true?
A. both 1 and 2 B
B. only 1
C. only 2
D. none of the above
Q5. What is the full form of PEAS?
A. Perceptual Measure, Environment, Actuators, and Sensors B
B. Performance Measure, Environment, Actuators, and Sensors
C. Performance Measure, Entity, Actuators, and Sensors
D. Performance Measure, Environment, Agent Function, and Sensors
Q6. The time and space complexity of DFS (consider b as branching factor and d as depth of search tree)?
A. O (bd) and O (bd) D
B. O (bd) and O (bd)
C. O (bd +1) and O (bd+1)
D. O (bd) and O (bd)
Q7. How many steps are required to reach from initial to goal state from the implementation of DFS algorithm?
2 3 1 2 3
1 8 4 8 4
7 6 5 7 6 5
Initial State Goal State
A. 0 D
B. 3
C. 1
D. 2
Q8. Apply BFS traversal of the above graph which of the following traversal is possible if start
vertex is G. Assume lexicographic ordering

A B C D E

G H

I J K
A. GAHJIBCEKD C
B. GAHJIBCDEK
C. GAHIJBDEKC
D. GAHIJBCEKD
Q9. What is the function of an Artificial Intelligence “Agent”?
A. Mapping of goal sequence to an action D
B. Work without the direct interference of the people
C. Mapping of environment sequence to an action
D. Mapping of precept sequence to an action
Q10. Which agent deals with the happy and unhappy state?
A. Utility-based agent A
B. Model-based agent
C. Goal-based Agent
D. Learning Agent