ASSIGNMENT-I Department of
Aug.- 2025 Computer
Applications
BCA-3rd B
Introduction to Artificial Intelligence
(BCA24307)
Max. Marks:24
Questions to be attempted
Set-A Q.no.1,2,11,12,21,22,31,39,46
Roll NO. 2412300, 2412306, 2412314, 2412315, 2412316, 2412320, 2412322, 2412325, 2459388, 2412327,
Q. No. 2412329, 2412330, 2412334, 2412336, 2412339, 2412354, 2412356, 2412365, 2412368, 2412371, 2412372, CO
2412377, 2412382, 2412383, 2412385, 2412387, 2412395, 2412398, 2412402, 2412406, 2412299
Set-B Q.no. 3,4,13,15,23,24,32,40,47
Roll NO. 2412297, 2412301, 2412302, 2412303, 2412304, 2412305, 2412307, 2412310, 2412312,
2412317, 2412318, 2412321, 2412323, 2412324, 2412328, 2412331, 2412332, 2412344, 2412347,
2412351, 2412352, 2412358, 2412359, 2412373, 2412375, 2412376, 2412380, 2412384, 2412386,
2412389, 2412392, 2412397, 2412399, 2412401, 2412404, 2412408, 2412411
Set-C Q.no. 8,9,18,20,29,30,35,41,48
Roll NO. 2412296, 2412298, 2412309, 2412313, 2412333, 2412338, 2412341, 2412342, 2412345,
2412346, 2412349, 2412353, 2412355, 2412357, 2412362, 2412363, 2412369, 2412374, 2412378,
2412379, 2412393, 2412394, 2412396, 2459390, 2412400, 2412403, 2412405, 2412409, 2412412, 2412413
Section A (2 marks each)
1 Define Artificial Intelligence in simple terms.
2 What is an intelligent agent in AI?
3 Name any two types of environments in which agents operate.
4 What does “rationality” mean in the context of intelligent agents? CO1
5 Mention two characteristics of a rational agent.
6 Explain the structure of intelligent agent.
7 What are the main components of an agent’s structure?
8 Elucidate knowledge-based agent?
9 Give two examples of problems that can be solved using problem-solving agents.
10 List the difference between single agent and multi agent.
11 Differentiate informed and uninformed search?
12 Define Depth First Search (DFS).
13 List any two advantages of Breadth First Search (BFS).
14 What is the main advantage of Iterative Deepening Search over DFS and BFS?
CO2
15 Name any two uninformed search algorithms.
16 Define Best-First Search and mention one application.
17 What is the heuristic function and its formula in A* search?
18 Outline any two advantages of A* search over BFS.
19 What does AO* search algorithm solve that A* cannot?
20 Give one real-life example where AO* search can be applied.
21 What is adversarial search in AI?
22 Define the minimax search algorithm.
23 What is the main purpose of alpha-beta pruning in game search?
24 CO3
List two advantages of using alpha-beta pruning in minimax search.
25 What is a constraint satisfaction problem (CSP)? Give one example.
26 What are the components required to define a CSP.
27 What is backtracking search in CSP solving?
28 Mention one advantage and one disadvantage of backtracking search.
29 Explain the two examples of real-world problems that can be modeled as CSPs.
30 How does alpha-beta pruning improve the efficiency of minimax search?
Section-B (4 marks each)
31 Define Artificial Intelligence and describe any two real-life applications of AI.
32 Explain the concept of an intelligent agent and describe its relationship with the environment.
33 Discuss the concept of rationality in AI? Give an example of a rational agent in a real-world scenario. CO1
34 Write down the four properties that determine the nature of an environment in which agents operate.
35 What is a knowledge-based agent? Explain its main components.
36 Elaborate the working of a problem-solving agent with the help of a suitable example.
37 Distinguish BFS and DFS with one example of each.
38 Describe the working of Depth-First Search (DFS) and list two of its advantages and disadvantages.
39 Explain Breadth-First Search (BFS) with an example and discuss its time and space complexity.
CO2
40 What is Iterative Deepening Search? Explain why it is preferred in certain situations over DFS and
BFS.
41 (A) Describe the working of A* search algorithm.
(B) Explain the Best first search technique.
42 What is AO* search? Describe a scenario where it is more suitable than A*.
43 Explain the minimax search algorithm with an example in detail
44 What is alpha-beta pruning? Describe how it improves the performance of minimax search.
45 Define a constraint satisfaction problem (CSP) and explain its three main components with examples. CO3
46 Describe the backtracking search method for solving CSPs and give one real-life application.
47 Compare minimax search and alpha-beta pruning in terms of efficiency and outcome.
48 Explain how a real-world problem such as a Sudoku puzzle can be modeled and solved as a
CSP.
