R.M.K.
ENGINEERING COLLEGE
(An Autonomous Institution)
RSM Nagar, Kavaraipettai– 601 206
Question Bank for the Units – I & II
SE00 6th Semester – B.E. / B.Tech.
BR0 Computer Science and Business Systems
0
SU00 20CB603– Artificial Intelligence (Lab Integrated)
CO1
Understand the main approaches to artificial intelligence.
#
Explore areas of application such as knowledge representation, natural
CO2
language processing and expert systems.
#
CO3 Develop abilities to apply, build and modify decision models to solve real
# problems.
CO4
Design good evaluation functions and strategies for game playing
#
CO5
Discuss the core concepts and algorithms of searching
#
CO6
#
Part-A (10 x 2 = 20 Marks) KLev S/
CO
el A
1. What is artificial intelligence? K1 CO1 S
1. List out some tasks in AI. K1 CO1 S
1. What is underlying assumption? K1 CO1 S
1. List out 3 common AI techniques. K1 CO1 S
1. Define Intelligent Agent. K1 CO1 S
2. What is percept? K1 CO1 S
2. Compare action and action function. K1 CO1 S
2. Define rational agent. K1 CO1 S
2. Define Rational Agent K1 CO1 S
2. What is nature of environment? K1 CO1 S
3. What do you mean by specifying the task environment? K1 CO1 S
3. List out the properties of task environment. K1 CO1 S
3. What is structure of agent? K1 CO1 S
3. List out the types of agent. K1 CO1 S
3. Define problem, Problem space and search. K1 CO1 S
4. Define production systems. K1 CO1 S
4. List down the advantages of BFS algorithm. K1 CO1 S
4. What are the drawbacks of BFS algorithm? K1 CO1 S
4. Define Heuristic Search. Give Example. K1 CO1 S
4. List out the steps to solve problem using Heuristic Search. K1 CO1 S
5. List down the characteristics of a problem. K1 CO1 S
5. List out the characteristics of production systems. K1 CO1 S
5. List out the issues in design of search program. K1 CO1 S
5. Define partially commutative production system. K1 CO1 S
5. What is monotonic reasoning in AI? K1 CO1 S
6. Define goal formulation. K1 CO2 S
6. Define problem formulation. K1 CO2 S
6. Define search tree. K1 CO2 S
6. What is expanding and generating K1 CO2 S
6. What is the difference between child node and parent node? K1 CO2 S
7. Define frontier. K1 CO2 S
7. Define search strategy. K1 CO2 S
7. What is a loopy path? K1 CO2 S
7. List out the types of uninformed search. K1 CO2 S
7. List out some types of informed types of search. K1 CO2 S
8. What is the time and space complexity of BFS? K1 CO2 S
8. What is the time and space complexity of DFS? K1 CO2 S
8. What is the use of predetermined depth limit in depth limited search? K1 CO2 S
8. What do you mean by bidirectional search? K1 CO2 S
8. What are the four important criteria in any search algorithm? K1 CO2 S
9. What is heuristic function? K1 CO2 S
9. What is the use of greedy best first search? K1 CO2 S
9. What do you mean by hSLD? K1 CO2 S
9. Define absolute error? K1 CO2 S
9. Define relative error? K1 CO2 S
10. What is the use of recursive best first search? K1 CO2 S
10. Define MA* algorithm. K1 CO2 S
10. Define SMA* algorithm. K1 CO2 S
10. What is local search? K1 CO2 S
10. What is the need for optimization? K1 CO2 S
Part – B ( 5 x 13 = 65 Marks)
11.a. Explain underlying assumption with example. K1 CO1 S
11.a. Explain techniques in artificial intelligence with example. K1 CO1 S
11.a. Explain Tic – Tac – Toe with and how to find solution for it. K1 CO1 A
11.a. Explain Intelligent Agents with block diagram and example. K1 CO1 S
11.a. Explain simple agent function for painting a wall with blue colour. K1 CO1 A
11.b. Explain rationality and how it reacts with environment with example. K1 CO1 S
11.b. Explain the properties of task environment in detail with examples. K1 CO1 S
11.b. Explain the structure of the agent with example. K1 CO1 S
11.b. Explain different types of agent with example. K1 CO1 S
11.b. Compare different types of agents and its features. K1 CO1 A
12.a. Explain water jug problem with solutions. K1 CO1 A
12.a. Explain production systems with example. K1 CO1 S
12.a. Explain BFS algorithm with advantages, disadvantages and examples. K1 CO1 S
12.a. Explain DFS algorithm with advantages, disadvantages and examples. K1 CO1 S
12.a. Compare BFS and DFS with examples. K1 CO1 S
12.b. Explain Heuristics Search with examples. K1 CO1 S
12.b. Explain the procedure involved in solving problem using heuristic search. K1 CO1 S
12.b. Explain various problem characteristics of problem with example. K1 CO1 S
12.b. Explain production system characteristics of production with examples. K1 CO1 S
12.b. Explain issues in design of search problems with example. K1 CO1 S
13.a.
K1 CO1 A
Perform breadth first search on the above search tree. Consider 1 as root node
and 10 as goal node.
13.a.
K1 CO1 A
Perform breadth first search on the above search tree. Consider 1 as root node
and 11 as goal node.
13.a. Explain problem, problem statement and problem spaces with examples and
K1 S
applications. CO1
13.a. Compare any few properties of task environment in detail with examples. K1 CO1 A
13.a. Give the application how problems can be in natural language processing CO1
K1 A
using AI with examples.
13.b. Explain problem solving agents with examples. K1 CO2 S
13.b. Explain how to search for solutions of a problem and measure performance. K1 CO2 S
13.b. Explain any two uninformed search algorithms. K1 CO2 S
13.b. Explain breadth first search algorithm in detail with examples. K1 CO2 S
13.b. Explain depth first search algorithm in detail with examples. K1 CO2 S
14.a. Explain depth limited search algorithm in detail with examples. K1 CO2 S
14.a. Explain bidirectional search algorithm in detail with examples. K1 CO2 S
14.a. Compare the performance of uninformed search algorithms. K1 CO2 A
14.a. Explain any two informed search algorithms in detail. K1 CO2 S
14.a. Explain greedy best first search algorithm in detail with examples. K1 CO2 S
14.b. Explain A* search algorithm in detail with example. K1 CO2 S
14.b. Explain AO* search algorithm in detail with example. K1 CO2 S
14.b. Explain memory bounded heuristic algorithms in detail with example. K1 CO2 S
14.b. Explain recursive best first search algorithm in detail with example. K1 CO2 S
14.b. Compare informed and uninformed search algorithms. K1 CO2 A
15.a. Explain any two local search and optimization algorithms with example. K1 CO2 S
15.a. Explain hill climbing algorithm in detail with example. K1 CO2 S
15.a. Explain simulated annealing search algorithm in detail with example. K1 CO2 S
15.a. Explain local beam search algorithm in detail with example. K1 CO2 S
15.a. Compare the performance of search and optimization algorithms. K1 CO2 A
15.b. Compare hill climbing and best first search algorithms. K1 CO2 A
15.b. Compare hill climbing and simulated annealing algorithms. K1 CO2 S
15.b. Solve the below search tree by using AO* search algorithm. Assume h(n) for K1 CO2 A
each node is given for each node.
15.b. Solve the below search tree by using breadth first search algorithm. Assume 1
as initial node and 12 as goal node.
K1 CO2 S
15.b. Solve the below search tree by using depth limited search algorithm. Assume
1 as initial node and 12 as goal node and predefined depth limit as 2. Analyze
the reason why we cannot reach goal node in this case.
CO2
K1 S
Part – C ( 1 x 15 = 15 Marks)
16.a. Solve 8 queens problem using backtracking. K1 CO1 A
16.a. Solve 8 puzzle problem with following information given
CO1
K1 A
16.a.
CO2
K1 A
Find the optimal route between source node (S) and goal node (I) using best
first search.
16.a.
K1 CO2 A
Using greedy approach find the route between start node (S) and goal node
(E) using greedy approach.
16.a.
K1 CO2 A
Find the shortest path between Arad and Bucharest in the map of
Romania given above. Use appropriate algorithms.
16.b.
K1 CO2 A
In the above graph perform heuristic search to find route between S to G.
Explain the logic behind it.
16.b.
K1 CO2 A
Using AO* algorithm find the cost between route ABE.
16.b. Explain simplified memory bounded A* algorithm with example. K1 CO1 A
16.b. Explain memory bounded A* algorithm with example. K1 CO1 A
16.b. Using hill climbing algorithm find the route between S and M K1 CO1 A
