Scribd
Upload
50 views2 pages

UCS411 - Quiz1 Set B - Solutions

This document is a quiz for the UCS411 Artificial Intelligence course at Thapar Institute of Engineering and Technology, consisting of 10 questions covering various AI concepts such as agents, search algorithms, and graph traversal. Each question has multiple-choice answers, with the correct options indicated. The quiz is designed for undergraduate students in their fourth semester and is timed for 10 minutes.

Uploaded by

Vaishnavi Chaursia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views2 pages

UCS411 - Quiz1 Set B - Solutions

This document is a quiz for the UCS411 Artificial Intelligence course at Thapar Institute of Engineering and Technology, consisting of 10 questions covering various AI concepts such as agents, search algorithms, and graph traversal. Each question has multiple-choice answers, with the correct options indicated. The quiz is designed for undergraduate students in their fourth semester and is timed for 10 minutes.

Uploaded by

Vaishnavi Chaursia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Quiz-I: Set-B

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. What is the function of an Artificial Intelligence “Agent”?


A. Mapping of precept sequence to an action A
B. Work without the direct interference of the people
C. Mapping of environment sequence to an action
D. Mapping of goal sequence to an action
Q2. 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
Q3. 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 C
B. only 2
C. only 1
D. none of the above
Q4. 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=x - (maximum capacity of y -y), x= maximum capacity of y B
B. y=y - (maximum capacity of x -x), x= maximum capacity of x
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
Q5. 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) B
B. O (bd) and O (bd)
C. O (bd +1) and O (bd+1)
D. O (bd) and O (bd)
Q6. 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
Q7. 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 D
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 and v must have the same parent in T
D. If {u,v} is not an edge in G then u is a leaf in T
Q8. Which agent deals with the happy and unhappy state?
A. Learning Agent C
B. Model-based agent
C. Utility-based agent
D. Goal-based Agent
Q9. Which of the following statement is false?
A. DFS is not guaranteed to find an optimal path; iterative deepening is. D
B. For infinite search spaces also, DFS-ID will never stuck into blind alley.
C. In DFS-ID all nodes at a given depth are checked for the goal node before
moving to the next iteration with increased depth.
D. The space complexity of DFS-ID is same as that of BFS
Q10. What is the full form of PEAS?
A. Performance Measure, Environment, Actuators, and Sensors A
B. Perceptual Measure, Environment, Actuators, and Sensors
C. Performance Measure, Entity, Actuators, and Sensors
D. Performance Measure, Environment, Agent Function, and Sensors

You might also like