IES’S Management College and Research Centre, Mumbai

(FINAL EXAMINATION)
Date : 22/09/2021 Day: Wednesday Time : 11.00 am To 130 pm Duration: 2 ½ hrs.

Program: PGDM Term: IV Course: Artificial Intelligence Max Marks: 60

-------------------------------------------------------------------------------------------------------------------------------------------------------
Instructions:
1)Question No.1 is compulsory (10 marks)
2) Attempt any FIVE from Q2 to Q8 (10 marks each)
3)Assume any suitable data wherever required

------------------------------------------------------------------------------------------------------------------------------------------------------
Q. No. (Questions) (Marks) COs
1.A Select the correct alternative from the given options ( 5 x 1mark) 05 CO2,
CO3
1. A heuristic is a way of trying __________

(A). To discover something or an idea embedded in a program

(B). To search and measure how far a node in a search tree seems to be from a goal
(C). To compare two nodes in a search tree to see if one is better than the other is
(D). All of the mentioned

2. An algorithm A is admissible if ___________

(A). It is not guaranteed to return an optimal solution when one exists

(B). It is guaranteed to return an optimal solution when one exists
(C). It returns more solutions, but not an optimal one
(D). It guarantees to return more optimal solutions

3. What is the use of the Hidden Markov Model?

(A). Speech recognition
(B). Understanding of the real world
(C). Both A and B
(D). None of these

4. According to the alpha-beta pruning, select the value assigned to alpha and beta?
(A). Alpha = max
(B). Beta = min
(C). Beta = max
(D). Both A and B
(E). None of the above

5. Which of the following is perceptron?

(A) a neural network that contains feedback
(B) an auto-associative neural network
(C) a double layer auto-associative neural network
(D) a single layer feed-forward neural network with pre-processing

1 B) 05
Explain the significance of Information Gain and Entropy in Decision Trees.

Page 1 of 2
2. Calculate the optimum path and the cost for the given graph using A* algorithm (‘S’ is the 10 CO3
start state and ‘G’ is the Goal state

3. Explain the working of BFS for the given graph. Analyze its Time and Space complexities. 10 CO2

4. A) Define Agents in AI. 5 CO1,

B) Write short notes on Goal based and Utility based agents 5 CO3

5. Explain the MiniMax algorithm with the help of pseudocode. 10 CO1

6. Write short note on: 10 CO2

1) Decision Trees
2) Admissibility of A* algorithm with example.
7 Explain the differences and similarities between biological neuron and Artificial neuron with 10 CO1
the help of a neat diagram. Discuss any 2 applications of AI in real world.
8. Explain in detail Convolutional neural network. What are its applications in real world? 10 CO2

Page 2 of 2