DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

Multiple Choice Questions:

[404 BA] – [Artificial Intelligence in Business Applications]

Unit-I

Introduction to AI and Programming Tools

Q.No Question Answer

Artificial Intelligence is about_____.
a. Playing a game on Computer

1 b. Making a machine Intelligent

c. Programming on Machine with your Own Intelligence B

d. Putting your intelligence in Machine

Who is known as the -Father of AI"?

a. Fisher Ada
2
b. Alan Turing C
c. John McCarthy

d. Allen Newell

Select the most appropriate situation for that a blind search can be
used.
a. Real-life situation
3 B
b. Small Search Space

c. Complex game

d. All of the above

The application/applications of Artificial Intelligence is/are

a. Expert Systems

4 b. Gaming D
c. Vision Systems

d. All of the above

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

Among the given options, which search algorithm requires less

memory?
5 a. Optimal Search B

b. Depth First Search

c. Breadth-First Search

d. Linear Search

6 If a robot is able to change its own trajectory as per the external

conditions, then the robot is considered as the__
a. Mobile
D
b. Non-Servo

c. Open Loop

d. Intelligent

Which of the given language is not commonly used for AI?

a. LISP
D
7 b. PROLOG

c. Python

d. Perl

A technique that was developed to determine whether a machine could

or could not demonstrate the artificial intelligence known as the___
a. Boolean Algebra
B
8 b. Turing Test

c. Logarithm

d. Algorithm

The component of an Expert system is_________.

a. Knowledge Base

9 b. Inference Engine D
c. User Interface

d. All of the above

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

10 Which algorithm is used in the Game tree to make decisions of

Win/Lose?
a. Heuristic Search Algorithm
D
b. DFS/BFS algorithm

c. Greedy Search Algorithm

d. Min/Max algorithm

The available ways to solve a problem of state-space-search.

a. 1

11 b. 2 B
c. 3

d. 4

Among the given options, which is not the required property of

Knowledge representation?
a. Inferential Efficiency
C
12 b. Inferential Adequacy

c. Representational Verification

d. Representational Adequacy

An AI agent perceives and acts upon the environment using___.

a. Sensors
D
13 b. Perceiver

c. Actuators

d. Both a and c

Which rule is applied for the Simple reflex agent?

a. Simple-action rule

14 b. Simple &Condition-action rule C

c. Condition-action rule

d. None of the above

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

Which agent deals with the happy and unhappy state?

15 A
a. Utility-based agent

b. Model-based agent

c. Goal-based Agent

d. Learning Agent

Rational agent always does the right things.

a. True
16 A
b. False

17 Which term describes the common-sense of the judgmental part of

problem-solving?
a. Values-based D

b. Critical

c. Analytical

d. Heuristic

Which AI technique enables the computers to understand the

associations and relationships between objects and events?
a. Heuristic Processing
18 D
b. Cognitive Science

c. Relative Symbolism

d. Pattern Matching

19 The exploration problem is where______

a. Agent contains the knowledge of State and actions.
B
b. Agent does not contain the knowledge of State and actions.

c. Only actions are known to the agent.

d. None of the above

In the Wumpus World Problem, the reason for the uncertainty is that
20 the agent's sensor gives only__
a. Full & Global information D

b. Partial & Global Information

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

c. Full & local information

d. Partial & local Information

The search algorithm which is similar to the minimax search, but

removes the branches that don't affect the final output is known as__
a. Depth-first search C
21
b. Breadth-first search

c. Alpha-beta pruning

d. None of the above

The maximum depth to which the alpha-beta pruning can be applied.

a. Eight states

22 b. Six states D
c. Ten states

d. Any depth

Among the given options, which is also known as inference rule?

a. Reference

23 b. Reform C
c. Resolution

d. None of the above

Which of the following option is used to build complex sentences in

knowledge representation?
a. Symbols
24 B
b. Connectives

c. Quantifier

d. None of the above

25 Automatic Reasoning tool is used in_____

a. Personal Computers
C
b. Microcomputers

c. LISP Machines

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

d. All of the above

If according to the hypothesis, the result should be positive, but in fact

it is negative, then it is known as_______
26 a. False Negative Hypothesis
B
b. False Positive Hypothesis

c. Specialized Hypothesis

d. Consistent Hypothesis

A hybrid Bayesian Network consist_____

a. Discrete variables only

