MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 69 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.
| 1. |
What is called inconsistent support? |
| A. | if two literals are not negation of other |
| B. | if two literals are negation of other |
| C. | mutually exclusive |
| D. | none of the mentioned |
| Answer» C. mutually exclusive | |
| 2. |
How many conditions are available between two actions in mutex relation? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 3. |
When will further expansion is unnecessary for planning graph? |
| A. | identical |
| B. | replicate |
| C. | not identical |
| D. | none of the mentioned |
| Answer» B. replicate | |
| 4. |
What is meant by persistence actions? |
| A. | allow a literal to remain false |
| B. | allow a literal to remain true |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» C. both a & b | |
| 5. |
Which kind of problem is suitable for planning graph? |
| A. | propositional planning problem |
| B. | planning problem |
| C. | action problem |
| D. | none of the mentioned |
| Answer» B. planning problem | |
| 6. |
What are present in each level of planning graph? |
| A. | literals |
| B. | actions |
| C. | variables |
| D. | both a & b |
| Answer» E. | |
| 7. |
What is the starting level of planning graph? |
| A. | level 3 |
| B. | level 2 |
| C. | level 1 |
| D. | level 0 |
| Answer» E. | |
| 8. |
What are present in the planning graph? |
| A. | sequence of levels |
| B. | literals |
| C. | variables |
| D. | heuristic estimates |
| Answer» B. literals | |
| 9. |
Which is used to extract solution directly from the planning graph? |
| A. | planning algorithm |
| B. | graph plan |
| C. | hill-climbing search |
| D. | all of the mentioned |
| Answer» C. hill-climbing search | |
| 10. |
Which data structure is used to give better heuristic estimates? |
| A. | forwards state-space |
| B. | backward state-space |
| C. | planning graph algorithm |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 11. |
Which search method will expand the node that is closest to the goal? |
| A. | best-first search |
| B. | greedy best-first search |
| C. | a* search |
| D. | none of the mentioned |
| Answer» C. a* search | |
| 12. |
Which is used to improve the performance of heuristic search? |
| A. | quality of nodes |
| B. | quality of heuristic function |
| C. | simple form of nodes |
| D. | none of the mentioned |
| Answer» C. simple form of nodes | |
| 13. |
Which search is complete and optimal when h(n) is consistent? |
| A. | best-first search |
| B. | depth-first search |
| C. | both a & b |
| D. | a* search |
| Answer» E. | |
| 14. |
Which method is used to search better by learning? |
| A. | best-first search |
| B. | depth-first search |
| C. | metalevel state space |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 15. |
Which search uses only the linear space for searching? |
| A. | best-first search |
| B. | recursive best-first search |
| C. | depth-first search |
| D. | none of the mentioned |
| Answer» C. depth-first search | |
| 16. |
What is the heuristic function of greedy best-first search? |
| A. | f(n) != h(n) |
| B. | f(n) < h(n) |
| C. | f(n) = h(n) |
| D. | f(n) > h(n) |
| Answer» D. f(n) > h(n) | |
| 17. |
Which function will select the lowest expansion node atfirst for evaluation? |
| A. | greedy best-first search |
| B. | best-first search |
| C. | both a & b |
| D. | none of the mentioned |
| Answer» C. both a & b | |
| 18. |
How many types of informed search method are in artificial intelligence? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» E. | |
| 19. |
What is the other name of informed search strategy? |
| A. | simple search |
| B. | heuristic search |
| C. | online search |
| D. | none of the mentioned |
| Answer» C. online search | |
| 20. |
How the decision tree reaches its decision? |
| A. | single test |
| B. | two test |
| C. | sequence of test |
| D. | no test |
| Answer» D. no test | |
| 21. |
End Nodes are represented by, |
| A. | disks |
| B. | squares |
| C. | circles |
| D. | triangles |
| Answer» E. | |
| 22. |
Chance Nodes are represented by, |
| A. | disks |
| B. | squares |
| C. | circles |
| D. | triangles |
| Answer» D. triangles | |
| 23. |
Decision Nodes are represented by, |
| A. | disks |
| B. | squares |
| C. | circles |
| D. | triangles |
| Answer» C. circles | |
| 24. |
Choose from the following that are Decision Tree nodes |
| A. | decision nodes |
| B. | weighted nodes |
| C. | chance nodes |
| D. | end nodes |
| Answer» E. | |
| 25. |
How many types of learning are available in machine learning? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 26. |
A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. |
| A. | decision tree |
| B. | graphs |
| C. | trees |
| D. | neural networks |
| Answer» B. graphs | |
| 27. |
How many possible sources of complexity are there in forward chaining? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 28. |
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» C. data complexity | |
| 29. |
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» D. all of the mentioned | |
| 30. |
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» C. data complexity | |
| 31. |
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» B. first-order definite clause is mismatch to propositional forward chaining | |
| 32. |
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» C. first-order definite clauses | |
| 33. |
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» D. neutral literal | |
| 34. |
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» C. both a & b | |
| 35. |
Which closely resembles propositional definite clause? |
| A. | resolution |
| B. | inference |
| C. | conjunction |
| D. | first-order definite clauses |
| Answer» E. | |
| 36. |
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» D. all of the mentioned | |
| 37. |
What kind of interpretation is done by adding context dependent information? |
| A. | semantic |
| B. | syntactic |
| C. | pragmatic |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 38. |
How many types of quantification are available in artificial intelligence? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 39. |
How many verb tenses are there in English language? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 40. |
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» D. none of the mentioned | |
| 41. |
What is the process of associating an FOL expression with a phrase? |
| A. | interpretation |
| B. | augment reality |
| C. | semantic interpretation |
| D. | augment interpretation |
| Answer» D. augment interpretation | |
| 42. |
The Personal Consultant is based on: |
| A. | emycin |
| B. | ops5+ |
| C. | xcon |
| D. | all of the mentioned |
| Answer» E. | |
| 43. |
The first AI programming language was called: |
| A. | basic |
| B. | fortran |
| C. | ipl(inductive logic programming) |
| D. | lisp |
| Answer» E. | |
| 44. |
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» E. | |
| 45. |
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» E. | |
| 46. |
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» C. features the retrieval of stored information | |
| 47. |
A mouse device may be: |
| A. | electro-chemical |
| B. | mechanical |
| C. | optical |
| D. | both b and c |
| Answer» E. | |
| 48. |
In LISP, the atom that stands for “true†is |
| A. | t |
| B. | ml |
| C. | y |
| D. | time |
| Answer» B. ml | |
| 49. |
Elementary linguistic units which are smaller than words are: |
| A. | allophones |
| B. | phonemes |
| C. | syllables |
| D. | all of the mentioned |
| Answer» E. | |
| 50. |
The primary interactive method of communication used by humans is: |
| A. | reading |
| B. | writing |
| C. | speaking |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |