MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 18 Mcqs, each offering curated multiple-choice questions to sharpen your Artificial Intelligence knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
A knowledge engineer has the job of extracting knowledge from an expert and building the expert system knowledge base. State whether true or false. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
ARGEX is an agricultural expert system that gives correct advice to farmers. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 3. |
GERMWATCHER is used to control infections caused by bacteria. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
MYSIN attempts to recommend appropriate therapies for patients with bacterial infections. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 5. |
In order to utilize generalized Modus Ponens, all sentences in the KB must be in the form of Horn sentences. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
What among the following could the universal instantiation of ___________For all x King(x) ^ Greedy(x) => Evil(x) |
| A. | King(John) ^ Greedy(John) => Evil(John) |
| B. | King(y) ^ Greedy(y) => Evil(y) |
| C. | King(Richar |
| D. | ^ Greedy(Richard) => Evil(Richard)d) All of the mentioned |
| Answer» E. | |
| 7. |
An inference algorithm that derives only entailed sentences is called sound or truth-preserving. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 8. |
The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base |
| A. | True |
| B. | False |
| Answer» B. False | |
| 9. |
The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 10. |
Two basic types of inferences are1. ____________2. ____________ |
| A. | Reduction to propositional logic, Manipulate rules directly |
| B. | Reduction to propositional logic, Apply modus ponen |
| C. | Apply modus ponen, Manipulate rules directly |
| D. | Convert every rule to Horn Clause, Reduction to propositional logic |
| Answer» B. Reduction to propositional logic, Apply modus ponen | |
| 11. |
For resolution to apply, all sentences must be in conjunctive normal form, a conjunction of disjunctions of literals. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 12. |
The basic inference mechanism in semantic network is to follow the links between the nodes. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 13. |
There exists two way to infer using semantic networks.1) Intersection Search2) Inheritance Search |
| A. | True |
| B. | False |
| Answer» B. False | |
| 14. |
Most semantic networks are not cognitive based. |
| A. | True |
| B. | False |
| Answer» C. | |
| 15. |
A) Knowledge base (KB) is consists of set of statements.B) Inference is deriving a new sentence from the KB.Choose the correct option. |
| A. | A is true, B is true |
| B. | A is false, B is false |
| C. | A is true, B is false |
| D. | A is false, B is true |
| Answer» B. A is false, B is false | |
| 16. |
Like relational databases there does exists fuzzy relational databases. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 17. |
Which variable can give the concrete form to the representation of thetransition model? |
| A. | Single variable |
| B. | Discrete state variable |
| C. | Random variable |
| D. | Both Single & Discrete state variable |
| Answer» E. | |
| 18. |
There exists two way to infer using semantic networks in which knowledge is represented as Frames.1) Intersection Search2) Inheritance Search |
| A. | True |
| B. | False |
| Answer» B. False | |