Scribd
Upload
56 views1 page

Assignment 1

The document discusses an assignment for an AI and ML course. It includes 10 questions on topics like search algorithms, control strategies, logic translation, resolution, natural deduction, alpha-beta pruning, axiomatic systems and comparing game problems to state space problems.

Uploaded by

bhavya
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
56 views1 page

Assignment 1

The document discusses an assignment for an AI and ML course. It includes 10 questions on topics like search algorithms, control strategies, logic translation, resolution, natural deduction, alpha-beta pruning, axiomatic systems and comparing game problems to state space problems.

Uploaded by

bhavya
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/ 1

AI&ML [22SCS22] Assignment1

Department of Computer Science Engineering


II sem MTech : Artificial Intelligence and Machine Learning[22SCS22]

Assignment -1

S.I Questions Marks


1 Discuss the goals and applications of artificial intelligence in various 10
domains. Explain the different approaches to AI (symbolic AI, connectionist
AI, evolutionary AI) and provide examples of each.
2 Compare and contrast uninformed search algorithms (breadth-first search, 10
depth-first search, uniform-cost search) and informed search algorithms
(greedy search, A* search) with respect to their search strategies and
efficiency.
3 Define control strategies in the context of artificial intelligence. Differentiate 10
between reactive and deliberative control strategies.
4 Consider the problem of driving a car from one place to another. Assume that 10
the route is not known. Consider this as a search problem with three
operators.
R1 : Travel to the next crossing and keep going straight, if possible.
R2 : Travel to the next crossing and turn to the right, if possible.
R3 : Travel to the next crossing and turn to left, if possible.
Which control strategy is better: depth first or breadth first?
5 Consider the following English sentence: 10
“Anything anyone eats is called food. Mita likes all kinds of food. Burger is a
food. Mango is a food. John eats everything Mita eats.”
Translate these sentences into formulate in predicate logic and then to
program clauses. Use resolution algorithm to answer the following goals.
i. What food does John eat?
ii. Does Mita like pizza?
iii. Which food does John like?
iv. Who likes what foods?
v. Prove the statement “ Mita likes pizza and burger” using
resolution.
6 Explain natural deduction system 10
7 Discuss the concept of alpha-beta pruning in game playing. How does alpha- 10
beta pruning improve the efficiency of the minmax algorithm?
8 Discuss Axiomatic system. 10
9 Discuss propositional calculus. 05
10 Compare game problem and state space problem 05

Prof. Bhavya P S.,Asst Prof.,CSE Dept. Page 1

You might also like