400+ Artificial Intelligence (AI) Multiple Choice Questions (MCQs)

1 .

What is Synonymy relation?

A)

A is part of B

B)

A is a kind of B

C)

A is superordinate of B

D)

A denotes same as B

Correct Answer : Option (D) : A denotes same as B

2 .

What are the limitations of the semantic networks?

A)

Incomplete

B)

Intractability

C)

Has memory constraints

D)

Lack in expressing some of the properties

Correct Answer : Option (D) : Lack in expressing some of the properties

3 .

What is the frame?

A)

Data Type

B)

Data Structure

C)

A way of representing knowledge

D)

None of the above

Correct Answer : Option (C) : A way of representing knowledge

4 .

Which of the following elements constitutes the frame structure?

A)

Facts or Data

B)

Frame names

C)

Frame reference in hierarchy

D)

Procedures and default values

Correct Answer : Option (A) : Facts or Data

5 .

How the buckets are stored in predicate indexing?

A)

Lists

B)

Hashes

C)

Stack

D)

None of the above

Correct Answer : Option (B) : Hashes

Explanation : The buckets can be stored in a hash table for efficient access.

6 .

How many functions are available in the unification and lifting process?

A)

5

B)

4

C)

3

D)

2

Correct Answer : Option (B) : 4

Explanation : The four functions are available in the unification and lifting process are tell, ask, store and fetch.

7 .

What is the process of capturing the inference process as a single inference rule?

A)

Ponens

B)

Clauses

C)

Variables

D)

Generalized Modus Ponens

Correct Answer : Option (D) : Generalized Modus Ponens

Explanation : All kinds of inference process can be captured as a single inference rule that can be called as Generalized modus ponens.

8 .

Which algorithm takes two sentences and returns a unifier?

A)

Inference

B)

Depth-first search

C)

Unify algorithm

D)

Hill-climbing search

Correct Answer : Option (C) : Unify algorithm

Explanation : The unify algorithm takes two sentences and returns a unifier if there is one in the sentence.

9 .

Which is unique up to renaming of variables?

A)

Most general unifier

B)

Unifier

C)

Unifier & Most general unifier

D)

None of the above

Correct Answer : Option (A) : Most general unifier

Explanation : For every unifiable pair of expressions, there is a single most general unifier that is unique up to renaming of variables.

10 .

Which makes the complexity of the entire algorithm quadratic in the size?

A)

Clause

B)

Inference

C)

Resolution

D)

Occur check

Correct Answer : Option (D) : Occur check

Explanation : Occur check makes the complexity of the entire algorithm quadratic in the size of the expressions being unified.