27 b. Discontinuous Variable C
c. Both Discrete and Continuous variables

d. Continuous Variable only

28 The process of capturing the inference process as Single Inference Rule

is known as:
a. Clauses
C
b. Ponens

c. Generalized Modus Ponens

d. Variables

29 Which process makes two different Logical expressions look identical?

a. Unification

b. Lifting A
c. Inference Process

d. None of the above

30 Which algorithm takes two sentences as input and returns a Unifier?

a. Inference
C
b. Hill-Climbing

c. Unify algorithm

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

d. Depth-first search

The PEAS in the task environment is about__________

a. Peer, Environment, Actuators, Sense
31
b. Performance, Environment, Actuators, Sensors B
c. Perceiving, Environment, Actuators, Sensors

d. None of the above

In state-space, the set of actions for a given problem is expressed by

the___
a. Intermediate States
B
b. Successor function that takes current action and returns next
32
state

c. Initial States

d. None of the above

In which search problem, to find the shortest path, each city must be
visited once only?
a. Map colouring Problem
D
b. Depth-first search traversal on a given map represented as a
33
graph

c. Finding the shortest path between a source and a destination

d. Travelling Salesman problem

In the TSP problem of n cities, the time taken for traversing all cities,
without having prior knowledge of the length of the minimum tour will
be______
34 a. O(n) C

b. O(n2)

c. O(n!)

d. O(n/2)

35 Web Crawler is an example of_____

A
a. Intelligent Agent

b. Problem-solving agent

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

c. Simple reflex agent

d. Model-based agent

36 The main function of problem-solving agent is to_______

a. Solve the given problem and reach the goal

b. Find out which sequence of action will get it to the goal state. C
c. Both a & b

d. None of the above

In artificial Intelligence, knowledge can be represented as______

i. Predicate Logic
ii. Propositional Logic
iii. Compound Logic
iv. Machine Logic

37 a. Both I and II A
b. Only II

c. Both II and III

d. Only IV

38 For propositional Logic, which statement is false?

a. The sentences of Propositional logic can have answers other
than True or False.

b. Each sentence is a declarative sentence. A

c. Propositional logic is a knowledge representation technique in
AI.

d. None of the above

First order logic Statements contains______

a. Predicate and Preposition
39
b. Subject and an Object C
c. Predicate and Subject

d. None of the above

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

A knowledge-based agent can be defined with _____ levels.

40 B
a. 2 Levels

b. 3 Levels

c. 4 Levels

d. None of the above

Ways to achieve AI in real-life are_________.

a. Machine Learning
C
41 b. Deep Learning

c. Both a & b

d. None of the above

The main tasks of an AI agent are______

a. Input and Output

42 b. Moment and Humanly Actions C

c. Perceiving, thinking, and acting on the environment

d. None of the above

The probabilistic reasoning depends upon___________

a. Estimation

43 b. Observations

c. Likelihood D

d. All of the above

44 The inference engine works on ______

a. Forward Chaining

b. Backward Chaining C
c. Both a and b

d. None of the above

45 Which of the given statement is true for Conditional Probability?

C
a. Conditional Probability gives 100% accurate results.

b. Conditional Probability can be applied to a single event.

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

c. Conditional Probability has no effect or relevance on

independent events.

d. None of the above.

After applying conditional Probability to a given problem, we

get______
a. 100% accurate result B
46
b. Estimated Values

c. Wrong Values

d. None of the above

47 The best AI agent is one which____________

a. Needs user inputs for solving any problem

b. Can solve a problem on its own without any human B

intervention

c. Need a similar exemplary problem in its knowledge base

d. All of the above

48 The first AI programming language was called:

a. BASIC
b. FORTRAN C
c. IPL
d. LISP
49 The first widely-used commercial form of Artificial Intelligence (Al) is
being used in many popular products like microwave ovens,
automobiles and plug in circuit boards for desktop PCs. It allows
machines to handle vague information with a deftness that mimics
C
human intuition. What is the name of this AI?
a. Boolean logic
b. Human logic
c. Fuzzy logic
d. Functional logic
50 PROLOG is an AI programming language which solves problems with
a form of symbolic logic known as predicate calculus. It was developed
in 1972 at the University of Marseilles by a team of specialists. Can you A
name the person who headed this team?
a. Alain Colmerauer
b. Nicklaus Wirth
c. Seymour Papert
d. John McCarthy

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

Unit- II

