0% found this document useful (0 votes)
114 views14 pages

Questionbank PAI

The document is a question bank for the course 'Principles of Artificial Intelligence' (BCIPA404), covering various topics across four modules. Each question is categorized by marks, course outcomes, Bloom's taxonomy level, and program outcomes. The questions address concepts such as rationality in intelligent agents, search algorithms, heuristic informed searches, and first-order logic, among others.
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
0% found this document useful (0 votes)
114 views14 pages

Questionbank PAI

The document is a question bank for the course 'Principles of Artificial Intelligence' (BCIPA404), covering various topics across four modules. Each question is categorized by marks, course outcomes, Bloom's taxonomy level, and program outcomes. The questions address concepts such as rationality in intelligent agents, search algorithms, heuristic informed searches, and first-order logic, among others.
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/ 14

QUESTION BANK

Course Code: BCIPA404 Course Name: Principles of Artificial


Intelligence
Module I

Q no. QUESTION Marks CO Blooms PO


Level

1. Explain the concept of rationality in the context of 10 CO1 L2 PO1


intelligent agents and the key characteristics of
intelligent agents

2. Explain to what extent are the following computer systems 10 CO1 L2 PO1
instances are implemented using artificial intelligence:
1. SuperMarket Bar code scanners.
2. Web Search engines.
3. Voice activated telephones menues.
4. Internet routing algorithms that responds
dynamically to the state of the network.

3. Describe Four Approaches in detail related to 10 CO1 L2 PO1


Empirical and Rational Thoughts

4. Illustrate few State of the Art examples using AI 10 CO1 L2 PO1

5. Explain a Simple Reflex Agent with a Neat Diagram 10 CO1 L2 PO1

6. Explain Utility-Based agent with a Neat Diagram 10 CO1 L2 PO1

7. Explain the foundations of Artificial Intelligence 10 CO1 L2 PO1

8. Interpret Rational agent and PEAS model that is used 10 CO1 L2 PO1
to describe an agent

9. Explain Model-Based agent with a Neat Diagram and 10 CO1 L2 PO1


Goal-Based agent with a Neat Diagram

10. Explain the disciplines of AI with examples 10 CO1 L2 PO1

11. Identify five Novel applications of AI and explain in 10 CO2 L3 PO1


detail

12. Identify different approaches to AI throughout 10 CO2 L3 PO1


history

13. A salesman selling garments must travel to five cities. 10 CO2 L3 PO1
Apply the properties of goal-based agents to solve the
problem so that the salesman can cover all the cities in
shortest distance

14. Identify the different components involved in the 10 CO2 L3 PO1


structure of various Agents

15. Apply your knowledge to the rationality of various 10 CO2 L3 PO1


vacuum-cleaner agent function. Describe rational
agent function for the case in which each movement
costs one point.

16. Utilize PEAS Model to describe the task environment 10 CO2 L3 PO1
& tabulate the characteristics of
i) Automated Taxi driver
ii) Satellite image analysis system
iii) Medical Diagnosis system

iv) Part picking Robot system

17. A circuit board is being designed using various chips. 10 CO2 L3 PO1
Apply your knowledge on how a goal-based agent
can be used for placing the components in such a
way that they don’t short each other.

18. A salesman selling clothes must travel to five cities. 10 CO2 L3 PO1
Apply the properties of goal-based agents to solve the
problem so that the salesman can cover all the cities in
shortest distance.

19. A traveller must travel from Arad to find route to 10 CO2 L3 PO1
Bucharest in Romania. Apply the properties of goal-
based agents for the same.

20. Identify the applications of multi-agent systems with 10 CO2 L3 PO1


examples.

MODULE-II

Q no. QUESTION Marks CO Blooms PO


Level
1. Make use of the map of Romania to travel from Arad 10 CO2 L3 PO1
to Bucharest and Build the path from the source Arad
to destination Bucharest

using
a. BFS
b. DFS
c. Uniform cost search
d. Bidirectional Search
2. Considering the map of Romania to travel from Arad 10 CO2 L3 PO1
to Bucharest and trace the path from the source Arad
to destination Bucharest using
a. Depth limited
b. DFS
c. Iterative deepening

3. Utilize the graph given below, apply DFS, BFS and UCS 10 CO2 L3 PO1
to construct the path from Source S to Destination 5

4. Discuss the characteristics and differences among 10 CO2 L3 PO1


the three uninformed search strategies in problem-
solving tasks.

5. Identify the pros and cons of Breadth-First Search 10 CO2 L3 PO1


and Depth-First Search in relation to time and
space complexity.
6. Make use of the graph given below, apply DFS, BFS 10 CO2 L3 PO1
and UCS to build the path from Source S to
Destination 5

7. Utilize the concept of Bidirectional search to solve 10 CO2 L3 PO1


schematic view that is about to succeed when a branch
from the start node meets a branch from the goal node..

8. Identify the advantages of Depth First search over 10 CO2 L3 PO1


the other various uniform search strategies.

9. Apply syntax and semantics to obtain the 10 CO2 L3 PO1


propositional logic:
•Seema and Sahana are friends.
•2025 is not a leap year.

•Students study mathematics or science.


•If it is raining, we cannot go outside.
•If I am breathing, the I am alive.

10. Apply the propositional logic for the following: 10 CO2 L3 PO1

•Today is not Sunday.


•Children eat sweets and ice-cream.
•People like films or cricket.
•If student come to class, he/she will get
attendance.
•If I am free on Sunday, I will join the party.

11. Distinguish between the concepts of breadth first 10 CO3 L4 PO2


search and depth first search algorithm using an
example.
12. 10 CO3 L4 PO2
Examine the depth-limited search algorithm within
the context of problem-solving in artificial
intelligence

13. Analyse the iterative nature of Iterative Deepening 10 CO3 L4 PO2


Search(IDS) using a specific example, such as
navigating a maze or solving the Tower of Hanoi
puzzle

14. Analyse the advantages of Uniform Cost Search 10 CO3 L4 PO2


(UCS) over other search algorithms, particularly in
scenarios where the cost of traversing edges varies.

15. List the applications, advantages and disadvantages 10 CO3 L4 PO2


of BFS and also measure the performance of search
technique.

16. List the effectiveness of Bidirectional Search algorithm 10 CO3 L4 PO2


with an example compared to other search strategies.

17. Examine the applications, advantages, and 10 CO3 L4 PO2


disadvantages of the Iterative Deepening Depth-
First Search (IDDFS) algorithm in solving search
problems.

18. List the applications, advantages and disadvantages 10 CO3 L4 PO2


of DFS and also measure the performance of search
technique.

19. Classify the applications, advantages and 10 CO3 L4 PO2


disadvantages of UCS and DFS and also measure the
performance of search technique.
20. Analyse the applications, advantages, and 10 CO3 L4 PO2
disadvantages of Depth-Limited Search (DLS)
algorithm in solving search problems
MODULE-III

Q no. QUESTION Marks CO Blooms PO


Level

1. . Classify various Heuristic Informed Searches with an 10 CO1 L2 PO1


example for each
2. Explain how Greedy Best-First Search prioritizes 10 CO1 L2 PO1
nodes and its application in solving search problems.

3. Show that minimizing the total estimated solution cost 10 CO1 L2 PO1
can be implemented using the strategy of A* algorithm
4. Outline the conditions for optimality involved 10 CO1 L2 PO1
Informed search strategies

5. With an example explain the Optimality of A* algorithm 10 CO1 L2 PO1

6. Explain the process of logical state estimation with 10 CO1 L2 PO1


action sequences and its significance in problem-
solving tasks.

7. What is greedy best first search? Explain it with an 10 CO1 L2 PO1


example.

8. Explain knowledge-based agents with an example 10 CO1 L2 PO1

9. Explain Wumpus world knowledge-based agent 10 CO1 L2 PO1


and describe the PEAS model for the same.

10. Summarize how does the choice of heuristic 10 CO1 L2 PO1


function impact the performance of search
algorithms like Greedy Best First Search and A*
search.

11. Apply syntax and semantics to obtain the 10 CO2 L3 PO1


propositional logic:
•Seema and Sahana are friends.
•2025 is not a leap year.

•Students study mathematics or science.


•If it is raining, we cannot go outside.
•If I am breathing, the I am alive.
12. 10 CO2 L3 PO1
Explain logic, syntax and semantics of logic by
considering two examples.

13. Make use of the given graphs and solve it using Greedy 10 CO2 L3 PO1
Best first Search and A* search

14. Apply your knowledge to contrast the performance 10 CO2 L3 PO1


of Greedy Best First Search and A* search algorithms
in terms of optimality and efficiency.

15. Construct a randomly generated 4-CNF sentence with n 10 CO2 L3 PO1


symbols and m clauses more or less likely to be solvable
than a randomly generated 3-CNF sentence with n
symbols and m clauses?

16. Apply the propositional logic for the following: 10 CO2 L3 PO1
•Today is not Sunday.

•Children eat sweets and ice-cream.


•People like films or cricket.
•If student come to class, he/she will get
attendance.
•If I am free on Sunday, I will join the party.

