Scoa Unit I MCQ: False
Scoa Unit I MCQ: False
1. Membership function defines the fuzziness in a fuzzy set irrespective of the elements
in the set, which are discrete or continuous.
A.True
B. False
A.Tabular Form
B. Graphical Form
C.Mathematical Form
D.Logical Form
A.knowledge
B. examples
C.learning
D.experience
A.Core
B. Support
C.Boundary
D.Fuzzy
6. A fuzzy set whose membership function has at least one element x in the universe
whose membership value
is unity is called
A.sub normal fuzzy sets
A.1
B. 0
C.infinite
D.Not defined
8. A fuzzy set wherein no membership function has its value equal to 1 is called
9. A fuzzy set has a membership function whose membership values are strictly
monotonically increasing or strictly monotonically decreasing or strictly
monotonically increasing than strictly monotonically decreasing with increasing
values for elements in the universe
A.convex fuzzy set
10. The membership values of the membership function are nor strictly monotonically
increasing or decreasing or strictly monoronically increasing than decreasing.
11. The crossover points of a membership function are defined as the elements in the
universe for which a particular fuzzy set has values equal to
A.infinite
B. 1
C.0
D.0.5
B. False
A.Pattern Recognition
B. Classification
C.Clustering
D.All of these
B. what-if questions
D.None of these
16. Ability to learn how to do tasks based on the data given for training or
initial experience
A.Self Organization
B. Adaptive Learning
C.Fault tolerance
D.Robustness
17. Feature of ANN in which ANN creates its own organization or representation of
information it receives during learning time is
A.Adaptive Learning
B. Self Organization
C.What-If Analysis
D.Supervised Learniing
A.nodes or neurons
B. weights
C.axons
D.Soma
19. Each connection link in ANN is associated with ________ which has information
about the input signal.
A.neurons
B. weights
C.bias
D.activation function
20. Neurons or artificial neurons have the capability to model networks of original
neurons as found in brain
A.True
B. False
21. Internal state of neuron is called __________, is the function of the inputs the
neurons receives
A.Weight
C.Bias
D.None of these
22. Neuron can send ________ signal at a time.
A.multiple
B. one
C.none
D.any number of
A.It uses machine-learning techniques. Here program can learn From past experience and
adapt themselves to new situations
B. Computational procedure that takes some value as input and produces some value as
output.
C.Science of making machines performs tasks that would require intelligence when
performed by humans
D.None of these
B. Approach to the design of learning algorithms that is structured along the lines of
the theory of evolution
C.an information base filled with the knowledge of an expert formulated in terms
of if-then rules
D.None of these
25. Falsification is
A.Modular design of a software application that facilitates the integration of new modules
C.A set of attributes in a database table that refers to data in another table
D.None of these
B. Approach to the design of learning algorithms that is structured along the lines of the
theory of evolution.
C.Decision support systems that contain an information base filled with the knowledge of
an expert formulated in terms of if-then rules.
D.None of these
A.Modular design of a software application that facilitates the integration of new modules
C.A set of attributes in a database table that refers to data in another table
D.None of these
B. A computer where each processor has its own operating system, its own memory, and its
own hard disk
D.None of these
B. The information stored in a database that can be, retrieved with a single query.
C.Worth of the output of a machine learning program that makes it understandable for
humans
D.None of these
B. A database containing volatile data used for the daily operation of an organization
D.None of these
31. Perceptron is
A.General class of approaches to a problem.
32. Prolog is
B. A computer where each processor has its own operating system, its own memory, and its
own hard disk
D.None of these
B. The information stored in a database that can be, retrieved with a single query
C.Worth of the output of a machine learning program that makes it understandable for
humans
D.None of these
A.A reference to the speed of an algorithm, which is quadratically dependent on the size of
the data
D.None of these
C.One of the defining aspects of a data warehouse, which is specially built around all the
existing applications of the operational data
D.None of these
36. Vector
A.It do not need the control of the human operator during their execution
D.None of these
37. Transparency
A.The large set of candidate solutions possible for a problem
B. The information stored in a database that can be retrieved with a single query
C.Worth of the output of a machine learning program that makes it understandable for
humans
D.None of these
A.Charles Darwin
B. Lofti A Zadeh
C.Rechenberg
D.Mc_Culloch
A.Evolutionary Computing
C.are adaptive heuristic search algorithm based on the evolutionary ideas of natural
selection and genetics
46. Conventional Artificial Intelligence is different from soft computing in the sense
A.Conventional Artificial Intelligence deal with prdicate logic where as soft computing deal
with fuzzy logic
D.experience
4. C
Three main basic features involved in characterizing membership
function are
A.Intution, Inference, Rank Ordering
B. Fuzzy Algorithm, Neural network, Genetic Algorithm
C.Core, Support , Boundary
D.Weighted Average, center of Sums, Median
5. The region of universe that is characterized by complete A
membership in the set is called
A.Core
B. Support
C.Boundary
D.Fuzzy
6. B
A fuzzy set whose membership function has at least one element x
in the universe whose membership value
is unity is called
A.sub normal fuzzy sets
SCOA UNIT 2 MCQs
c) (A × B) → (B × C)
d) (A × C) ∪ (B × C)
21. What are the applications of Fuzzy Inference Systems? d
a) Wireless services, heat control and printers
b) Restrict power usage, telephone lines and sort data
c) Simulink, boiler and CD recording
d) Automatic control, decision analysis and data classification
22. Fuzzy logic is a form of : c
a) Two valued logic
b) Crisp set logic
c) Many valued logic
d) Binary set logic
23. The main objective of fuzzy AHP is: d
a) To increase the ambiguity of human judgement
b) Eliminate the ambiguous and vagueness of the human judgement
c) Control human biasness
d) B and C
24. In triangular fuzzy number (l, m, u), what does ‘m’ represents: C
a) Smallest likely value
b) Most probable value
c) Largest possible value
d) None of the above
25. Which type of normalization method is used to eliminate the units of b
criteria in case of VIKOR analysis?
a) Vector normalization
b) Linear normalization
c) Both A and B
SCOA UNIT 2 MCQs
27. Traditional set theory is also known as Crisp Set theory. Answer: a
Explanation: Traditional set
a) True theory set membership is
b) False fixed or exact either the
member is in the set or not.
There is only two crisp
values true or false. In case
of fuzzy logic there are
many values. With weight
say x the member is in the
set.
28. The truth values of traditional set theory is ____________ and that of Answer: a
fuzzy set is __________ Explanation: Refer the
SCOA UNIT 2 MCQs
30. The room temperature is hot. Here the hot (use of linguistic variable is Answer: a
used) can be represented by _______ . Explanation: Fuzzy logic
deals with linguistic
a) Fuzzy Set variables.
b) Crisp Set
a) Probability distributions
b) Continuous variable
c) Discrete variable
d) Probability distributions for Continuous variables
33. Which of the following is used for probability theory sentences? Answer: c
Explanation: The version of
a) Conditional logic probability theory we
b) Logic present uses an extension of
c) Extension of propositional logic propositional logic for its
d) None of the mentioned sentences.
34. Fuzzy Set theory defines fuzzy operators. Choose the fuzzy operators Answer: a, b, c
from the following. Explanation: The AND,
OR, and NOT operators of
a) AND Boolean logic exist in fuzzy
b) OR logic, usually defined as the
c) NOT minimum, maximum, and
d) EX-OR complement;
37. ____________ are algorithms that learn from their more complex Answer: c
environments (hence eco) to generalize, approximate and simplify Explanation: Local
solution logic. structure is usually
associated with linear rather
a) Fuzzy Relational DB than exponential growth in
b) Ecorithms complexity
c) Fuzzy Set
d) None of the mentioned
SCOA UNIT 2 MCQs
This sheet is for 1 Mark questions
S.r No Question Image a b c d Correct Answer
e.g Write down question img.jpg Option a Option b Option c Option d a/b/c/d
1 When we say that the boundary is crisp Distinguish two regions Cannot
clearlyDistinguishCollection
two regions of ordered
clearly Nonepairsof these a
2 In computing the output is called as Consequent Outfeed Anticedents Premise a
3 Fuzzy logic is a form of two valued logic crisp set logic many value logic binary set logic c
4 Control actions while computing should be Ambiguous Unambioguos Inaccurate None of these b
5 Core of soft computing is Fuzzy computing,neural Fuzzy
computing,Genetic
network andNeuralartificial
algorithm
Science
intelligenceGenetic Science a
6 Hard computing perfforms what type of computation Sequential Parallel approxiamate both a and b a
7 Who iniated idea of sofft computing charles darwin rich and berg mc culloch lofti a zadeh d
8 Soft computing is based on fuzzy logic neural science crisp software binary logic a
9 In soft computing the problems,algorithms can be non adaptive adaptive static all of the above b
10 Fuzzy Computing mimics human behaviour deals with inprecise,probablistic
exact information both a and b d
11 Hard computing is also called as evolutionary computing conventional computingnon conventional computing probablistic computing b
12 Which computing produces accurate results soft computing hard computing both a and b none of the above b
13 Neural network computing mimics human behaviour information processingboth aparadigm
and b none of the above c
14 Artificial neural network is used for pattern recognition classification clustering all of the above d
15 How does blind search differ from optimization Blind search representBlind
a guided
searchapproach
usually
Blind
does
whilesearch
not
optimization
conclude
cannot result
none
in
is one
unguided
of
instep
these
optimal
like some
solution optimization
whereasBoptimization
methods. method do
16 In modeling,an optimal solution is understood to be a solution that can onlya solution
be determined
found inby
athe
solution
anleast
exhaustive
possible
that is enumeration
the
time
abest
solution
and
based
using
testing
that
onthe
requires
criteria
of
least
alternatives
defined
possible
an algorithm
incomputing
the
C for
design
theresources
phase
determination
17 When is a complete enumeration of solution used? When a solution that When
is "goodthere
enough"
is enough
isWhen
finetime
and
theand
good
modeler
computational
heuristics
requires
Whenare there
apower
available
guidedareavailable
an
approach
infinite number
to problem
B of solution
solving to be searched
18 All of the follwing are true about heuristics EXCEPT heuristics are used whenheuristics
the modeler
are used
requires
heuristics
when a solution
guided
are usedapproach
that
when
heuristics
is "good
there
to problem
are
enough"
is abundant
rulessolving
of
is sought
good
timejudgement
and computational
C power
19 Which approach is most suited to structured problem with little uncertainity Simuation human intuition Optimization genetic algorithm C
20 Genetic algorithm belong to the family of method in the artifical intelligence area
optimization area complete enumeration Nonfamily
computer
of methods
based isolation areaA
21 What does the 0 membership value means in the set the object is fully inside
thethe
object
set is not inthetheobject
set is partiallynone present
of the
in the
aboveset b
22 The union of two fuzzy sets is the_______of each element from two sets maximum minimum equal to not equal to a
23 The process of fuzzy interference system involes membership functionsfuzzy logic operators if-then rules all the above d
24 What does a fuzzifier do coverts crisp input to coverts
linguisticcrisp
variables
ouputcoverts
to linguistic
fuzzy variables
input tocoverts
linguistic
fuzzyvariables
output to linguistic variables
a
25 Which of the folloowing is not defuzzifier method centroid of area mean of maximumlargest of maximum hypotenuse of triangle d
26 Which of the following is/are type of fuzzy interference method mamdani sugeno rivest only a and b d
27 A Fuzzy rule can have multiple part of antecedent,only
only single part
single
ofpart
multiple
antecedent,mutiple
of consequent
part of antecedent,multiple
only
part single
of consequent
part of part
antecedent,only
of consequent csingle part of consequent
28 The a cut of a fuzzy set A is a crisp set defined by :- {x|Ua(x)>a} {x|Ua(x)>=a} {x|Ua(x)<a} {x|Ua(x)<=a} b
29 The bandwidth(A) in a fuzzy set is given by (A)=|x1*x2| (A)=|x1+x2| (A)=|x1-x2| (A)=|x1/x2| c
30 The intersection of two fuzzy sets is the_______of each element from two sets maximum minimum equal to not equal to b
31 A={1/a,0.3/b,0.2/c,0.8/d,0/e} B={0.6/a,0.9/b,0.1/c,0.3/d,0.2/e} What will be the complement
{0/a,0.7/b,0.8/c,0.2/d,1/e}
of A? {0/a,0.9/b,0.7/c,0.2/d,1/e}
{0.8/a,0.7/b,0.8/c,0.7/d,1/e}
{0/a,0.7/b,0.8/c,0.9/d,1/e} a
32 A={1/a,0.3/b,0.2/c,0.8/d,0/e} B={0.6/a,0.9/b,0.1/c,0.3/d,0.2/e} What will be the union
{1/a,0.9/b,0.1/c,0.5/d,0.2/e}
of AUB? {0.8/a,0.9/b,0.2/c,0.5/d,0.2/e}
{1/a,0.9/b,0.2/c,0.8/d,0.2/e}
{1/a,0.9/b,0.2/c,0.8/d,0.8/e} c
33 A={1/a,0.3/b,0.2/c,0.8/d,0/e} B={0.6/a,0.9/b,0.1/c,0.3/d,0.2/e} What will be the intersection
{0.6/a,0.3/b,0.1/c,0.3/d,0/e}
of A and B ? {0.6/a,0.8/b,0.1/c,0.3/d,0/e}
{0.6/a,0.3/b,0.1/c,0.5/d,0/e}
{0.6/a,0.3/b,0.2/c,0.3/d,1/e} a
34 What denotes the support(A) in a fuzzy set? {x|Ua(x)>0} {x|Ua(x)<0} {x|Ua(x)<=0} {x|Ua(x)<0.5} a
35 What denotes the core(A) in a fuzzy set? {x|Ua(x)>0} {x|Ua(x)=1} {x|Ua(x)>=0.5} {x|Ua(x)>0.8} b
36 Fuzzy logic deals with which of the following fuzzy set fuzzy algebra both a and b none of the above c
37 which of the following is a sequence of steps taken in designning a fuzy logic machine fuzzification->Rule Evaluation->Deffuzification
deffuzification->rule
rule
evaluation->fuzzification
evaluation->fuzzification->deffuzification
rule evaluation->defuzzification->fuzzification
a
38 can a crisp set be a fuzzy set? no yes depends all of the above b
39 Genetic algorithm belong to the family of method in the artifical intelligence area
optimization area complete enumeration Nonfamily
computer
of methods
based isolation areaA
40 All of the follwing are suitable problem for genetic algorithm EXCEPT pattern recognizationsimulation of biological
simplemodels
optimization dynamic
with few process
variablescontrol C
41 Tabu search is an example of ? heuristic Evolutionary algorithm
ACO PSO a
42 Genetic algorithms are example of heuristic Evolutionary algorithm
ACO PSO b
43 mutation is applied on __candidates. one two more than two noneof these a
44 recombination is applied on __candidates. one two more than two noneof these b
45 LCS belongs to ___ based methods? rule based learning genetic learning both a and b noneof these a
46 Survival is ___ approach. deteministic non deterministic semi deterministic noneof these a
47 Evolutionary algorithms are a ___ based approach heuristic metaheuristic both a and b noneof these a
48 Tabu search is an example of ? heuristic Evolutionary algorithm
ACO PSO a
49 Genetic algorithms are example of heuristic Evolutionary algorithm
ACO PSO b
50 Idea of genetic algorithm came from machines Birds ACO genetics d
51 Chromosomes are actually ? line representation String representation Circular representation
all of these b
52 what are the parameters that affect GA are/is selection process initial population both a and b none of these c
53 Evolutionary programming was developef by Fredrik Fodgel Frank Flin b
54 Evolution Strategies is developed with selection mutation a population of size one
all of these d
55 Evolution Strategies typically uses real-valued vector representations
vector representation
time based representation
none of these a
56 in ES survival is indeterministic deterministic both a and b none of these d
57 What is the first step in Evolutionary algorithm Termination selection Recombination Initialization d
58 Elements of ES are/is Parent population sizeSurvival populationboth sizea and b none of these c
59 What are different types of crossover discrete and intermedium
discrete and continuous
continuous and intemedium
none of these a
60 Determining the duration of the simulation occurs before the model is validated and tested. TRUE FALSE B
61 _________cannot easily be transferred from one problem domain to another optimal solution analytical solutionsimulation solutuon none of these C
62 Discrete events and agent-based models are usuallly used for_____________. middle or low level ofhigh
abstractions
level of abstraction
very high level of abstraction
none of these A
63 _____doesnot usually allow decision makers to see how a solution to a ___________envolves
Simulation
over time
,Complex
nor can
problem
Simulation,Easy
decision makers
problem
Genetics,Complex
interact with it. problem
Genetics,Easy problem A
64 EC stands for? Evolutionary Computatons
Evolutionary computer
Electronic computations
noneof these a
65 GA stands for genetic algorithm genetic asssurancegenese alforithm noneof these a
66 LCS stands for learning classes systemlearning classifier systems
learned class systemnoneof these b
67 GBML stands for Genese based Machine Genes
learning
based mobileGenetic
learning
bsed machinenoneof
learning
these c
68 EV is dominantly used for solving ___. optimization problemsNP problem simple problems noneof these a
69 EV is considered as? adaptive complex both a and b noneof these c
70 Idea of genetic algorithm came from machines Birds ACO genetics d
71 Chromosomes are actually ? line representation String representation Circular representation
all of these b
72 Parameters that affect GA initial population selection process fitness function all of these d
73 Fitness function should be maximum minimum intermediate noneof these b
74 Evolutionary algorithms are a ___ based approach heuristic metaheuristic both a and b noneof these a
75 Tabu search is an example of ? heuristic Evolutionary algorithm
ACO PSO a
76 Genetic algorithms are example of heuristic Evolutionary algorithm
ACO PSO b
77 mutation is applied on __candidates. one two more than two noneof these a
78 recombination is applied on __candidates. one two more than two noneof these b
79 Applying recombination and mutation leads to a set of new candidates, called as ? sub parents parents offsprings grand child c
____ decides who becomes parents and how many children the b
80
parents have. parent combination Parent selection Parent mutation Parent replace
Survival c
81 Parent Selection Selection
Basic elements of EA are ? methods methods both a and b noneof these
82 LCS belongs to ___ based methods? rule based learning genetic learning both a and b noneof these a
83 Survival is ___ approach. deteministic non deterministic semi deterministic noneof these a
There are also other operators, more linguistic in nature, called None of the
84
__________ that can be applied to fuzzy set theory. Hedges Lingual Variable Fuzz Variable mentioned a
A fuzzy set has a membership function whose membership values
are strictly monotonically increasing or strictly monotonically
85 decreasing or strictly monotonically increasing than strictly
monotonically decreasing with increasing values for elements in the Non concave Fuzzy
universe convex fuzzy set concave fuzzy set set Non Convex Fuzzy set a
then A will be: (where ~ → complement) {(4, 0.7), (2,1), (1,0.8)}{(4, 0.3.): (5, 0), (6.{(l,
0.2)1),} (2, 1), (3, 0.3),{(3,
(4, 1),
0.3),
(6,0.2),
(6.0.2)}
(7, 1)} c
What are the following sequence of steps taken in designing a fuzzy
95
logic machine ? Fuzzification → Rule evalua
Fuzzification
on → Defuzzifica
→ Defuzzifica
Rule evaluation
on on → Rule
→ Fuzzifica
Rule
evalua
evaluation
on
on → Defuzzifica
→ Defuzzifica
a on on → Fuzzifica on
If A and B are two fuzzy sets with membership functions
Then the value of μ(A∪B)’(x) will be {0.9, 0.5, 0.6, 0.8, 0.8}{0.6, 0.2, 0.1, 0.7, 0.5}
{0.1, 0.5, 0.4, 0.2, 0.2}
{0.1, 0.5, 0.4, 0.2, 0.3} c
105
----- defines logic funtion of two prepositions prepositions Lingustic hedges truth tables inference rules c
106 In fuzzy propositions, ---- gives an approximate idea of the number of Fuzzy predicate and
elements of a subset fulfilling certain conditions predicate modifiers Fuzzy quantifiers Fuzzy qualifiers All of the above b
107
Multiple conjuctives antecedents is method of ----- in FLC decomposition rule formation of rule truth tables All of the above a
108
Multiple disjuctives antecedents is method of ----- in FLC decomposition rule formation of rule truth tables All of the above a
rule in zero order rule in first order
109
IF x is A and y is B then z=c (c is constant), is FIS FIS both a and b neither a nor b a
A fuzzy set wherein no membership function has its value equal to 1 subnormal fuzzy
110
is called normal fuzzy set set. convex fuzzy set concave fuzzy set b
uses
doesnot use recombination
117
recombination to such as cross uses various
produce offspring. It over to produce recombination none of the
In Evolutionary strategy, recombination is only uses mutation offspring operators mentioned b
deviation in step
118 sizes change over
time using some deviation in step
deviation in step deterministic size change
Step size in non-adaptive EP : sizes remain static function dynamically size=1 a
deviation in step
119 sizes change over
time using some deviation in step
deviation in step deterministic size change
Step size in dynamic EP : sizes remain static function dynamically size=1 b
deviation in step
120 sizes change over
time using some deviation in step
deviation in step deterministic size change
Step size in self-adaptive EP : sizes remain static function dynamically size=1 c
What are normally the two best measurement units for an
evolutionary algorithm?
1. Number of evaluations
121
2. Elapsed time
3. CPU Time
4. Number of generations 1 and 2 2 and 3 3 and 4 1 and 4 d
(µ,λ): Select (µ+λ): Select
survivors among survivors among (µ-λ): Select
122
parents and parents and survivors among (µ:λ): Select survivors
Evolutionary Strategies (ES) offspring offspring offspring only among offspring only b
Individual
solution is
123 Individuals are represented as a Individuals are
represented by real- Finite State represented as none of the
In Evolutionary programming, valued vector Machine binary string mentioned b
Individual
solution is
124 Individuals are represented as a Individuals are
represented by real- Finite State represented as none of the
In Evolutionary Strategy, valued vector Machine binary string mentioned a
offspring becomes
parent if offspring's
125
fitness is as good as
parent of next offspring become offspring never none of the
(1+1) ES generation parent by default becomes parent mentioned a
λ mutants can be
126 generated from one one mutant is 2λ mutants can be no mutants are
(1+λ) ES parent generated generated generated a
total number of
fitness population
127 evaluations diveristy drops
mazimally allowed reaches a given under a given
Termination condition for EA CPU time is elapsed limit threshold All the mentioned d
Proportional tournament
128
Which of the following operator is simplest selection operator? Random selection selection selection none a
evolutionary
129 programming doesnot
Single point two point use crossover
Which crossover operators are used in evolutionary programming? crossover crossover Uniform crossover operators d
Operates on operates on operates on
130 population size of populantion size populantion size of operates on
(1+1) ES two of one zero populantion size of λ a
Evolutionary Genetic
131
Which of these emphasize of development of behavioral models? programming programming Genetic algorithm All the mentioned a
variation through
132
application of none of the
EP applies which evolutionary operators? mutation operators selection both a and b mentioned c
Stochastic
133 Roulette wheel universal tournament
Which selection strategy works with negative fitness value? selection sampling selection Rank selection d