Logic and Inferences

Q.No Question Answer

In Symbolic logic, ________ do not change their value.
a. Variables
1 b. Constants B
c. Inference
d. Implication
2 By using ________, the logical form of an argument becomes explicit.
a. Inferences
b. Syllogism C
c. Symbols
d. none of these
3 Where p is a propositional atom. Which one of the following statements
is true?
a. The formula p is valid and satisfiable A
b. The formula p is invalid and unsatisfiable
c. The formula p is invalid and satisfiable
d. The formula p is valid and unsatisfiable
A formula in propositional logic is called valid if it evaluates to T for all
valuations of its propositional atoms. A sentence in predicate logic is
called valid if it is satisfied by all models. Which one of the following
statements holds?
a. There is a linear time translation from propositional logic formulas
4 C
to predicate logic sentences that preserves validity.
b. B A validity preserving translation from propositional logic formulas
to predicate logic sentences exists, but all such translations require
exponential time in the worst case, w.r.t. the size of the formula
c. C There cannot be a validity preserving translation from
propositional logic formulas to predicate logic sentences.
d. D The problem of finding a validity preserving translation from
propositional logic formulas to predicate logic sentences is un
decidable.
5 What is the logical translation of the following statement?
“None of my friends are perfect”
D

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

Which one of the following options is CORRECT given three positive

integers x, y and z, and a predicate?
6 P(x) = ¬(x=1)∧∀y(∃z(x=y*z)⇒(y=x)∨(y=1)) A
a. P(x) being true means that x is a prime number
b. P(x) being true means that x is a number other than 1
c. P(x) is always true irrespective of the value of x
d. P(x) being true means that x has exactly two factors other than 1 and
x
7 P and Q are two propositions. Which of the following logical
expressions are equivalent?

a. Only I and II
b. Only I, II and III
c. Only I, II and IV
d. All of I, II, III and IV
The following resolution rule is used in logic programming.
Derive clause (P ∨ Q) from clauses (P ∨ R), (Q ∨ ¬R)
Which of the following statements related to this rule is FALSE?
a. ((P ∨ R) ∧ (Q ∨ ¬R)) ⇒ (P ∨ Q) is logically valid A
8 b. (P ∨ Q) ⇒ ((P ∨ R)) ∧ (Q ∨ ¬R)) is logically valid
c. (P ∨ Q) is satisfiable if and only if (P ∨ R) ∨ (Q ∨ ¬R) is
satisfiable
d. (P ∨ Q) ⇒ FALSE if and only if both P and Q are unsatisfiable
A _________ is used to demonstrate, on a purely syntactic basis, that
one formula is a logical consequence of another formula
9 a. Deductive Systems
b. Inductive Systems
A
c. Reasoning with Knowledge Based Systems
d. Search Based Systems
10 Thing to keep in mind while solving is to
a. Input data
b. Output data D
c. Stored data
d. All of above
11 Knowledge represented by a scientist with his text-book based
formulations in the area of natural resource management is known as
a. Traditional knowledge C
b. Tacit knowledge
c. Formal knowledge

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

d. Informal knowledge
What does indigenous knowledge mean according to Seeland and
Schmithusen (1997)?
a. Something is originating locally and performed by a community or
society in this specifies place
A
b. Something is originating locally and performed by a community or
12
society across the time and space
c. Something is originating globally and performed by a community or
society in this specifies place
d. Something is originating globally and performed by a community or
society across the time and space
Which of the following is a knowledge representation technique used to
represent knowledge about stereotype situation?
13 a. Semantic network C
b. Frames
c. Scripts
d. Conceptual Dependency
A Personal Consultant knowledge base contain information in the form
of:
a. Parameters D
b. Contexts
14
c. production rules
d. All of the above
15 … Is a set of mathematical principles for knowledge representation
based on the degree of membership?
a. Formal logic C
b. Informal logic
c. Fuzzy logic
d. Monotonic logic
16 State whether the following statements about the reasoning in AI are
True or False.
i) It is the act of deriving a conclusion from certain properties using the A
given methodology.
ii) It must figure out what it needs to know from what it already knows.
a. i-True, ii-True
b. i-True, ii-False
c. i-False, ii-True
d. i-False, ii-False
17 Is a form of many-valued logic in which the truth values of variables
may be any real number between 0 and 1?
a. default logic D
b. monotonic logic
c. non-monotonic logic
d. fuzzy logic
18 Which of the following is/are the methods of logical reasoning?
i) Deduction D
ii) Induction

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

