Scribd
Upload
391 views4 pages

21CS54 TIE SIMPdocx (1) (1) (1) (1) PDF

The document provides an overview of study modules for an AI exam. Module 1 covers topics like the Turing test and agent environments. Module 2 involves problem solving techniques and search algorithms. Module 3 is on informed searches and heuristics. Module 4 discusses logic in AI. Module 5 is about probability and uncertainty in decision making.

Uploaded by

nida19sc115
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
391 views4 pages

21CS54 TIE SIMPdocx (1) (1) (1) (1) PDF

The document provides an overview of study modules for an AI exam. Module 1 covers topics like the Turing test and agent environments. Module 2 involves problem solving techniques and search algorithms. Module 3 is on informed searches and heuristics. Module 4 discusses logic in AI. Module 5 is about probability and uncertainty in decision making.

Uploaded by

nida19sc115
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/ 4

21AI54 SIMP Questions -21SCHEME

To pass and score decent just study Module 1,2 3

MODULE -1 : Study any 6 Questions

1. What is the Turing test, and how does it determine if a machine is intelligent? Why is it
important in AI? Explain
2. Can you list the various environments in which agents operate,Explain by taking
vacuum cleaner world as an example

3. Explain the concept of rationality. Define Omniscience, Learning and Autonomy


4. Describe the PEAS characteristics for the following scenarios:
i) Autonomous Taxi Driver
ii) Interactive English Tutor
iii) Satellite Image Analysis System
iv) Part Picking Robot
4b. What is AI, Explain the different approaches of AI, Explain the history and Interpret
different foundations of AI
5. Explain simple reflex agent, model-based agent, utility-based agent, goal-based agent
and Learning agent with neat diagrams for each.
6. What challenges and ethical concerns come with deploying machine learning systems in
different areas?

MODULE -2 : Study all the 6 Questions

1. Explain how a well-defined problem can be formulated.


2. What is a problem-solving agent, and what are its components, Apply the PS Technique for
these given problems (i)8 Queens (ii)Traveling Salesman Problem (iii)8 Puzzle problem
3. How do breadth-first search and depth-first search differ in solving problems? Explain by
using appropriate algorithms. What are the advantages and disadvantages of each?
4. Explain the working of Iterative deepening depth First search with an example.
5. Consider a state space where the start state is number 1 and each state n has two successors:
numbers 2k and 2k + 1.
i) Draw the portion of the state space for states 1 to 15.
ii) Suppose the goal state is 11, Apply Breadth - First Search, Depth - First Search, Depth -
Limited Search with limit 3, and Iterative Deepening Search to obtain the order in which
nodes will be visited.
6. How are search algorithms applied to real-world problems? Can you give examples from
different fields? Explain how a problem solving performance is measured

MODULE -3 : Study any 7 Questions

1. Explain the concept of informed search strategies? How do they differ from uninformed
search strategies? Explain Greedy Best first search and A* Search Algorithm in detail - 12M
2. What role do heuristic functions play in informed search algorithms? How are heuristic
functions generated? How are they used to estimate the cost of reaching the goal state?
3. Show that the tree-search version of A* is optimal if h(n) is admissible, while the
graph-search version is optimal if h(n) is consistent.
4. Explain the working of Recursive Best First Search algorithm with algorithm and an
example
5. Explain the PEAS description of Wumpus World.
6. Explain knowledge-based agents in detail
7. Explain resolution algorithm for propositional logic. Use propositional logic and apply
resolution method for the following sentences to prove that the goal is derivable from the
given knowledge base. 1. (P ∧ Q) ∧ (P ⇒ R) ∧ [(Q ∧ R) ⇒ S], where goal is S. 2. The
humidity is high or the sky is cloudy If the sky is cloudy, then it will rain If the humidity is
high, then it is hot It is not hot Goal: It will rain
8. Apply A* and Greedy Best First Search algorithm for the below graph (use a sample graph
and answer)
9. Explain the Forward chaining algorithm for propositional logic. Apply the Forward chaining
algorithm for the following grammar (A and B are known facts; Q is the conclusion) and
draw the Page 4 of 7 corresponding AND – OR graph. P ⇒ Q L ∧ M ⇒ P B ∧ L ⇒ M A
∧P⇒LA∧B⇒LAB

MODULE -4 : Study any 8 Questions

1. Differentiate between Propositional and Predicate logic.


2. Explain the syntax and semantics of First order logic. Explain Backus-Naur Form (BNF)
of First order logic also explain the concept of assertions and queries in first-order logic
3. Explain Unification algorithm. Find the Most General Unifier (MGU) for the following. i.
UNIFY(Knows(John, x), Knows(x, Elizabeth)) ii. UNIFY(Knows(John, x), Knows(y,
Bill))
4. Explain Forward and backward chaining algorithm of First order logic.
5. The law says that it is a crime for an American to sell weapons to hostile nations. The
country Nono, an enemy of America, has some missiles, and all of its missiles were sold
to it by Colonel West, who is American. Prove that “West is a criminal” using Forward
AND Backward chaining algorithm also prove that “West is a Criminal” using resolution
6. Convert the following statements into Conjunctive Normal Form (CNF) by explaining
each step-in detail. i) Everyone who loves TIE is loved by someone. ii) Anyone who hates
RCB is loved by no one.
7. Convert the following sentences into First Order Logic. a. Marcus was a man. b. Marcus
was a Pompeian. c. All Pompeians were Romans. d. Caesar was a ruler. e. All Romans
were either loyal to Caesar or hated him. f. Everyone is loyal to someone. g. People only
try to assassinate rulers they are not loyal to. h. Marcus tried to assassinate Caesar. i. All
men are people. j. Marcus was born in 40 A.D. k. All men are mortal.
8. Everyone who loves all animals is loved by someone.
Anyone who kills an animal is loved by no one.
Jack loves all animals.
Either Jack or Curiosity killed the cat,
who is named Tuna.
Did Curiosity kill the cat? Prove by Resolution.

MODULE -5 : Study any 8 Questions


9. Explain the concept of acting under uncertainty
10. Define the following terms. i. Sample space ii. Probability model iii. Event iv.
Unconditional probability v. Conditional probability vi. Random variables vii.
Inclusion–Exclusion principle.
11. Explain the concept of independence in joint probability distribution
12. Explain the Concept of Interference using Full joint distributions
13. Explain Independent Bayes rule and its uses
14. Three urns are there containing white and black balls; the first urn has 3 white and 2 black
balls; the second urn has 2 white and 3 black balls and the third urn has 4 white and 1 black
balls. Without any biasing one urn is chosen from that one ball is chosen randomly which
was white. What is the probability that it came from the third urn?
15. Three persons A, B and C have applied for a job in a private company. The chance of their
selections is in the ratio 1: 2: 4. The probabilities that A, B and C can introduce changes to
improve the profits of the company are 0.8, 0.5 and 0.3, respectively. If the change does
not take place, find the probability that it is due to the appointment of C.
16. Consider the set of all possible five-card poker hands dealt fairly from a standard deck of
fifty-two Page 7 of 7 cards. a. How many atomic events are there in the joint probability
distribution (i.e., how many five-card hands are there)? b. What is the probability of each
atomic event? c. What is the probability of being dealt a royal straight flush? Four of a
kind?
17. A bag contains 4 balls. Two balls are drawn at random without replacement and are found
to be blue. What is the probability that all balls in the bag are blue?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy