Upon the completion of this course the students will be able to

CO1 Infer the agent characteristics and its problem solving approaches. (K2)

CO2 Select appropriate search algorithms for any AI problem. (K2)

CO1

S.No Questions
In what way can AI contribute to healthcare?
A. By replacing human healthcare providers entirely.
1. B. By improving diagnosis accuracy and treatment recommendations.
C. By increasing healthcare costs.
D. By reducing patient accessibility to healthcare services.
AI-driven recommendation systems often personalize content based on users' past _____.
A. Interests
2. B. Dreams
C. Fears
D. Locations
AI-powered chatbots can provide immediate responses to customer queries, enhancing overall
_____ satisfaction.
A. Employee
3.
B. Competitor
C. Customer
D. shareholder
Match the AI impact with its description:
1. AI in Education
2. AI in Finance
3. AI in Transportation
4. AI in Agriculture
A. Enhances personalized learning experiences for students.
B. Improves fraud detection and risk assessment in banking.
4.
C. Enables autonomous vehicles and optimizes traffic flow.
D. Enhances crop monitoring and yields prediction.

A. 1 - A, 2 - B, 3 - C, 4 – D
B. 1 - B, 2 - A, 3 - C, 4 – D
C. 1 - A, 2 - C, 3 - B, 4 – D
D. 1 - A, 2 - B, 3 - D, 4 – C
 Which of these is a key feature of AI programming compared to traditional programming?
A. Predicting outcomes based on past data
5. B. Relying only on explicitly defined rules
C. Ignoring data to make decisions
D. Using fixed logic to solve problems
Which of the following best defines Artificial Intelligence?
A. The ability of a machine to perform tasks without programming
6. B. Programming machines to solve problems without any data
C. The simulation of human intelligence in machines
D. Creating systems that operate without human input
In the rational agent approach, the goal is to make the best decision possible given the _______
situation.
A. Past
7.
B. future predicting
C. current
D. All of the mentioned

_____________teaches a computer how to make inferences and conclusions based on previous

experience
8. A. Data Processing
B. Machine Learning
C. Algorithm Design
D. Automate Reasoning

In which domain the algorithms attempt to comprehend an image by dividing it and analyzing
various elements of the objects.
9. A. Data Mining
B. Machine Learning
C. Natural Language Processing
D. Computer Vision
Which of the following accurately completes the sentence: Artificial Intelligence (AI) is a process of
making a computer, robot, or other object think like a smart _________?
A. Machine
10.
B. Animal
C. Human
D. Algorithm
AI is capable of thinking and acting _________ like human
A. Irrational
11. B. Static
C. Rational
D. Immediate
 Which of the following programming languages is not used in the field of AI?

A. PROLOG
12. B. LISP
C. Python
D. Perl

What is a common technique used for problem-solving in AI that involves

simulating the behavior of natural evolution?

A. Genetic algorithms
13.
B. Expert systems
C. Neural networks
D. Reinforcement learning

____________ find sequence of actions that achieve goals.

A. Sequence agents
14. B. Goal agents
C. Solution agents
D. Problem Solving Agent

Which component of a search algorithm is responsible for defining the transitions

between states?

A. Initial State
15.
B. Goal State
C. Transition Function
D. Search Space

What distinguishes the initial state from the goal state in search algorithms?

A. The initial state is the final outcome

16. B. The goal state is randomly chosen
C. The initial state provides the starting point
D. The goal state is constantly changing
 How does a search algorithm help in finding a path from the initial state to the goal
state?

A. By skipping intermediate states

17.
B. By mapping all possible paths at once
C. By exploring the state space systematically
D. By keeping the goal state hidden

What is the primary function of a search algorithm in AI?

A. To generate random solutions

18. B. To find the optimal path
C. To modify the initial state
D. To avoid exploring the state space

Which term describes the space of possible solutions that are explored in search
algorithms?

A. Outcome Space
19.
B. State Space
C. Action Space
D. Search Space