iii) Abduction
a. i and ii only
b. ii and iii only
c. i and iii only
d. All i, ii and iii
19 Which one from the options would return true/yes for given prolog
program?
Boy (john,123).
Girl (jane,234).
B
Student (john,123).
a. ?- girl(jane,x).
b. ?- boy('john',123).
c. All of above.
d. None of above.
Which are necessary for an agent to solve an online search problem?
a. Actions
20 b. Step-cost function D
c. Goal-test
d. All of the mentioned
21 Which of the following language is a declarative language?
a. Algol
b. Java D
c. C++
d. Prolog
22 What formal system provides the semantic foundation for Prolog?
a. Predicate calculus;
b. Lambda calculus; A
c. Hoare logic;
d. Propositional logic
23 Which one of the following is not a type of polymorphism
a. Coercion
b. Overloading C
c. Overriding
d. All of them are types of polymorphism
24 Which of the following is the advantage of declarative languages over
imperative languages?
a. Can use abstract data type; B
b. Easy to verify the properties of the program;
c. Is more efficient;
d. Can be implemented by an interpreter or compiler;
25 Which one of the following is not a language construct in AspectJ?
a. Point cut
b. Join point B
c. Aspect
d. Advice

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

PROLOG is an AI programming language which solves problems with

a form of symbolic logic known as ______.
a. Propositional logic C
b. Tautology
26
c. Predicate calculus
d. Temporal logic
27 PROLOG, LISP, NLP are the language of ____
a. Artificial Intelligence
b. Machine Learning A
c. Internet of Things
d. Deep Learning
______ that deals with the interaction between computers and humans
using the natural language
28 a. LISP D
b. ELIZA
c. PROLOG
d. NLP
Assuming that + and * are arithmetic operators (addition and
multiplication), to what does the expression 2 + 4 * 5 + 1 evaluate?
29 a. 36. B
b. 31
c. 26
d. 23
What is the value of (map (lambda (x) (* 2 x)) ‟(1 2 3)) ?
a. a run-time error
30 b. ( ) (the empty list) D
c. 12
d. (2 4 6)
_____________ is the smallest microcontrollers which can be programmed
to perform a large range of tasks
31 a. PIC microcontrollers
b. ARM microcontrollers
A
c. AVR microcontrollers
d. ASIC microcontrollers

Unit-III

Problem Solving, Search and Game Techniques

Q.No Question Answer

1 What is the term used for describing the judgmental or commonsense part of
problem solving?
a. Heuristic A
b. Critical
c. Value based

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

d. Analytical
What is the main task of a problem-solving agent?
a. Solve the given problem and reach to goal
2 b. To find out which sequence of action will get it to the goal state
c. All of the mentioned
C
d. None of the mentioned

The problem-solving agent with several immediate options of unknown value

can decide what to do by just examining different possible sequences of
3 actions that lead to states of known value, and then choosing the best A
sequence. This process of looking for such a sequence is called Search.
a. True
b. False
A problem in a search space is defined by one of these states.
a. Initial state A
4 b. Last state
c. Intermediate state
d. All of the mentioned
The process of removing detail from a given state representation is called
______
5 a. Extraction B
b. Abstraction
c. Information Retrieval
d. Mining of data

6 A problem solving approach works well for ______________

a. 8-Puzzle problem
b. 8-queen problem D
c. Finding an optimal path from a given source to a destination
d. Mars Hover (Robot Navigation)
7 Web Crawler is a/an ____________
a. Intelligent goal-based agent
b. Problem-solving agent A
c. Simple reflex agent
d. Model based agent
8 Which is the best way to go for Game playing problem?
a. Linear approach
b. Heuristic approach (Some knowledge is stored) B
c. Random approach
d. An Optimal approach
9 Deep learning is a subfield of machine learning where concerned algorithms
are inspired by the structured and function of the brain called _____.
a. Machine learning B
b. Artificial neural networks
c. Deep learning

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