17. Solve the following to Prove each of the assertions: 10 CO2 L3 PO1
a. α is valid if and only if True |= α.

b. For any α, False |= α.

c. α |= β if and only if the sentence (α ⇒ β) is valid.

d. α ≡ β if and only if the sentence (α ⇔ β) is valid.


e. α |= β if and only if the sentence (α ∧ ¬β) is
unsatisfiable

18. Make use of the given graphs and solve it using Greedy 10 CO2 L3 PO1
Best first Search and A* search

19. Solve the below given graph using Greedy Best first 10 CO2 L3 PO1
Search

20. Identify the effectiveness of knowledge-based 10 CO2 L3 PO1


agents in solving complex problems such as the
Wumpus World, considering the strengths and
limitations

Module IV

Q no. QUESTION Marks CO Blooms PO


Level
1. Solve of the following to check for valid (necessarily true) 10 CO2 L3 PO1
sentences?

a. (∃x x = x) ⇒ (∀ y ∃z y = z).

b. ∀ x P(x) ∨ ¬P(x).

c. ∀ x Smart(x) ∨ (x = x).

2. Apply the concept of backward chaining as an inference 10 CO2 L3 PO1


mechanism in First Order Logic.

3. A is true. B is true. If A & C is true, then F is true. If 10 CO2 L3 PO1


A & E is true, then G is true. If B is true, then E is true.
If G is true , then D is true. Make use of Forward
Chaining to prove that D is true.
4. The law says that it is a crime for an American to sell 10 CO2 L3 PO1
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 an
American. “Make use of Backward Chaining to prove
that A is a criminal

5. Apply First Order Logic for the following sentences 10 CO2 L3 PO1
i. One’s mother is one’s female parent
ii. One’s husband is one’s male spouse
iii. One’s father is one’s male spouse
iv. One’s wife is one’s female spouse
v. Male and Female are disjoint categories
vi. Parent and Child are inverse relations
vii. A grandparent is a parent of one’s parent
viii. A sibling is another child of one’s parents

6. Apply the syntax of first order logic and obtain the 10 CO2 L3 PO1
predicate logic of the following sentences
i. Everyone is loyal to someone
ii. Bruno is a dog
iii. Every man respects his parents
iv. Not all students like mathematics and
science
v. All kids drink Horlicks
vi. Ravi and Ajay are brothers
vii. All Romans are either loyal to Caesar or
hated him
7. Express the following statements in first-order logic: 10 CO2 L3 PO1
a. Gershwin wrote “The Man I Love.”
b. Gershwin did not write “Eleanor Rigby.”
c. Either Gershwin or McCartney wrote “The Man I
Love.”
d. Joe has written at least one song.
e. Joe owns a copy of Revolver.
f. Every song that McCartney sings on Revolver was
written by McCartney.
g. Gershwin did not write any of the songs on
Revolver.
h. Every song that Gershwin wrote has been recorded
on some album. (Possibly different songs are recorded
on different albums.)
8. Illustrate a scenario where backward chaining would 10 CO2 L3 PO1
be advantageous over other inference methods, by
providing examples.

9. Apply the syntax of first order logic and obtain the 10 CO2 L3 PO1
predicate logic of the following sentences
i. All teachers take class
ii. Seema and Sanjana are friends
iii. Tommy is a cat
iv. Every woman respects her parents
v. Everybody is god to somebody
vi. Not all students like sports and dance
vii. All srilankans were either loyal to Ravan
or hated him
viii. All students like dance or music
10. The law says that it is a crime for an American to sell 10 CO2 L3 PO1
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 an
American. “Make use of Forward Chaining to prove
that A is a criminal

11. Analyse the role of First Order Logic in revisiting 10 CO3 L4 PO1
knowledge representation, considering its
expressiveness and ability to represent complex
relationships.

12. Analyse a specific problem to determine which 10 CO3 L4 PO1


inference mechanism (forward chaining, backward
chaining, or resolution) would be more suitable and
why.

13. Distinguish between Forward Chaining and Backward 10 CO3 L4 PO1


Chaining with an Example
14. Compare and contrast the syntax and semantics of First 10 CO3 L4 PO1
Order Logic with those of propositional logic, highlighting
their respective expressive power and limitations.

15. Distinguish between the First Order Logic and 10 CO3 L4 PO1
propositional logic in terms of representation.

16. Analyse the advantages and limitations of backward 10 CO3 L4 PO1


chaining as an inference mechanism in First Order
Logic, citing examples

17. Analyse the resolution proof that Curiosity killed the cat. 10 CO3 L4 PO1
Notice the use of factoring in the derivation of the clause
Loves(G(Jack ), Jack). Notice also in the upper right, the
unification of Loves(x, F(x)) and Loves(Jack, x) can only
succeed after the variables have been standardized apart
with a neat diagram

