University of Mumbai

Examination 2020 under cluster 3 (FCRIT)

Program: Computer Engineering
Curriculum Scheme: Rev2016
Examination: Second Year Semester VII
Course Code: and Course Name: Artificial Intelligence and Soft Computing
Time: 1 hour Max. Marks: 50
=====================================================================

For the students:- All the Questions are compulsory and carry equal marks .
Q1. Which of the following capability need to possess by the computer in Turing Test
Approach.
Option A: Preprocessing
Option B: Automated Reasoning
Option C: Programming
Option D: Cognitive Modeling

Q2. To perceive and act upon the environment which components are required?
Option A: Perceiver and Sensor
Option B: Perceiver
Option C: Sensors
Option D: Sensors and Actuators

Q3. List out the core components of soft computing.

Option A: Neural Science and Genetic Science
Option B: Artificial Intelligence and Neural Science
Option C: Fuzzy Computing, Neural Computing, Genetic Algorithms
Option D: Fuzzy Networks and Artificial Intelligence

Q4. Greedy algorithm chooses the node for expansion in __________

Option A: The one closest to the goal node.
Option B: Shallowest
Option C: Deepest
Option D: Minimum heuristic cost

Q5. The time and space complexity of BFS is

Option A: O(b^2) and O(d^2)
Option B: O(d^2) and O(d^2)
Option C: O(d^2) and O(b^2)
Option D: O(bd+1) and O(bd+1)

Q6. Select heuristic function of A* Algorithm

Option A: f(n) != h(n)+g(n)
Option B: f(n) < h(n)+g(n)
Option C: f(n) =h(n)+g(n)
Option D: f(n) >h(n)+g(n)

Q7. State the terminate condition of Hill-Climbing algorithm.

1|Page
 University of Mumbai
Examination 2020 under cluster 3 (FCRIT)
Option A: Shallowest Node
Option B: No neighbor has higher value
Option C: Global Min/Max is achieved
Option D: Stopping criterion met

Q8. Which is the incorrect property of representation of knowledge from following options?
Option A: Representational Verification
Option B: Inferential Efficiency
Option C: Representational Adequacy
Option D: Referential Integrity

Q9. A term with no variables is called………..

Option A: Null Term
Option B: Ground term
Option C: Predicate Term
Option D: Zero Term

Q10. Translate the following statement into FOL.“For every S, if S is a philosopher, then S is an
Intelligent
Option A: ∃ S philosopher(S) → intelligent(S)
Option B: ∀ S philosopher(S) → intelligent(S)
Option C: ∀ a philosopher(a)→ scholar(a)
Option D: ∃ S philosopher(a) → intelligent(S)

Q11. _____________ algorithms that can take out the plan utilizing a planning graph,
instead of using graph to provide heuristic.
Option A: BFS/DFS
Option B: A*
Option C: Graph-Plan
Option D: Greedy

Q12. In partial order plan.

A. Relationships between the actions of the behavior are set prior to the actions
B. Relationships between the actions of the behavior are not set until absolutely
necessary.
Option A: A is true
Option B: B is true
Option C: Either A or B can be true depending upon situation
Option D: Neither A nor B is true

Q13. The following are available in Planning graph.

Option A: Sequence of Levels
Option B: Literals
Option C: Variables
Option D: Heuristic Estimates

2|Page
 University of Mumbai
Examination 2020 under cluster 3 (FCRIT)
Q14. If P and Q are two fuzzy sets with membership functions:

μp(χ) ={0.2,0.5.,0.6,0.1,0.9}

μq (χ)= {0.1,0.5,0.2,0.7,0.8}

then the value of μp ∩ μq will be

Option A: {0.2,0.5,0.6,0.7,0.9}
Option B: {0.2, 0.5,0.2, 0.1,0.8}
Option C: {0.1, 0.5, 0.6, 0.1,0.8}
Option D: {0.1, 0.5, 0.2, 0.1,0.8}

Q15. Suppose, a fuzzy set Young is defined as follows: Young = {(15,0.5), (20,0.8), (25,0.8),
(30,0.5), (35,0.3) } then using MOM find the age of youngest person.
Option A: 15
Option B: 30
Option C: 22.5
Option D: 25

Q16. if A1 = {(x1, 0.9),(x2, 0.5),(x3, 0.2),(x4, 0.3)}

and A0.3 = {(x1, 1),(x2, 0),(x3, 0),(x4, 0)} then lamda cut is

Option A: {x1,x2,x3}
Option B: {x1,x2,x4}
Option C: {x2,x3}
Option D: {x1,x2,x3,x4}

Q17. The weights W1, W2, W3, ..., Wm are weight values normalized in the range
Option A: {0,1}
Option B: {-1,1}
Option C: Either {0,1} or {-1,1}
Option D: Neither {0,1} 0r {-1,1}

Q18. Detemine the threshold T at which the MP neuron fires for AND NOT function
using for the following truthtable
X1: 0 0 1 1
X2: 0 1 0 1
Y: 0 0 1 0
Option A: T >=1
Option B: T<=0
Option C: T>1

3|Page
 University of Mumbai
Examination 2020 under cluster 3 (FCRIT)
Option D: T<0

Q19. Which of the following is not a Characteristic of Expert Systems?

Option A: Vague domain
Option B: Adequate Response time
Option C: PROLOG and LISP
Option D: Justified Reasoning

Q20. A ______ is nothing but an expert system without knowledge base.

Option A: shell
Option B: Expert System
Option C: Tools
Option D: Knowledge

Q2 and Q3. Solve any Two Questions out of Three 10 marks each
(20 Marks Each)
1 Compare following informed searching algorithms based on performance
measure with justification: Complete, Optimal, Time complexity and Space
complexity
a) Greedy best first
b) A*
c) Recursive best-first (RBFS)

2 Design a Mc-Culloh Pitts model for XOR Gate.

3 What are the basic building blocks of Leaning Agent? Explain each of them
with neat block diagram

Principal

4|Page