d. Robotics
A.M. Turing developed a technique for determining whether a computer
could or could not demonstrate the artificial Intelligence,, Presently, this
10 technique is called
a. Turing Test
A
b. Algorithm
c. Boolean Algebra
d. Logarithm
11 Which method of traversal does not use stack to hold nodes that are waiting
to be processed?
a. Dept First C
b. D-search
c. Breadth first
d. Back-tracking
Breadth first search __________
a. Scans each incident node along with its children.
12 b. Scans all incident edges before moving to other node B
c. Is same as backtracking
d. Scans all the nodes in random order.
13 The worst-case occur in linear search algorithm when ……
a. Item is somewhere in the middle of the array
b. Item is not in the array at all D
c. Item is the last element in the array
d. Item is the last element in the array or item is not there at all
Which of the following is not the required condition for a binary search
algorithm?
14 a. The list must be sorted C
b. There should be direct access to the middle element in any sub list
c. There must be a mechanism to delete and/or insert elements in the list.
d. Number values should only be present
15 Which of the following sorting algorithm is of priority queue sorting type?
a. Bubble sort
b. Insertion sort D
c. Merge sort
d. Selection sort
16 What is the other name of informed search strategy?
a. Simple search
b. Heuristic search B
c. Online search
d. None of the mentioned
17 Which search uses the problem specific knowledge beyond the definition of
the problem?
a. Informed search A
b. Depth-first search
c. Breadth-first search
d. Uninformed search

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

What is the heuristic function of greedy best-first search?

a. f(n) != h(n)
18 b. f(n) < h(n) C
c. f(n) = h(n)
d. f(n) > h(n)
Which method is used to search better by learning?
a. Best-first search
19 b. Depth-first search C
c. Meta level state space
d. None of the mentioned
The heuristic function used by the AO* algorithm represents
a. an estimate of the distance to the goal node
20 b. an estimate of the cost of solving the node B
c. an estimate of cost of decomposing the node
d. none of the above
21 Is Best First Search a searching algorithm used in graphs?
True A
False
Who described this Best First Search algorithm using heuristic evaluation
rule?
22 a. Judea Pearl A
b. Max Bezzel
c. Franz Nauck
d. Alan Turing
Which type of best first search algorithm was used to predict the closeness of
the end of path and its solution?
23 a. Greedy BFS
b. Divide and Conquer
A
c. Heuristic BFS
d. Combinatorial
24 Which is identical to the closed list in Graph search?
a. Hill climbing search algorithm
b. Depth-first search C
c. Transposition table
d. None of the mentioned
25 Which function is used to calculate the feasibility of whole game tree?
a. Evaluation function
b. Transposition A
c. Alpha-beta pruning
d. All of the mentioned
26 Strategies that know whether one non-goal state is “more promising” than
another are called _________
a. Informed & Unformed Search D
b. Unformed Search
c. Heuristic & Unformed Search
d. Informed & Heuristic Search

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

What is called as transposition table?

a. Hash table of next seen positions
27 b. Hash table of previously seen positions B
c. Next value in the search
d. None of the mentioned
Where does the value of alpha-beta search get updated?
a. Along the path of search
28 b. Initial state itself A
c. At the end
d. None of the mentioned
29 Which value is assigned to alpha and beta in the alpha-beta pruning?
a. Alpha = max
b. Beta = min D
c. Beta = max
d. Both Alpha = max & Beta = min
To which depth does the alpha-beta pruning can be applied?
a. 10 states
30 b. 8 States D
c. 6 States
d. Any depth
Which of the following is/are Uninformed Search technique/techniques?
a. Breadth First Search (BFS)
31 b. Depth First Search (DFS) D
c. Bidirectional Search
d. All of the mentioned
The time and space complexity of BFS is (For time and space complexity
problems consider b as branching factor and d as depth of the search tree.)
32 a. O(bd+1) and O(bd+1) A
b. O(b2) and O(d2)
c. O(d2) and O(b2)
d. O(d2) and O(d2)
33 Zero sum games are the one in which there are two agents whose actions
must alternate and in which the utility values at the end of the game are
always the same. B
a. True
b. False
34 Mathematical game theory, a branch of economics, views any multi-agent
environment as a game provided that the impact of each agent on the others
is “significant,” regardless of whether the agents are cooperative or A
competitive.
a. True
b. False
35 Zero sum game has to be a ______ game.

a. Single player C
b. Two player

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

