adplus-dvertising

Welcome to the Artificial Intelligence MCQs Page

Dive deep into the fascinating world of Artificial Intelligence with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Artificial Intelligence, a crucial aspect of UGC CBSE NET Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Artificial Intelligence, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within UGC CBSE NET Exam.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Artificial Intelligence. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of UGC CBSE NET Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Artificial Intelligence. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Artificial Intelligence MCQs | Page 3 of 12

Explore more Topics under UGC CBSE NET Exam

Q21.
Match the following :

List – I List – II

(a) Intelligence (i) Contextual, tacit, transfer needs learning

(b) Knowledge (ii) Scattered facts, easily transferable

(c) Information (iii) Judgmental

(d) Data (iv) Codifiable, endorsed with relevance and purpose

code:
a b c d

a.

(iii) (ii) (iv) (i)

b.

(iii) (i) (iv) (ii)

c.

(i) (ii) (iii) (iv)

d.

(i) (iii) (iv) (ii)

Discuss
Answer: (b).(iii) (i) (iv) (ii)
Q22.
Which of the following statements is true for Branch - and - Bound search?

a.

Underestimates of remaining distance may cause deviation from optimal path

b.

Overestimates can't cause right path to be overlooked

c.

Dynamic programming principle can be used to discard redundant partial paths

d.

All of the above

Discuss
Answer: (c).Dynamic programming principle can be used to discard redundant partial paths
Q23.
Match the following with respect to heuristic search techniques:

List – I List – II

(a) Steepest - accent Hill Climbing (i) Keeps track of all partial paths which can be candidate for further exploration

(b) Branch - and - bound (ii) Discover problem state(s) that satisfy a set of constraints

(c) Constraint satisfaction (iii) Detects difference between current state and goal state

(d) Means - end - analysis (iv) Considers all moves from current state and selects best move

code:
a b c d

a.

(i) (iv) (iii) (ii)

b.

(iv) (i) (ii) (iii)

c.

(i) (iv) (ii) (iii)

d.

(iv) (ii) (i) (iii)

Discuss
Answer: (b).(iv) (i) (ii) (iii)
Q24.
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of :

a.

rows or columns

b.

rows + columns

c.

rows + columns – 1

d.

rows + columns + 1

Discuss
Answer: (a).rows or columns
Q25.
Given the following statements with respect to linear programming problem :

S1: The dual of the dual linear programming problem is again the primal problem

S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution.

S3: If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal.

Which of the following is true?

a.

S1 and S2

b.

S1 and S3

c.

S2 and S3

d.

S1, S2 and S3

Discuss
Answer: (d).S1, S2 and S3
Q26.
Consider the two class classification task that consists of the following points :

Class C1 : [1 1.5]   [1 -1.5]

Class C2 : [-2 2.5]   [-2 -2.5]

The decision boundary between the two classes using single perceptron is given by:

a.

x1 + x2 + 1.5 = 0

b.

x1 + x2 -1.5 = 0

c.

x1 + 1.5 = 0

d.

x1 - 1.5 = 0

Discuss
Answer: (c).x1 + 1.5 = 0
Q27.
Which one of the following describes the syntax of prolog program ?

I. Rules and facts are terminated by full stop (.)
II. Rules and facts are terminated by semicolon (;)
III. Variables names must with upper case alphabets.
IV. Variables names must start with lower case alphabets.

a.

I, II

b.

I, III

c.

III, IV

d.

II, IV

Discuss
Answer: (b).I, III
Q28.
Match the following: 

List-I                                                                          List-II

a. Expert systems                                                    i.  Pragmatics

b. Planning                                                               ii.  Resolution

c. Prolog                                                                   iii. Means-end analysis

d. Natural language processing                          iv. Explanation facility

Codes:

a       b       c       d

a.

iii       iv       i       ii

b.

iii       iv       ii       i

c.

i       ii       iii       iv

d.

iv       iii       ii       i

Discuss
Answer: (d).iv       iii       ii       i
Q29.
STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to which one of the following ?

a.

SHAKEY

b.

SRI

c.

NLP

d.

None of these

Discuss
Answer: (c).NLP
Q30.
_________ predicate calculus allows quantified   variables   to   refer  to objects in the domain of discourse and not to predicates or functions.

a.

Zero-order

b.

First-order

c.

Second-order

d.

High-order

Discuss
Answer: (b).First-order
Page 3 of 12

Suggested Topics

Are you eager to expand your knowledge beyond Artificial Intelligence? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Software Engineering

Learn about the systematic approach to developing software with our Software...