18. Analyse the implications of syntax and semantics in First 10 CO3 L4 PO1
Order Logic for reasoning and inference tasks, Using First
Order Logic.
19. List the steps involved in Structure of a completeness 10 CO3 L4 PO1
proof for resolution

20. Analyse the differences between propositional and First 10 CO3 L4 PO1
Order inference mechanisms in terms of their
expressiveness and computational complexity.

Module V

Q no. QUESTION Marks CO Blooms PO


Level

1. Explain the concept of uncertain knowledge and 10 CO1 L2 PO1


reasoning of Wumpus World Revisited.

2. Illustrate utility of Bayes' Rule in updating beliefs and 10 CO1 L2 PO1


making decisions under uncertainty.

3. Demonstrate a probabilistic model for reasoning about 10 CO1 L2 PO1


the agent's beliefs and actions in the Wumpus World
Revisited
4. Explain the importance of independence assumptions in 10 CO1 L2 PO1
probabilistic reasoning and their impact on the accuracy
and efficiency of inference algorithms.

5. Summarize the importance of quantifying uncertainty in 10 CO1 L2 PO1


decision-making processes.

6. Explain the basic probability notation used in uncertain 10 CO1 L2 PO1


reasoning, including random variables, events, and
probability distributions.

7. Outline A decision-theoretic agent that selects rational 10 CO1 L2 PO1


actions with a neat pictorial representation.

8. Classify the various language of propositions in probability 10 CO1 L2 PO1


assertions

9. Explain how uncertainty affects action selection and 10 CO1 L2 PO1


decision-making in AI agents

10. Infer on the Wumpus World environment and discuss the 10 CO1 L2 PO1
uncertainties inherent in navigating and exploring the
cave.

11. Identify the computational requirements of exact 10 CO2 L3 PO1


inference using full joint distributions with approximate
inference methods, using examples.

12. Analyse with an example how factoring a large joint 10 CO2 L3 PO1
distribution into smaller distributions, using absolute
independence.

(a) Weather and dental problems are independent.

(b) Coin flips are independent.

13. Categorize is the task of assigning a given document to 10 CO2 L3 PO1


one of a fixed set of categories on the basis of the text it
contains. Naive Bayes models are often used for this task.
In these models, the query variable is the document
category, and the “effect” variables are the presence or
absence of each word in the language; the assumption is
that words occur independently in documents, with
frequencies determined by the document category.

a. Explain precisely how such a model can be constructed,


given as “training data” a set of documents that have
been assigned to categories.
b. Explain precisely how to categorize a new document.
c. Is the conditional independence assumption
reasonable? Discuss.

14. Identify the challenges faced by agents in the Wumpus 10 CO2 L3 PO1
World due to uncertainty, considering factors such as the
presence of hazards and incomplete information.

15. Analyse the set of all possible five-card poker hands dealt 10 CO2 L3 PO1
fairly from a standard deck of fifty-two 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?

16. List the axioms of probability, and prove that any 10 CO2 L3 PO1
probability distribution on a discrete random variable
must sum to 1

17. Analyse each of the following statements, either prove it 10 CO2 L3 PO1
is true or give a counterexample. a. If P(a | b, c) = P(b | a,
c), then P(a | c) = P(b | c) b. If P(a | b, c) = P(a), then P(b |
c) = P(b) c. If P(a | b) = P(a), then P(a | b, c) = P(a | c)

18. Consider a vocabulary with the following symbols: 10 CO2 L3 PO1


Occupation (p, o): Predicate. Person p has occupation o.
Customer (p1, p2): Predicate. Person p1 is a customer of
person p2.
Boss(p1, p2): Predicate. Person p1 is a boss of person p2.
Doctor, Surgeon, Lawyer, Actor: Constants denoting
occupations.
Emily, Joe: Constants denoting people.
Utilize these symbols to write the following assertions in
first-order logic:
a. Emily is either a surgeon or a lawyer.
b. Joe is an actor, but he also holds another job.
c. All surgeons are doctors.
d. Joe does not have a lawyer (i.e., is not a customer of any
lawyer).
e. Emily has a boss who is a lawyer.
f. There exists a lawyer all of whose customers are doctors.
g. Every surgeon has a lawyer
19. How would you utilize full joint distributions to infer 10 CO2 L3 PO1
probabilities of events in a given probabilistic graphical
model

20. Analyse the computational complexity and scalability 10 CO2 L3 PO1


issues associated with exact inference using full joint
distributions, referencing examples.

You might also like