McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Uncategorized topics .
| 201. |
For k>1, which of the following concept can be used to generate other linguistic hedge? |
| A. | concentration and dilation |
| B. | dilation |
| C. | concentration |
| D. | none of the mentioned |
| Answer» C. concentration | |
| 202. |
Consider
|
| A. | {1.0, 0.45, 0.75} |
| B. | {1,0.2,0.75} |
| C. | {0.2, 0.45, 0.50} |
| D. | {1, 0.45, 1} |
| Answer» A. {1.0, 0.45, 0.75} | |
| 203. |
Consider
|
| A. | {1.0, 0.45, 0.75} |
| B. | {0.2, 0.20, 0.50} |
| C. | {0.2, 0.45, 0.50} |
| D. | {1, 0.45, 1} |
| Answer» B. {0.2, 0.20, 0.50} | |
| 204. |
Mamdani-style inference involves which steps |
| A. | fuzzification of the input variables & rule evaluation |
| B. | aggregation of the rule output & defuzzification |
| C. | both a and b |
| D. | either a or b |
| Answer» C. both a and b | |
| 205. |
A __________ point of a fuzzy set A is a point x ∈ X at which µA(x) = 0.5 |
| A. | core |
| B. | support |
| C. | cross-over |
| D. | α - cut |
| Answer» C. cross-over | |
| 206. |
Which statement is true? |
| A. | mamdani approach characterised by its low interpredictability and low accuracy |
| B. | takagi and sugeno\s approach characterised by high accuracy but at the cost of high interpretability |
| C. | takagi and sugeno\s approach follows precise fuzzy modelling and obtains high accuracy but at the cost of low interpretability |
| D. | mamdani approach characterised by its low interpretability and high accuracy |
| Answer» C. takagi and sugeno\s approach follows precise fuzzy modelling and obtains high accuracy but at the cost of low interpretability | |
| 207. |
The height h(A) of a fuzzy set A is defined as
|
| A. | h(a) = 0 |
| B. | h(a) <0 |
| C. | h(a)=1 |
| D. | h(a)<1 |
| Answer» C. h(a)=1 | |
| 208. |
Which can be used as an input to fuzzy controller? |
| A. | a fuzzy set |
| B. | a crisp set |
| C. | both fuzzy set and crisp set |
| D. | none of these |
| Answer» B. a crisp set | |
| 209. |
What are the types of fuzzy logic sets? |
| A. | type-1 fuzzy set |
| B. | type-2 fuzzy set |
| C. | both a and b |
| D. | none of these |
| Answer» C. both a and b | |
| 210. |
How is fuzzy logic different from conventional control methods |
| A. | if and then approach |
| B. | for approach |
| C. | while approach |
| D. | do approach |
| Answer» A. if and then approach | |
| 211. |
The height h(A) of a fuzzy set A is defined as h(A)=support A(x), where A belongs to A. Then fuzzy set is called normal when |
| A. | h(a)=0 |
| B. | h(a)<0 |
| C. | h(a)=1 |
| D. | h(a)>1 |
| Answer» C. h(a)=1 | |
| 212. |
If A and B are sets and A U B= A ⋂ B then |
| A. | a=b |
| B. | a=0 |
| C. | b=0 |
| D. | none of these |
| Answer» A. a=b | |
| 213. |
If x is A then y is B else y is C. The output of the given fuzzy rule is |
| A. | a fuzzy set |
| B. | a crisp set |
| C. | a fuzzy relation |
| D. | a membership function |
| Answer» C. a fuzzy relation | |
| 214. |
What Is The First Step Of Fuzzy Logic Toolbox? |
| A. | fuzzification of the input variables |
| B. | defuzzification |
| C. | application of the fuzzy operator(and or or) in the antecedent |
| D. | aggregation of the consequents across the rule |
| Answer» A. fuzzification of the input variables | |
| 215. |
What Is The Input And Output Of Step 2 - Apply Fuzzy Operator? |
| A. | what is the input and output of step 2 - apply fuzzy operator? |
| B. | the input is a value greater than one and the output is a value less than the input |
| C. | the input and output have both the same values |
| D. | the input has two or more values and the output has a single truth value |
| Answer» D. the input has two or more values and the output has a single truth value | |
| 216. |
What Is The Input And Output Of Step 3 - Apply Implication Method? |
| A. | input is a fuzzy set but the output is a whole value |
| B. | input is a fuzzy set but the output is a whole value |
| C. | input and output have the same value |
| D. | input is a smaller value than the output value |
| Answer» B. input is a fuzzy set but the output is a whole value | |
| 217. |
What Is The Purpose Of Aggregation? |
| A. | to gather all the different fuzzy set outputs and combine them into a single fuzzy set outputs |
| B. | to gather all the possible inputs and use the average to gain an output |
| C. | to gather all the different fuzzy set outputs and average them out to get a single value |
| D. | to subtract all the output fuzzy set values from the input values |
| Answer» A. to gather all the different fuzzy set outputs and combine them into a single fuzzy set outputs | |
| 218. |
Linguistic variable is |
| A. | a variable whose values are words or sentences |
| B. | any numerical value only |
| C. | any binary value only |
| D. | variable which contains true or false values only |
| Answer» A. a variable whose values are words or sentences | |
| 219. |
Identfication of Input, Output and state variables is performed in which step of FLC? |
| A. | fuzzy configuration |
| B. | defuzzification |
| C. | combining fuzzy outputs |
| D. | identification of variables |
| Answer» D. identification of variables | |
| 220. |
Assigning linguistic label to each subset is done in which step of FLC? |
| A. | fuzzy configuration |
| B. | defuzzification |
| C. | combining fuzzy outputs |
| D. | fuzzy subset configuration |
| Answer» D. fuzzy subset configuration | |
| 221. |
Disjuctive system of rules is used for system |
| A. | that requires at least one out of all rules it satisfies |
| B. | all the rules to be jointly satisfied |
| C. | both a and b |
| D. | neither a nor b |
| Answer» A. that requires at least one out of all rules it satisfies | |
| 222. |
Conjuctive system of rules is used for system |
| A. | that requires at least one out of all rules it satisfies |
| B. | all the rules to be jointly satisfied |
| C. | both a and b |
| D. | neither a nor b |
| Answer» B. all the rules to be jointly satisfied | |
| 223. |
Categorial reasoning form of fuzzy reasoning |
| A. | the antecedent part of the rule does not contain any fuzzy quantifiers and fuzzy probabilities |
| B. | the antecedents and consequents have fuzzy linguistic variables |
| C. | antecedents with fuzzy quantifiers are related to inference rules |
| D. | antecedents are dispositions |
| Answer» A. the antecedent part of the rule does not contain any fuzzy quantifiers and fuzzy probabilities | |
| 224. |
Syllogistic reasoning form of fuzzy reasoning |
| A. | the antecedent part of the rule does not contain any fuzzy quantifiers and fuzzy probabilities |
| B. | the antecedents and consequents have fuzzy linguistic variables |
| C. | antecedents with fuzzy quantifiers are related to inference rules |
| D. | antecedents are dispositions |
| Answer» C. antecedents with fuzzy quantifiers are related to inference rules | |
| 225. |
Qualitative reasoning form of fuzzy reasoning |
| A. | the antecedent part of the rule does not contain any fuzzy quantifiers and fuzzy probabilities |
| B. | the antecedents and consequents have fuzzy linguistic variables |
| C. | antecedents with fuzzy quantifiers are related to inference rules |
| D. | antecedents are dispositions |
| Answer» B. the antecedents and consequents have fuzzy linguistic variables | |
| 226. |
Dispositional reasoning form of fuzzy reasoning |
| A. | the antecedent part of the rule does not contain any fuzzy quantifiers and fuzzy probabilities |
| B. | the antecedents and consequents have fuzzy linguistic variables |
| C. | antecedents with fuzzy quantifiers are related to inference rules |
| D. | antecedents are dispositions |
| Answer» D. antecedents are dispositions | |
| 227. |
Mamdani systems are |
| A. | miso systems |
| B. | mimo systems |
| C. | only miso systems |
| D. | both a and b |
| Answer» D. both a and b | |
| 228. |
Sugeno systems are |
| A. | miso systems |
| B. | mimo systems |
| C. | only miso systems |
| D. | both a and b |
| Answer» B. mimo systems | |
| 229. |
In the generational model of EA |
| A. | entire set of population is replaced by offsprings |
| B. | one member of population is replaced |
| C. | no population member is replaced |
| D. | depends on fitness value |
| Answer» A. entire set of population is replaced by offsprings | |
| 230. |
In the steady-state model of EA |
| A. | entire set of population is replaced by offsprings |
| B. | one member of population is replaced |
| C. | no population member is replaced |
| D. | depends on fitness value |
| Answer» B. one member of population is replaced | |
| 231. |
In the generational model of EA |
| A. | each individual survives exactly for two generation |
| B. | each individual survives exactly for one generation |
| C. | cannot predict |
| D. | each individual survives as many generations as want |
| Answer» B. each individual survives exactly for one generation | |
| 232. |
In the steady-state model of EA |
| A. | one offspring is generated per generation |
| B. | two offsprings are generated per generation |
| C. | cannot decide |
| D. | more than two offsprings are generated per generation |
| Answer» A. one offspring is generated per generation | |
| 233. |
Which of the following algorithm is most efficient for discotinuous and noisy problems? |
| A. | evolutionary algorithm |
| B. | classical optimization algorithm |
| C. | genetic algorithm |
| D. | none |
| Answer» A. evolutionary algorithm | |
| 234. |
Each iteration of EA is referred to as |
| A. | generation |
| B. | iteration |
| C. | population |
| D. | none |
| Answer» A. generation | |
| 235. |
Which of the following are evolutionary operators? |
| A. | selection |
| B. | crossover |
| C. | mutation |
| D. | all of the above |
| Answer» D. all of the above | |
| 236. |
In the (μ/ρ,λ) method of ES, parents are |
| A. | selected from offspring |
| B. | selected from both the parents and offspring |
| C. | selected from new population |
| D. | not selected |
| Answer» A. selected from offspring | |
| 237. |
In the (μ/ρ+λ) method of ES, parents are |
| A. | selected from offspring |
| B. | selected from both the parents and offspring |
| C. | selected from new population |
| D. | not selected |
| Answer» B. selected from both the parents and offspring | |
| 238. |
Fitness scaling is desirable to ensure |
| A. | population diversity |
| B. | selection pressure |
| C. | that better solutions are selected only |
| D. | relatively inferior solutions are not ignored |
| Answer» A. population diversity | |
| 239. |
Which mutation operator is used in ES as reproduction operator? |
| A. | one point |
| B. | gaussian mutation |
| C. | two point |
| D. | adaptive |
| Answer» B. gaussian mutation | |
| 240. |
Fitness proportionate selection methods are |
| A. | roulette wheel selection |
| B. | stochastic universal sampling |
| C. | tournament selection |
| D. | all the mentioned |
| Answer» D. all the mentioned | |
| 241. |
In which selection method of survival selection there is no notion of fitness? |
| A. | fitness based selection |
| B. | elitism |
| C. | agebased selection |
| D. | all the mentioned |
| Answer» C. agebased selection | |
| 242. |
In which selection strategy every individual has the same probability to be selected? |
| A. | roulette wheel selection |
| B. | uniform selection |
| C. | tournament selection |
| D. | rank selection |
| Answer» B. uniform selection | |
| 243. |
High selection pressure is desirable, when we need |
| A. | diversity not found in each generation |
| B. | there is no improvement in successive ga iteration |
| C. | faster termination of ga |
| D. | fitness values are not uniformly distributed |
| Answer» C. faster termination of ga | |
| 244. |
Tournament selection scheme is more preferable when |
| A. | when fitness values are uniformly distributed |
| B. | population are with very diversified fitness values |
| C. | when fitness values are not necessarily uniformly distributed |
| D. | under all the above situations |
| Answer» B. population are with very diversified fitness values | |
| 245. |
Which of the following is not a characterstic of evolutionary algorithm? |
| A. | conceptual simplicity |
| B. | parallelism |
| C. | broad applicability |
| D. | artificial selection |
| Answer» D. artificial selection | |
| 246. |
What is the correct order of steps in evolutionary algorithm? |
| A. | select parents-recombine-mutate-evaluate |
| B. | select parents-recombine-evaluate-mutate- |
| C. | select parents-mutate - recombine-evaluate |
| D. | select parents-evaluate -recombine-mutate |
| Answer» A. select parents-recombine-mutate-evaluate | |
| 247. |
Which of the following schemes are selection schemes in Evolutionary computation? |
| A. | hall of fame |
| B. | rank based selection |
| C. | tournament selection |
| D. | all of the above |
| Answer» D. all of the above | |
| 248. |
To encode chromosomes which encoding schemes are used |
| A. | binary encoding |
| B. | finite state machine encoding |
| C. | real value encoding |
| D. | all of the above |
| Answer» D. all of the above | |
| 249. |
What is defuzzification |
| A. | conversion of fuzzy set to crisp set |
| B. | conversion of crisp set to fuzzy set |
| C. | conversion of fuzzy set to fuzzy logic |
| D. | conversion of crisp set to crisp logic |
| Answer» A. conversion of fuzzy set to crisp set | |
| 250. |
What type of model is required for hard computing |
| A. | mathematical |
| B. | biological |
| C. | chemical |
| D. | probablistic |
| Answer» A. mathematical | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.