Assignment – I (Set 1)

Artificial Intelligence
YEAR / SEM: BE/VII DATE: 27/09/2021
BRANCH:IT Deadline : 5/10/2021

Q. N. Question Details Mod Level CO

ule
Q 1.(a) Give Limitations of IDA* algorithm M2 R CO703
Q 1.(b) List all types of agent M1 U CO701
Q 1.(c) What is Turing test approach? M1 U CO701
Q 1.(d) Explain Bidirectional search. M2 U CO703
Q 1.(e) What do you mean by well defined problem? Explain. M2 R C0702
Q 1.(f) Give search evaluation strategies . M2 R CO702
Q 2.(a) Explain heuristic function with example. M2 U CO702
Q 2.(b) Give comparative analysis of informed search strategies. M1 U CO701
Q 3.(a) Explain Min-Max algorithm with any example. M2 A CO703
Q 3.(b) What do you mean by backtracking? Explain backtracking for M2 A CO702
CSP.

Roll No 1 to 15
 Assignment – I (Set 2)

Artificial Intelligence
YEAR / SEM: BE/VII DATE: 27/09/2021
BRANCH:IT Deadline : 5/10/2021
Roll No 16 to 30

Q.1 Question Heading Module Level CO

Q 1.(a) List different task domains of AI. M1 R CO701
Q 1.(b) Explain drawbacks of Hill climbing algorithm M1 U CO701
Q 1.(c) How problem solving technique’s performance is measured? M2 U CO702
Q 1.(d) List all types of agent in AI. M2 U CO703
Q 1.(e) Explain different Uninformed search techniques. M2 R C0702
Q 1.(f) Describe Greedy search algorithm. M2 R CO702
Q 2.(a) Explain IDA* algorithm in detail. M2 U CO702
Q 2.(b) Explain Alpha Beta pruning with example. M2 U CO703
Q 3.(a) Explain Depth First search algorithm with example. M2 A CO702
Q 3.(b) Measure 2 liter water if available jugs are 7 and 5 liters. M2 A CO702

Assignment – I (Set 3)
 Artificial Intelligence
YEAR / SEM: BE/VII DATE: 27/09/2020
BRANCH:IT Deadline : 5/10/2021
Roll No 31 to 45

Q. 1 Question Heading Module Level CO

Q 1.(a) List different Informed and Uninformed search techniques. M2 R CO702
Q 1.(b) Explain Crypt Arithmetic problem. M2 U CO703
Q 1.(c) Explain Model based and Learning based agents. M2 U CO702
Q 1.(d) Explain best first search algorithm. M2 U CO702
Q 1.(e) List advantages and disadvantages of DFS and BFS. M2 R C0702
Q 1.(f) What do you mean by Turing Test approach? M2 R CO702
Q 2.(a) Explain Structure of Agent. M1 U CO701
Q 2.(b) Explain Hill climbing algorithm in detail. M2 U CO702
Q 3.(a) Measure 3 and 4 of milk when jug is of size 7 and 2. M2 A CO702
Q 3.(b) Explain MIN MAX algorithm in AI. M3 A CO703

Assignment – I (Set 4)
 Artificial Intelligence
YEAR / SEM: BE/VII DATE: 27/09/2021
BRANCH:IT Deadline : 5/10/2021
Roll No 46 to 60

Q. 1 Question Heading Module Level CO

Q 1.(a) List all components of AI. M2 R CO702
Q 1.(b) What do you mean by Platue and Local Maxima in Hill M1 U CO701
climbing?

Q 1.(c) Differentiate between DFS and BFS. M2 U CO702

Q 1.(d) Explain utility based reflex agent with example. M1 U CO701
Q 1.(e) Explain backtracking in AI. M2 R C0702
Q 1.(f) Compare different informed search techniques. M2 R CO702
Q 2.(a) Explain Alpha Beta pruning with any example. M2 U CO703
Q 2.(b) Give example for Crypto Arithmetic problem for M2 U CO703
SEND+MORE=MONEY

Q 3.(a) Analyze uniform cost search with any example. M2 A CO703

Q 3.(b) Explain A * algorithm in detail. M1 A CO701

Assignment – I (Set 5)

Artificial Intelligence
YEAR / SEM: BE/VII DATE: 27/09/2021
BRANCH:IT Deadline :5/10/2021
Roll No 61 onwards

Q. 1 Question Heading Module Level CO

Q 1.(a) Explain state space search. M1 R CO701
Q 1.(b) What is AI problem? M1 U CO701
Q 1.(c) Explain the concept of IDA*. M2 U CO702
Q 1.(d) List the advantages of BFS and DFS. M2 U CO702
Q 1.(e) What is water jug problem? M2 R C0702
Q 1.(f) List benefits of Depth limited search. M2 R CO702
Q 2.(a) Formulate state space search for vacuum world cleaner. M2 U CO702
Q 2.(b) Solve crypto arithmetic problem for BASE + BALL= GAMES M2 U CO703
Q 3.(a) Suppose you are designing a machine to pass Turing test. M1 A CO701
What are the capabilities such a machine must have? Explain.

Q 3.(b) Compare all Informed and Uninformed search techniques. M2 A CO702