Scribd
Upload
515 views

Artificial Intelligence Exam

This document contains instructions for a midterm exam on Artificial Intelligence being held on May 2nd, 2021 from 2-4pm. The exam contains 3 questions worth a total of 35 marks. Question 1 involves short answer questions about key AI concepts. Question 2 asks students to model a problem of navigating to an airport as an unfamiliar driver. Question 3 provides a search graph and asks students to trace the paths that would be returned using different search algorithms like breadth-first search, depth-first search, and A*.

Uploaded by

Muhammad Saud Ali
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
515 views

Artificial Intelligence Exam

This document contains instructions for a midterm exam on Artificial Intelligence being held on May 2nd, 2021 from 2-4pm. The exam contains 3 questions worth a total of 35 marks. Question 1 involves short answer questions about key AI concepts. Question 2 asks students to model a problem of navigating to an airport as an unfamiliar driver. Question 3 provides a search graph and asks students to trace the paths that would be returned using different search algorithms like breadth-first search, depth-first search, and A*.

Uploaded by

Muhammad Saud Ali
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/ 3

UNIVERSITY OF MANAGEMENT AND TECHNOLOGY

School of Systems and Technology (SST)

Instructor Afifa Wajid Course Code CS3431w

Course Artificial Intelligence Semester Spring-2021


Name

Date/Day 2-May-2021/Sunday Time 14:00-16:00

Total Marks 35 Exam MID TERM

Instructions:

 Handwritten submissions allowed only.


 Arrange your answers sequentially and submit as one pdf file containing all the scanned
pictures of your solution.
 Submissions through LMS will be accepted only, paper submitted on email will not be graded.
 No late submissions allowed, no matter what
 Arrange the alternatives on your own, in case of internet, electricity and other issues. The
instructor is in no way responsible for such circumstances.
 Plagiarized answers will be marked as zero.

Page 1 of 3
Question#1:
Give short answers to the following: [2*5]
a) Briefly describe an event considered as “birth” of the field of Artificial Intelligence?

b) How do you get started if you wanted make an intelligent agent to solve a problem?

c) Mention the properties of the environment for the Mars Rover.

d) Describe the PEAS for the agent playing soccer.

e) Simply fill the table below against the given evaluation criteria. Assume a tree search where
b is the finite branching factor; d is the depth to the shallowest goal node; m is the maximum
depth of the search tree.

Criteria Completeness Time Space Optimal


Complexity Complexity
Breadth First
Search
Uniform Cost
Search

Question#2: [8]

Consider that a person has never been to the city airport. It’s early in the morning and assume
that no other person is awake in the town who can guide him on the way. He has to drive on his
car but doesn’t know the way to airport. Clearly identify the four components of problem solving
in the above statement, i.e. problem statement, operators, solution space, and goal state. Should
he follow blind or heuristic search strategy? Try to model the problem in a graphical
representation.

Question#3: [17]
Consider the search graph shown below. Here S is considered as the start state and G is considered as the
goal state. The Edges are labelled with their appropriate cost. Moreover, each node contains the heuristic
values ‘h’ as mentioned inside the nodes. For each of the following searching algorithms, give the
following:

i. The path as a sequence of states; returned , or write “none” if no path returned


ii. The nodes that are added to the graph and expanded in the order.
iii. If there are ties, assume nodes for states which are earlier in the alphabet are expanded first.

Page 2 of 3
a) Breadth First Search Algorithm [5]
b) Depth First Search Algorithm [5]
c) A* Algorithm [5]
d) Is the heuristic value as given in this graph admissible or not? Justify your answer with
reasoning. [2]

----------------------------------------------------Best of Luck!----------------------------------------------------------

Page 3 of 3

You might also like