Which data structure represents the state space in search algorithms?

A. Queue
20. B. Stack
C. Search Tree
D. Linked List

S.No Questions
1. Define Artificial Intelligence
2. Define Rationality.
3. Define Agent.
4. Outline Agent Program.
5. List out the steps in Problem – solving Process.
6. Compare Path Cost and Step Cost.
7. Comment the usage of Evaluation Function
8. What is the Branching Factor?
9. Define Heuristic Function.
10. List out the types of uninformed Search Strategies
 11. Define Iterative deepening Search
12. List out the ways to evaluate an algorithm’s performance
13. Compare and Contrast BFS and DFS
14. Define Bidirectional Search
Represent the Following Agent PEAS Description
15. Taxi Driver Agent

S.N Questions
o
1. Explain in detail about different types of Environments
2. Explain Agent Program and its types in detail
3. Find the Characteristics of following Environment
Crossword puzzle
Taxi driving
Chess Game
4. Represent the Following Agent PEAS Description
Taxi Driver Agent
Medical Diagnosis System
Part-Picking Robot
Interactive English Tutor
5. Discuss the Various applications of Artificial intelligence with examples.
6. Define Vacuum World Problem and Formulate it as Grid world problem
7. Explain two types of Problem Solving Approach to Typical AI problems.

8. Explain and solve 8 puzzle problems using uninformed search and Draw the
state space representation of 8 Puzzle problems.
9. Define 8-Queen’s Problem and provide a Solution

10. Water jug problem : You are given two jugs, a 4 gallon jug and 3 gallon jug .
Neither has measuring markers on it. There is a pump that can be used to fill
the jug with water. How can you get exactly 2 gallons of water in the 4 gallon
jug? Explain the above solution with production rules and state space
representation diagrams.
11.
The Missionaries and Cannibals Problem: On one bank of a river are three
missionaries and three cannibals find themselves and need to cross the river.
The only boat available holds only two at a time. And If the cannibals ever
outnumber the missionaries on either of the river’s banks, the missionaries will
get eaten.How can everyone get across the river without the missionaries
risking being eaten? Explain the above solution with production rules and state
space representation diagrams.
 CO2

S.No Questions-A
What is the DFS traversal of the following graph starting from vertex A?

A
/\
B C
/\
1.
D E

A. A,B,D,E,C
B. A,C,B,D,E
C. A,D,B,E,C
D. A,B,E,D,C
Consider a search problem where the goal is to reach a destination node from a start node in
the minimum number of steps. Which search algorithm is guaranteed to find the shortest path if
all edges have the same cost?

2. A. DFS
B. BFS
C. GREEDY BEST FIRST SEARCH
D. UNIFORM COST SEARCH

Which of the following is true about Depth-First Search (DFS)?

A. DFS is complete and optimal for all types of graphs.

3. B. DFS is neither complete nor optimal.
C. DFS is complete if the search tree is finite.
D. DFS is optimal for finding the shortest path in unweighted graphs.

Which of the following statements best describes Uniform Cost Search (UCS)?

A. UCS explores the node with the lowest cost from the start node
4. B. UCS explores all nodes at the same depth before moving to the next depth.
C. UCS uses a heuristic function to estimate the path cost to the goal.
D. UCS can be used only in weighted graphs.
 The closed list prevents the search algorithm from _____ nodes that have already been
explored.

5. A. Revisiting
B. Deleting
C. Inserting
D. Expanding

Bidirectional Search explores the search space from both the _____ and _____ simultaneously.

A. top, bottom
6. B. left, right
C. start, goal
D. front, back

In the A* search algorithm, which of the following is true for the evaluation function f(n)?

A. f(n)=g(n)+h(n), where g(n) is the path cost and h(n) is the heuristic estimate
7. B. f(n)=h(n), where h(n) is the heuristic estimate
C. f(n)=g(n), where g(n) is the path cost
D. None of the mentioned

What is a potential drawback of Best-First Search?

A. It guarantees finding the optimal solution.

