# Artificial Intelligence MCQ (Multiple Choice Questions) - SchoolingAxis

Que- 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

Ans- New fact

Que- 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

Ans- Conjunct ordering

Que- How many possible sources of complexity are there in forward chaining?

a. 1

b. 2

c. 3

d. 4

Ans- 3

Que- 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

Ans- Backward chaining

Que- Which is mainly used for automated reasoning?

a. Backward chaining

b. Forward chaining

c. Logic programming

d. Parallel programming

Ans- Logic programming

Que- What will backward chaining algorithm will return?

b. Substitutes matching the query

c. Logical statement

d. All of the mentioned

Ans- Substitutes matching the query

Que- How can be the goal is thought of in backward chaining algorithm?

a. Queue

b. List

c. Vector

d. Stack

Ans- Stack

Que- What are used in backward chaining algorithm?

a. Conjuncts

b. Substitution

c. Composition of substitution

d. None of the mentioned

Ans- Composition of substitution

Que- Which algorithm are in more similar to backward chaining algorithm?

a. Depth-first search algorithm

b. Breadth-first search algorithm

c. Hill-climbing search algorithm

d. All of the mentioned

Ans- Depth-first search algorithm

Que- Which problem can frequently occur in backward chaining algorithm?

a. Repeated states

b. Incompleteness

c. Complexity

d. Both Repeated states & Incompleteness

Ans- Both Repeated states & Incompleteness

Que- How the logic programming can be constructed?

a. Variables

b. Expressing knowledge in a formal language

c. Graph

d. All of the mentioned

Ans- Expressing knowledge in a formal language

Que- What form of negation does the prolog allows?

a. Negation as failure

b. Proposition

c. Substitution

d. Negation as success

Ans- Negation as failure

Que- Which is omitted in prolog unification algorithm?

a. Variable check

b. Occur check

c. Proposition check

d. Both Occur & Proposition check

Ans- Occur check

Que- Knowledge and reasoning also play a crucial role in dealing with __________________ environment.

a. Completely Observable

b. Partially Observable

c. Neither Completely  nor Partially Observable

d. Only Completely and Partially Observable

Ans- Partially Observable

Que- Treatment chosen by doctor for a patient for a disease is based on

a. Only current symptoms

b. Current symptoms plus some knowledge from the textbooks

c. Current symptoms plus some knowledge from the textbooks plus experience

d. All of the mentioned

Ans- Current symptoms plus some knowledge from the textbooks plus experience

Que- A knowledge-based agent can combine general knowledge with current percepts to infer hidden aspects of the current state prior to selecting actions. State whether True or False.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- 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

Ans- A is true, B is true

Que- Wumpus World is a classic problem, best example of _______

a. Single player Game

b. Two player Game

c. Reasoning with Knowledge

d. Knowledge based Game

Ans- Reasoning with Knowledge

Que- Which is not a property of representation of knowledge?

a. Representational Verification

d. Inferential Efficiency

Ans- Representational Verification

Que- Which is not Familiar Connectives in First Order Logic?

a. and

b. iff

c. or

d. not

Ans- not

Que- Inference algorithm is complete only if,

a. It can derive any sentence

b. It can derive any sentence that is an entailed version

c. It is truth preserving

d. It can derive any sentence that is an entailed version & It is truth preserving

Ans- It can derive any sentence that is an entailed version & It is truth preserving

Que- An inference algorithm that derives only entailed sentences is called sound or truth-preserving.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- 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

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicate

d. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- 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(Richard) ^ Greedy(Richard) => Evil(Richard)

d. All of the mentioned

Ans- All of the mentioned

Que- Lifted inference rules require finding substitutions that make different logical expressions looks identical.

a. Existential Instantiation

b. Universal Instantiation

c. Unification

d. Modus Ponen

Ans- Unification

Que- Which of the following is not the style of inference?

a. Forward Chaining

b. Backward Chaining

c. Resolution Refutation

d. Modus Ponen

Ans- Modus Ponen

Que- In order to utilize generalized Modus Ponens, all sentences in the KB must be in the form of Horn sentences.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- For resolution to apply, all sentences must be in conjunctive normal form, a conjunction of disjunctions of literals.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- Two basic types of inferences are

a. ____________

b. ____________

c. Reduction to propositional logic, Manipulate rules directly

d. Reduction to propositional logic, Apply modus ponen

Ans- Convert every rule to Horn Clause, Reduction to propositional logic

Que- Instead of representing knowledge in a relatively declarative, static way (as a bunch of things that are true), rule-based system represent knowledge in terms of___________ that tell you what you should do or what you could conclude in different situations.

a. Raw Text

b. A bunch of rules

c. Summarized Text

d. Collection of various Texts

Ans- A bunch of rules

Que- A rule-based system consists of a bunch of IF-THEN rules. State whether true or false.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- In a backward chaining system you start with the initial facts, and keep using the rules to draw new conclusions (or take certain actions) given those facts. State whether true or false.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- False

Que- In a backward chaining system, you start with some hypothesis (or goal) you are trying to prove, and keep looking for rules that would allow you to conclude that hypothesis, perhaps setting new sub-goals to prove as you go. State whether true or false.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- Forward chaining systems are _____________ where as backward chaining systems are ___________

a. Goal-driven, goal-driven

b. Goal-driven, data-driven

c. Data-driven, goal-driven

d. Data-driven, data-driven

Ans- Data-driven, goal-driven

Que- A Horn clause is a clause with _______ positive literal.

a. At least one

b. At most one

c. None

d. All

Ans- At most one

Que- ___________ trees can be used to infer in Horn clause systems.

a. Min/Max Tree

b. And/Or Trees

c. Minimum Spanning Trees

d. Binary Search Trees

Ans- And/Or Trees

Que- An expert system is a computer program that contains some of the subject-specific knowledge of one or more human experts. State whether true or false.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- 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

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- Autonomous Question/Answering systems are

a. Expert Systems

b. Rule Based Expert Systems

c. Decision Tree Based Systems

d. All of the mentioned

Ans- All of the mentioned

Que- Following are the applications of Expert systems

a. Disease Diagnosis

b. Planning and Scheduling

c. Decision making

d. All of the mentioned

Ans- All of the mentioned

Que- _________ is/are the well known Expert System/s for medical diagnosis systems

a. MYSIN

c. DENDRAL

d. SMH.PAL

Ans- MYSIN

Que- The main components of the expert systems is/are,

a. Inference Engine

b. Knowledge Base

c. Inference Engine & Knowledge Base

d. None of the mentioned

Ans- Inference Engine & Knowledge Base

Que- There are primarily two modes for an inference engine: forward chaining and backward chaining.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- PXDES is medical expert system, for diagnosis of lung disease.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- CaDet is used for early cancer detection.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- MYSIN attempts to recommend appropriate therapies for patients with bacterial infections.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- GERMWATCHER is used to control infections caused by bacteri

a.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- ARGEX is an agricultural expert system that gives correct advice to farmers.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- Following are the elements, which constitutes to the frame structure.

a. Facts or Data

b. Procedures and default values

c. Frame names

d. Frame reference in hierarchy

Ans- Facts or Data

Que- Like semantic networks, frames can be queried using spreading activation.

a. TRUE

b. False

c. Nothing can be said

d. None of the mentioned

Ans- TRUE

Que- Hyponymy relation means,

a. A is part of B

b. B has A as a part of itself

c. A is subordinate of B

d. A is superordinate of B

Ans- A is subordinate of B