MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 141 Mcqs, each offering curated multiple-choice questions to sharpen your Master of Science in Computer Science (M.Sc CS) knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
The company that grew out of research at the MIT AI lab is: |
| A. | ai corp |
| B. | lmi |
| C. | symbolics |
| D. | both b & c |
| Answer» E. | |
| 52. |
The component of an ICAI (Intelligent Computer-Asslsted Instruction) presenting information to the student is the: |
| A. | student model |
| B. | problem-solving expertise |
| C. | tutoring module |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 53. |
Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail somewhere between 0 and 1? |
| A. | human logic |
| B. | fuzzy logic |
| C. | boolean logic |
| D. | operational logic |
| Answer» C. boolean logic | |
| 54. |
When the resolution is called as refutation-complete? |
| A. | sentence is satisfiable |
| B. | sentence is unsatisfiable |
| C. | sentence remains the same |
| D. | none of the mentioned |
| Answer» C. sentence remains the same | |
| 55. |
What will happen if two literals are identical? |
| A. | remains the same |
| B. | added as three |
| C. | reduced to one |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 56. |
What is meant by factoring? |
| A. | removal of redundant variable |
| B. | removal of redundant literal |
| C. | addition of redundant literal |
| D. | addition of redundant variable |
| Answer» C. addition of redundant literal | |
| 57. |
At which state does the propositional literals are complementary. |
| A. | if one variable is less |
| B. | if one is the negation of the other |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» C. both a & b | |
| 58. |
Which rule is equal to resolution rule of first-order clauses? |
| A. | propositional resolution rule |
| B. | inference rule |
| C. | resolution rule |
| D. | none of the mentioned |
| Answer» B. inference rule | |
| 59. |
Which sentence will be unsatisfiable if the CNF (Conjunction Normal Form) sentence is unsatisfiable? |
| A. | search statement |
| B. | reading statement |
| C. | replaced statement |
| D. | original statement |
| Answer» E. | |
| 60. |
Which can be converted to inferred equivalent CNF (Conjunction Normal Form) sentence? |
| A. | every sentence of propositional logic |
| B. | every sentence of inference |
| C. | every sentence of first-order logic |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 61. |
What is the condition of literals in variables? |
| A. | existentially quantified |
| B. | universally quantified |
| C. | quantified |
| D. | none of the mentioned |
| Answer» C. quantified | |
| 62. |
What kind of clauses is available in Conjunctive Normal Form? |
| A. | disjunction of literals |
| B. | disjunction of variables |
| C. | conjunction of literals |
| D. | conjunction of variables |
| Answer» B. disjunction of variables | |
| 63. |
Which is a refutation complete inference procedure for propositional logic? |
| A. | clauses |
| B. | variables |
| C. | propositional resolution |
| D. | proposition |
| Answer» D. proposition | |
| 64. |
What can be viewed as single leteral of disjunction? |
| A. | multiple clause |
| B. | combine clause |
| C. | unit clause |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 65. |
Which form is called as conjunction of disjunction of literals? |
| A. | conjunctive normal form |
| B. | disjunctive normal form |
| C. | normal form |
| D. | all of the mentioned |
| Answer» B. disjunctive normal form | |
| 66. |
Which is also called single inference rule? |
| A. | reference |
| B. | resolution |
| C. | reform |
| D. | none of the mentioned |
| Answer» C. reform | |
| 67. |
Which are needed to compute the logical inference algorithm? |
| A. | logical equivalence |
| B. | validity |
| C. | satisfiability |
| D. | all of the mentioned |
| Answer» E. | |
| 68. |
How many logical connectives are there in artificial intelligence? |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» E. | |
| 69. |
How many proposition symbols are there in artificial intelligence? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 70. |
Which is used to construct the complex sentences? |
| A. | symbols |
| B. | connectives |
| C. | logical connectives |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 71. |
Which is created by using single propositional symbol? |
| A. | complex sentences |
| B. | atomic sentences |
| C. | composition sentences |
| D. | none of the mentioned |
| Answer» C. composition sentences | |
| 72. |
Which variable cannot be written in entire distribution as a table? |
| A. | discrete |
| B. | continuous |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» C. both a & b | |
| 73. |
Which is the complete specification of the state of the world? |
| A. | atomic event |
| B. | complex event |
| C. | simple event |
| D. | none of the mentioned |
| Answer» B. complex event | |
| 74. |
What is the basic element for a language? |
| A. | literal |
| B. | variable |
| C. | random variable |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 75. |
How many formal languages are used for stating propositions? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 76. |
Where does the degree of belief are applied? |
| A. | propositions |
| B. | literals |
| C. | variables |
| D. | statements |
| Answer» B. literals | |
| 77. |
What is used for probability theory sentences? |
| A. | conditional logic |
| B. | logic |
| C. | extension of propositional logic |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 78. |
How many issues are available in describing degree of belief? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 79. |
Which is omitted in prolog unification algorithm? |
| A. | variable check |
| B. | occur check |
| C. | proposition check |
| D. | both b & c |
| Answer» C. proposition check | |
| 80. |
What form of negation does the prolog allows? |
| A. | negation as failure |
| B. | proposition |
| C. | substitution |
| D. | negation as success |
| Answer» B. proposition | |
| 81. |
How the logic programming can be constructed? |
| A. | variables |
| B. | expressing knowledge in a formal language |
| C. | graph |
| D. | all of the mentioned |
| Answer» C. graph | |
| 82. |
Which algorithm are in more similar to backward chainiing algorithm? |
| A. | depth-first search algorithm |
| B. | breadth-first search algorithm |
| C. | hill-climbing search algorithm |
| D. | all of the mentioned |
| Answer» B. breadth-first search algorithm | |
| 83. |
What are used in backward chaining algorithm? |
| A. | conjucts |
| B. | substitution |
| C. | composition of substitution |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 84. |
How can be the goal is thought of in backward chaining algorithm? |
| A. | queue |
| B. | list |
| C. | vector |
| D. | stack |
| Answer» E. | |
| 85. |
What will backward chaining algorithm will return? |
| A. | additional statements |
| B. | substitutes matching the query |
| C. | logical statement |
| D. | all of the mentioned |
| Answer» C. logical statement | |
| 86. |
Which is mainly used for automated reasoning? |
| A. | backward chaining |
| B. | forward chaining |
| C. | logic programming |
| D. | parallel programming |
| Answer» D. parallel programming | |
| 87. |
Which algorithm will work backward from the goal to solve a problem? |
| A. | forward chaining |
| B. | backward chaining |
| C. | hill-climb algorithm |
| D. | none of the mentioned |
| Answer» C. hill-climb algorithm | |
| 88. |
Which will be the instance of the class datalog knowledge bases? |
| A. | variables |
| B. | no function symbols |
| C. | first-order definite clauses |
| D. | none of the mentioned |
| Answer» C. first-order definite clauses | |
| 89. |
Which are more suitable normal form to be used with definite clause? |
| A. | positive literal |
| B. | negative literal |
| C. | generalized modus ponens |
| D. | neutral literal |
| Answer» D. neutral literal | |
| 90. |
How many types of 3-D image processing techniques are there in image perception? |
| A. | 3 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |
| 91. |
What is the process of breaking an image into groups? |
| A. | edge detection |
| B. | smoothing |
| C. | segmentation |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 92. |
Which is meant by assuming any two neighboring that are both edge pixels with consistent orientation? |
| A. | canny edge detection |
| B. | smoothing |
| C. | segmentation |
| D. | none of the mentioned |
| Answer» B. smoothing | |
| 93. |
How many types of image processing techniques are there in image perception? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 94. |
What is meant by predicting the value of a state variable from the past? |
| A. | specular reflection |
| B. | diffuse reflection |
| C. | gaussian filter |
| D. | smoothing |
| Answer» E. | |
| 95. |
How many kinds of reflection are available in image perception? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 96. |
How to increase the brightness of the pixel? |
| A. | sound |
| B. | amount of light |
| C. | surface |
| D. | waves |
| Answer» C. surface | |
| 97. |
What is the study of light? |
| A. | biology |
| B. | lightology |
| C. | photometry |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 98. |
What is used to initiate the perception in the environment? |
| A. | sensor |
| B. | read |
| C. | actuators |
| D. | none of the mentioned |
| Answer» B. read | |
| 99. |
Which provides agents with information about the world they inhabit? |
| A. | sense |
| B. | perception |
| C. | reading |
| D. | hearing |
| Answer» C. reading | |
| 100. |
A perception check is |
| A. | a cognitive bias that makes us listen only to information we already agree with. |
| B. | a method teachers use to reward good listeners in the classroom. |
| C. | any factor that gets in the way of good listening and decreases our ability to interpret correctly. |
| D. | a response that allows you to state your interpretation and ask your partner whether or not that interpretation is correct. |
| Answer» E. | |