8. B. It may get stuck in local optima.
C. It requires extensive memory.
D. It is only applicable to acyclic graphs.

Which of the following Local Search Algorithms are best suited for solving Optimization
Problems with large, continuous search spaces and high dimensionality?

9. A. Hill Climbing
B. Simulated Annealing
C. Tabu Search
D. Genetic Algorithms

Which local search algorithm iteratively moves from one solution to a

neighboring solution with higher value, eventually reaching a peak?

A. Genetic Algorithm
10.
B. Hill Climbing
C. Simulated Annealing
D. Tabu Search
 What is the primary goal of local search algorithms for CSPs?

A. Finding a complete assignment

11. B. Finding an optimal solution
C. Finding a feasible solution
D. Finding a consistent solution

____________algorithm goes for deep down searching and sometime it may go to the infinite
loop.

12. A. BFS
B. DFS
C. BI-DIRECTIONAL
D. ALL OF THE ABOVE

________________is the flat area of the search space in which all the neighbour states of the
current state contains the same value in hill climbing algorithm

13. A. Plateau
B. Ridge
C. Local maximum
D. Global minimum

What is the main difference between BFS and DFS?

A. BFS explores as deep as possible before backtracking, while DFS

explores level by level.
14. B. BFS uses a stack, and DFS uses a queue.
C. BFS explores level by level, while DFS explores as deep as possible
before backtracking.
D. BFS is faster than DFS.

Which of the following is a primary characteristic of Greedy Best-First Search?

A. It is both complete and optimal.

15. B. It uses a heuristic function and always finds the optimal solution.
C. It is uninformed and does not rely on any heuristic.
D. It expands nodes with the lowest heuristic cost estimate.
 Which problem is defined by a set of variables, each with a domain of possible values, and a set
of constraints specifying allowable combinations of values for subsets of variables?

A. Breadth-First Search
16.
B. Genetic Algorithm
C. Constraint Satisfaction Problem (CSP)
D. A* Algorithm

Which stage in problem-solving involves defining the problem, identifying the initial state, and
setting the goal state?

A. Problem Formulation
17.
B. Problem Representation
C. Problem Space
D. Problem Analysis

If a problem has 10 variables and each variable can take 5 possible values, how many possible
solutions exist?

A. 10
18.
B. 50
C. 100
D. 500

Local search algorithms explore the _____ of the current solution to find better solutions.

A. Constraints
19. B. neighbors
C. objectives
D. variables

Which one is not true about Uniform cost Search?

1. Measures cost to each node

20. 2. Not Optimal
3. Complete
4. Both optimal and complete

S.No Questions-B

1. List out the types of uninformed Search Strategies

2. List out the types of Informed Search Strategies
 3. Compare and Contrast BFS and DFS
4. Define Bidirectional Search
5. Define Global Maximum and Global Minimum
6. Define Local Search
7. Define Ridges
8. List out the drawbacks of Hill-Climbing Search.
9. Define Annealing process
10. Define Evolutionary Algorithm
11. What is Sensor less Problem?
12. Define Exploration Problem
13. Define Online Search Problem
14. Define the process of Genetic Algorithm
15. Describe Stochastic Game

S.No Questions-C
1. Explain in detail about Uninformed Search Strategies
Discuss about
2. Greedy best-first Search
A* Search
Briefly discuss Best First Searching strategies. Solve the following problem by using that

3.

h(n) : A – 366 , B-374,C-329,D-244,E-253,F-178,G-193,H-98,I-0

 Describe in detail about A* algorithm and solve the following problem using it.

4.

5. Compare the performance of uninformed Search Strategies

6. Explain in detail about the Local Search Algorithms
7. Discuss about Simulated Annealing Process
8. Discuss about Genetic Algorithms
9. Discuss Constraint Satisfaction problem with an algorithm for solving a crypt arithmetic Problem
10. Formulate the map coloring problem as a constraint satisfaction problem
11. Explain in detail about the Hill climbing Local search algorithm.