McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Master of Science in Computer Science (MSc CS) .
| 51. |
How to increase the brightness of the pixel? |
| A. | sound |
| B. | amount of light |
| C. | surface |
| D. | waves |
| Answer» B. amount of light | |
| 52. |
How many kinds of reflection are available in image perception? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 53. |
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» D. smoothing | |
| 54. |
How many types of image processing techniques are there in image perception? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 55. |
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» A. canny edge detection | |
| 56. |
What is the process of breaking an image into groups? |
| A. | edge detection |
| B. | smoothing |
| C. | segmentation |
| D. | none of the mentioned |
| Answer» C. segmentation | |
| 57. |
How many types of 3-D image processing techniques are there in image perception? |
| A. | 3 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» C. 5 | |
| 58. |
Which closely resembles propositional definite clause? |
| A. | resolution |
| B. | inference |
| C. | conjuction |
| D. | first-order definite clauses |
| Answer» D. first-order definite clauses | |
| 59. |
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» C. generalized modus ponens | |
| 60. |
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» B. no function symbols | |
| 61. |
Which knowledge base is called as fixed point? |
| A. | first-order definite clause are similar to propositional forward chaining |
| B. | first-order definite clause are mismatch to propositional forward chaining |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» A. first-order definite clause are similar to propositional forward chaining | |
| 62. |
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» B. backward chaining | |
| 63. |
Which is mainly used for automated reasoning? |
| A. | backward chaining |
| B. | forward chaining |
| C. | logic programming |
| D. | parallel programming |
| Answer» C. logic programming | |
| 64. |
What will backward chaining algorithm will return? |
| A. | additional statements |
| B. | substitutes matching the query |
| C. | logical statement |
| D. | all of the mentioned |
| Answer» B. substitutes matching the query | |
| 65. |
How can be the goal is thought of in backward chaining algorithm? |
| A. | queue |
| B. | list |
| C. | vector |
| D. | stack |
| Answer» D. stack | |
| 66. |
What are used in backward chaining algorithm? |
| A. | conjucts |
| B. | substitution |
| C. | composition of substitution |
| D. | none of the mentioned |
| Answer» C. composition of substitution | |
| 67. |
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» A. depth-first search algorithm | |
| 68. |
Which problem can frequently occur in backward chaining algorithm? |
| A. | repeated states |
| B. | incompleteness |
| C. | complexity |
| D. | both a & b |
| Answer» D. both a & b | |
| 69. |
How the logic programming can be constructed? |
| A. | variables |
| B. | expressing knowledge in a formal language |
| C. | graph |
| D. | all of the mentioned |
| Answer» B. expressing knowledge in a formal language | |
| 70. |
What form of negation does the prolog allows? |
| A. | negation as failure |
| B. | proposition |
| C. | substitution |
| D. | negation as success |
| Answer» A. negation as failure | |
| 71. |
Which is omitted in prolog unification algorithm? |
| A. | variable check |
| B. | occur check |
| C. | proposition check |
| D. | both b & c |
| Answer» B. occur check | |
| 72. |
How many issues are available in describing degree of belief? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 73. |
What is used for probability theory sentences? |
| A. | conditional logic |
| B. | logic |
| C. | extension of propositional logic |
| D. | none of the mentioned |
| Answer» C. extension of propositional logic | |
| 74. |
Where does the degree of belief are applied? |
| A. | propositions |
| B. | literals |
| C. | variables |
| D. | statements |
| Answer» A. propositions | |
| 75. |
How many formal languages are used for stating propositions? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 76. |
What is the basic element for a language? |
| A. | literal |
| B. | variable |
| C. | random variable |
| D. | all of the mentioned |
| Answer» C. random variable | |
| 77. |
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» A. atomic event | |
| 78. |
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» B. continuous | |
| 79. |
Which is created by using single propositional symbol? |
| A. | complex sentences |
| B. | atomic sentences |
| C. | composition sentences |
| D. | none of the mentioned |
| Answer» B. atomic sentences | |
| 80. |
Which is used to construct the complex sentences? |
| A. | symbols |
| B. | connectives |
| C. | logical connectives |
| D. | all of the mentioned |
| Answer» C. logical connectives | |
| 81. |
How many proposition symbols are there in artificial intelligence? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 82. |
How many logical connectives are there in artificial intelligence? |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» D. 5 | |
| 83. |
Which is used to compute the truth of any sentence? |
| A. | semantics of propositional logic |
| B. | alpha-beta pruning |
| C. | first-order logic |
| D. | both a & b |
| Answer» A. semantics of propositional logic | |
| 84. |
Which are needed to compute the logical inference algorithm? |
| A. | logical equivalence |
| B. | validity |
| C. | satisfiability |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 85. |
From which rule does the modus ponens are derived? |
| A. | inference rule |
| B. | module rule |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» A. inference rule | |
| 86. |
Which is also called single inference rule? |
| A. | reference |
| B. | resolution |
| C. | reform |
| D. | none of the mentioned |
| Answer» B. resolution | |
| 87. |
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» A. conjunctive normal form | |
| 88. |
What can be viewed as single leteral of disjunction? |
| A. | multiple clause |
| B. | combine clause |
| C. | unit clause |
| D. | none of the mentioned |
| Answer» C. unit clause | |
| 89. |
Which is a refutation complete inference procedure for propositional logic? |
| A. | clauses |
| B. | variables |
| C. | propositional resolution |
| D. | proposition |
| Answer» C. propositional resolution | |
| 90. |
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» A. disjunction of literals | |
| 91. |
What is the condition of literals in variables? |
| A. | existentially quantified |
| B. | universally quantified |
| C. | quantified |
| D. | none of the mentioned |
| Answer» B. universally quantified | |
| 92. |
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» C. every sentence of first-order logic | |
| 93. |
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» D. original statement | |
| 94. |
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» A. propositional resolution rule | |
| 95. |
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» B. if one is the negation of the other | |
| 96. |
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» B. removal of redundant literal | |
| 97. |
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» C. reduced to one | |
| 98. |
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» B. sentence is unsatisfiable | |
| 99. |
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» B. fuzzy logic | |
| 100. |
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» C. tutoring module | |
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.