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) .
| 1. |
Fuzzy logic is a form of |
| A. | two-valued logic |
| B. | crisp set logic |
| C. | many-valued logic |
| D. | binary set logic |
| Answer» C. many-valued logic | |
| 2. |
The truth values of traditional set theory is ____________ and that of fuzzy set is __________ |
| A. | either 0 or 1, between 0 & 1 |
| B. | between 0 & 1, either 0 or 1 |
| C. | between 0 & 1, between 0 & 1 |
| D. | either 0 or 1, either 0 or 1 |
| Answer» A. either 0 or 1, between 0 & 1 | |
| 3. |
How many types of random variables are available? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 4. |
The values of the set membership is represented by |
| A. | discrete set |
| B. | degree of truth |
| C. | probabilities |
| D. | both b & c |
| Answer» B. degree of truth | |
| 5. |
What is meant by probability density function? |
| A. | probability distributions |
| B. | continuous variable |
| C. | discrete variable |
| D. | probability distributions for continuous variables |
| Answer» D. probability distributions for continuous variables | |
| 6. |
Which of the following 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 | |
| 7. |
Fuzzy Set theory defines fuzzy operators. Choose the fuzzy operators from the following. |
| A. | and |
| B. | or |
| C. | not |
| D. | ex-or |
| Answer» C. not | |
| 8. |
There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. |
| A. | hedges |
| B. | lingual variable |
| C. | fuzz variable |
| D. | none of the mentioned |
| Answer» A. hedges | |
| 9. |
Where does the Bayes rule can be used? |
| A. | solving queries |
| B. | increasing complexity |
| C. | decreasing complexity |
| D. | answering probabilistic query |
| Answer» D. answering probabilistic query | |
| 10. |
What does the Bayesian network provides? |
| A. | complete description of the domain |
| B. | partial description of the domain |
| C. | complete description of the problem |
| D. | none of the mentioned |
| Answer» A. complete description of the domain | |
| 11. |
Fuzzy logic is usually represented as |
| A. | if-then-else rules |
| B. | if-then rules |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» B. if-then rules | |
| 12. |
______________ is/are the way/s to represent uncertainty. |
| A. | fuzzy logic |
| B. | probability |
| C. | entropy |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 13. |
____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. |
| A. | fuzzy relational db |
| B. | ecorithms |
| C. | fuzzy set |
| D. | none of the mentioned |
| Answer» C. fuzzy set | |
| 14. |
Which condition is used to influence a variable directly by all the others? |
| A. | partially connected |
| B. | fully connected |
| C. | local connected |
| D. | none of the mentioned |
| Answer» B. fully connected | |
| 15. |
What is the consequence between a node and its predecessors while creating Bayesian network? |
| A. | conditionally dependent |
| B. | dependent |
| C. | conditionally independent |
| D. | both a & b |
| Answer» C. conditionally independent | |
| 16. |
How many terms are required for building a Bayesian model? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 17. |
What is needed to make probabilistic systems feasible in the world? |
| A. | reliability |
| B. | crucial robustness |
| C. | feasibility |
| D. | none of the mentioned |
| Answer» B. crucial robustness | |
| 18. |
How the entries in the full joint probability distribution can be calculated? |
| A. | using variables |
| B. | using information |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» B. using information | |
| 19. |
How the Bayesian network can be used to answer any query? |
| A. | full distribution |
| B. | joint distribution |
| C. | partial distribution |
| D. | all of the mentioned |
| Answer» B. joint distribution | |
| 20. |
How the compactness of the Bayesian network can be described? |
| A. | locally structured |
| B. | fully structured |
| C. | partial structure |
| D. | all of the mentioned |
| Answer» A. locally structured | |
| 21. |
To which does the local structure is associated? |
| A. | hybrid |
| B. | dependent |
| C. | linear |
| D. | none of the mentioned |
| Answer» C. linear | |
| 22. |
The primary interactive method of communication used by humans is: |
| A. | reading |
| B. | writing |
| C. | speaking |
| D. | all of the mentioned |
| Answer» C. speaking | |
| 23. |
Elementary linguistic units which are smaller than words are: |
| A. | allophones |
| B. | phonemes |
| C. | syllables |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 24. |
In LISP, the atom that stands for “true” is |
| A. | t |
| B. | ml |
| C. | y |
| D. | time |
| Answer» A. t | |
| 25. |
A mouse device may be: |
| A. | electro-chemical |
| B. | mechanical |
| C. | optical |
| D. | both b and c |
| Answer» D. both b and c | |
| 26. |
An expert system differs from a database program in that only an expert system: |
| A. | contains declarative knowledge |
| B. | contains procedural knowledge |
| C. | features the retrieval of stored information |
| D. | expects users to draw their own conclusions |
| Answer» B. contains procedural knowledge | |
| 27. |
Natural language understanding is used in: |
| A. | natural language interfaces |
| B. | natural language front ends |
| C. | text understanding systems |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 28. |
Which of the following are examples of software development tools? |
| A. | debuggers |
| B. | editors |
| C. | assemblers, compilers and interpreters |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 29. |
The first AI programming language was called: |
| A. | basic |
| B. | fortran |
| C. | ipl(inductive logic programming) |
| D. | lisp |
| Answer» D. lisp | |
| 30. |
The Personal Consultant is based on: |
| A. | emycin |
| B. | ops5+ |
| C. | xcon |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 31. |
What is the extraction of the meaning of utterance? |
| A. | syntactic |
| B. | semantic |
| C. | pragmatic |
| D. | none of the mentioned |
| Answer» B. semantic | |
| 32. |
What is the process of associating an FOL expression with a phrase? |
| A. | interpretation |
| B. | augment reality |
| C. | semantic interpretation |
| D. | augment interpretation |
| Answer» C. semantic interpretation | |
| 33. |
What is meant by compositional semantics? |
| A. | determining the meaning |
| B. | logical connectives |
| C. | semantics |
| D. | none of the mentioned |
| Answer» A. determining the meaning | |
| 34. |
What is used to augment a grammar for arithmetic expression with semantics? |
| A. | notation |
| B. | dcg (definite clause grammar) notation |
| C. | constituent |
| D. | all of the mentioned |
| Answer» B. dcg (definite clause grammar) notation | |
| 35. |
What can’t be done in the semantic interpretation? |
| A. | logical term |
| B. | complete logical sentence |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» C. both a & b | |
| 36. |
How many verb tenses are there in English language? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 37. |
Which is used to mediate between syntax and semantics? |
| A. | form |
| B. | intermediate form |
| C. | grammar |
| D. | all of the mentioned |
| Answer» B. intermediate form | |
| 38. |
What is meant by quasi-logical form? |
| A. | sits between syntactic and logical form |
| B. | logical connectives |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» A. sits between syntactic and logical form | |
| 39. |
How many types of quantification are available in artificial intelligence? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 40. |
What kind of interpretation is done by adding context dependent information? |
| A. | semantic |
| B. | syntactic |
| C. | pragmatic |
| D. | none of the mentioned |
| Answer» C. pragmatic | |
| 41. |
Which condition is used to cease the growth of forward chaining? |
| A. | atomic sentences |
| B. | complex sentences |
| C. | no further inference |
| D. | all of the mentioned |
| Answer» C. no further inference | |
| 42. |
Which closely resembles propositional definite clause? |
| A. | resolution |
| B. | inference |
| C. | conjunction |
| D. | first-order definite clauses |
| Answer» D. first-order definite clauses | |
| 43. |
What is the condition of variables in first-order literals? |
| A. | existentially quantified |
| B. | universally quantified |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» B. universally quantified | |
| 44. |
Which is 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 | |
| 45. |
Which will be the instance of the class data log knowledge bases? |
| A. | variables |
| B. | no function symbols |
| C. | first-order definite clauses |
| D. | none of the mentioned |
| Answer» B. no function symbols | |
| 46. |
Which knowledge base is called as fixed point? |
| A. | first-order definite clause is similar to propositional forward chaining |
| B. | first-order definite clause is mismatch to propositional forward chaining |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» A. first-order definite clause is similar to propositional forward chaining | |
| 47. |
How to eliminate the redundant rule matching attempts in the forward chaining? |
| A. | decremental forward chaining |
| B. | incremental forward chaining |
| C. | data complexity |
| D. | none of the mentioned |
| Answer» B. incremental forward chaining | |
| 48. |
From where did the new fact inferred on new iteration is derived? |
| A. | old fact |
| B. | narrow fact |
| C. | new fact |
| D. | all of the mentioned |
| Answer» C. new fact | |
| 49. |
Which will solve the conjuncts of the rule so that the total cost is minimized? |
| A. | constraint variable |
| B. | conjunct ordering |
| C. | data complexity |
| D. | all of the mentioned |
| Answer» B. conjunct ordering | |
| 50. |
How many possible sources of complexity are there in forward chaining? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
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.