Academic year 2022-2023 (Odd Semester)
DEPARTMENT OF COMPUTER SCIENCE/ INFORMATION SCIENCE AND
ENGINEERING
Date March 2023 Maximum Marks 10+50
Course Code 21MCE1A1T Duration 120 Min
Sem I CIE - I
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
SL No. Part A- Quiz M BT CO
An agent’s __________ is the complete history of everything that the agent
1 1 L2 CO1
has perceived.
The depth limited search can solve the _____________ problem
2 1 L2 CO1
The process of deciding what actions and states to consider, given the goal is CO2
3 1 L1
called ______________
Write the PEAS description of the Part Picking Robot. CO3
4 2 L3
Give the BFS and DFS tree traversal for the following tree. Assuming A is
the start node and F is the goal node.
5 2 L3 CO2
6 Define Greedy best first search algorithm? 2 L2 CO4
7 Define heuristic function with proper notations. 1 L2 CO2
SL No. Part B -Test M BT CO
What is a rational agent ? What are the factors on which “what is rational” at
1.a 5 L2 CO2
any given time depends on ?
Use the example of a vacuum cleaning agent and discuss the components of 5 L3 CO1
1.b
problem formulation.
Academic year 2022-2023 (Odd Semester)
2.a Explain the properties of task environments? 5 L2 CO2
2.b Describe briefly Informed(Heuristic) Search Strategies? 5 L1 CO3
Discuss the four metrics involved in evaluating an algorithms performance
3.a 5 L3 CO4
with examples.
3.b Illustrate with examples the typical AI Applications and challenges of AI 5 L3 CO2
Explain with the help of pseudocode and diagrams, Model-based reflex
4 10 L2 CO2
agents and Goal-based agents
Perform alpha beta pruning on the below given tree and show the final and
step by step results
5 10 L3 CO3