c. Multiplayer
d. Three player
The initial state and the legal moves for each side define the __________ for
the game.
36 a. Search Tree B
b. Game Tree
c. State Space Search
d. Forest
Which function is used to calculate the feasibility of whole game tree?
a. Evaluation function
37 b. Transposition A
c. Alpha-beta pruning
d. All of the mentioned
38 The original LISP machines produced by both LMI and Symbolic were
based on research performed at?
a. CMU B
b. MIT
c. Stanford University
d. RAMD
39 Partial-order planning exhibits the Principle of Least Commitment, which
contributes to the efficiency of this planning system as a whole.
a. True A
b. False
What is the space complexity of Depth-first search?
a. O(b)
40 b. O(bl) D
c. O(m)
d. O(bm)

Unit-IV

Machine Learning and Data Mining

Q.No Question Answer

Which of the following refers to the problem of finding abstracted patterns
(or structures) in the unlabeled data?
a. Supervised learning B

b. Unsupervised learning
1
c. Hybrid learning
d. Reinforcement learning

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

Which one of the following refers to querying the unstructured textual data?
a. Information access
2 C
b. Information update
c. Information retrieval
d. Information manipulation

Which of the following can be considered as the correct process of Data

Mining?
a. Infrastructure, Exploration, Analysis, Interpretation, Exploitation
3 A
b. Exploration, Infrastructure, Analysis, Interpretation, Exploitation
c. Exploration, Infrastructure, Interpretation, Analysis, Exploitation
d. Exploration, Infrastructure, Analysis, Exploitation, Interpretation

4 Machine Learning is a branch of_____

a. Artificial Intelligence
A
b. Machine Learning
c. Data Science
d. Deep Learning
_____is a method of data analysis that automates analytical model building
a. Artificial Intelligence
5 B
b. Machine Learning
c. Data Science
d. Deep Learning

6 Machine learning algorithms build a model based on sample data, known as

______
a. Testing Data C

b. Dummy Data
c. Training Data
d. None of the Above

7 Machine learning approaches are traditionally divided into ____ broad

categories
a. Five C

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

b. Four
c. Three
d. Two

8 The term machine learning was coined by _____

a. Tom M. Mitchell
C
b. Alan Turing
c. Arthur Samuel
d. None of the Above

9 The term machine learning was coined in ______

a. 1958
D
b. 1957
c. 1960
d. 1959

10 ML is a field of AI consisting of learning algorithms that?

a. Improve their performance
b. At executing some task D
c. Over time with experience
d. All of the above
11 Which of the following is a widely used and effective machine learning
algorithm based on the idea of bagging?
a. Decision Tree D
b. Regression
c. Classification
d. Random Forest
Which one of the following issues must be considered before investing in data
mining?
a. Compatibility D
12
b. Functionality
c. Vendor consideration
d. All of the above

How many layers Deep learning algorithms are constructed?

13
a. 2 B
b. 3

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

c. 4
d. 5
Deep learning algorithms are _______ more accurate than machine learning
algorithm in image classification.
14 a. 33% D
b. 37%
c. 40%
d. 41%
15 What is the objective of back propagation algorithm?
a. To develop learning algorithm for multilayer feed forward
neural network, so that network can be trained to capture the A
mapping implicitly
b. To develop learning algorithm for multilayer feed forward
neural network
c. To develop learning algorithm for single layer feed forward
neural network
d. All of the above

Which of the following is generally used by the E-R model to represent the
weak entities?
a. Diamond
16 B
b. Doubly outlined rectangle
c. Dotted rectangle
d. Both B & C

Which of the following is a reasonable way to select the number of principal

components “k”?

17 a. Choose k to be the smallest value so that at least 99% of the

variance is retained A
b. Use the elbow method
c. Choose k to be 99% of m (k = 0.99*m, rounded to the nearest
integer)
d. Choose k to be the largest value so that 99% of the variance is
retained

18 Explain what is the function of „Unsupervised Learning‟?

B
a. Find clusters of the data
b. Find low-dimensional representations of the data

Prof. Pappu Gaikwad www.dimr.edu.in

 DNYANSAGAR INSTITUTE OF MANAGEMENT AND RESEARCH

c. Find interesting directions in data

d. Interesting coordinates and correlations

Explain what is the function of „Supervised Learning‟?

19 a. Classifications
b. Speech recognition A
c. Regression
d. Predict time series

20 Suppose, you want to predict the class of new data point x=1 and y=1 using
eucludian distance in 3-NN. In which class these data points belong to?

a. + Class A
b. - Class
c. Can’t say
d. None of these
21
22
23
24
25
26
27

Prof. Pappu Gaikwad www.dimr.edu.in