4.question Bank
4.question Bank
IT Department
UNIT 1 : Introduction
3 Differentiate Hill climbing and Best First search method. (Winter - 2018) CO1
What is the production system? Explain it with an
example.
4 Discuss the characteristics of a production system. (Winter - 2018) CO1
Explain mean-end analysis approach to solve AI
5 problems. (Winter - 2018) CO1
What do you mean by admissibility of an algorithm?
6 Is A* algorithm an admissible one? When? (Winter - 2018) CO1
7 What is the state space of a problem? (Summer - 2018) CO1
Describe Breadth First Search. Comment on the
8 optimality of this method. (Summer - 2018) CO1
In the Missionaries and Cannibals Problem, three
missionaries and three cannibals
must cross a river using a boat which can carry at most
two people, under the
constraint that, Number of cannibals should be lesser than
the missionaries on
either side. The boat cannot cross the river by itself with
no people on board.
For the above mentioned problem, describe state space
representation,actions,
9 start and end state. (Summer - 2018) CO1
Describe heuristic function for the Traveling Salesman
10 Problem. (Summer - 2018) CO1
11 Discuss with example: Constraint Satisfaction Problem. (Summer - 2018) CO1
What is meant by “control strategy”? State the
requirements of a good (Winter - 2019)
12 control strategy. (Winter - 2021) CO1
Explain what is meant by “Production System” with
respect to AI. (Winter - 2019)
13 Discuss the components of a Production System. (Winter - 2020) CO1
Explain how a problem can be analyzed based on its
characteristics.
Analyze the game of “8-Puzzle” based on these
14 characteristics. (Winter - 2019) CO1
15 Differentiate between Breadth First Search and Best First (Winter - 2019) CO1
Search.
What is a heuristic? What care should you take while (Winter - 2019)
designing a (Summer - 2019)
16 heuristic function? (Summer - 2020) CO1
(Winter - 2019)
17 Explain Problem Reduction using “AND-OR” graph (Winter - 2020) CO1
(Summer - 2019)
(Summer - 2020)
18 Discuss limitation of hill-climbing method. (Winter - 2021) CO1
Discuss A* algorithm. Also give one example to explain
it.OR
Take any instance of 8 Puzzle problem and show its (Summer - 2019)
19 solution with A* algorithm. (Summer - 2020) CO1
How do you compare Hill climbing technique with A*
20 algorithm. (Summer - 2020) CO1
(Summer - 2020)
21 Discuss Best first search technique. (Winter - 2021) CO1
Explain A*algorithm. What happens if h’ underestimates
22 h and overestimates h? (Winter - 2021) CO1
Differentiate Informed & Uninformed search Give
23 examples. (Winter - 2021) CO1
(Winter - 2018)
1 Explain Bay’s theorem (Winter - 2020) CO3
2 Differentiate Fuzzy logic and Crisp logic. (Summer - 2018) CO3
(Summer - 2018)
(Summer - 2019)
3 Discuss various defuzzification methods. (Winter - 2021) CO3
Differentiate Fuzzy logic and Crisp logic. Also describe
set operations on fuzzy
4 and crisp logic. (Summer - 2019) CO3
Explain the difference between Boolean and Fuzzy Set
membership using a (Winter - 2019)
5 suitable example. (Winter - 2020) CO3
What is the importance of Fuzzy logic? How do you
perform union,
6 intersection and complement operation on the Fuzzy sets? (Summer - 2020) CO3
(Winter - 2018)
1 Discuss Alpha-Beta cutoffs procedure in game playing. (Winter - 2019) CO3
(Winter - 2018)
(Winter - 2019)
(Summer - 2019)
(Winter - 2020)
2 Explain Min Max procedure in game playing. (Winter - 2021) CO3
(Winter - 2019)
What is “iterative deepening”? How is it useful in time (Summer - 2019)
3 constrained search? (Summer - 2020) CO3
Explain alpha-beta cut off search with an example. State a
4 case when to do alpha pruning. (Winter - 2020) CO3
UNIT 7 : Planning