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 12 of 12

Q111.
Consider the following two sentences:

(a) The planning graph data structure can be used to give a better heuristic for a planning problem.
(b) Dropping negative effects from every action schema in a planning problem results in a relaxed problem.

Which of the following is correct with respect to the above sentences?
Discuss
Answer: (b).Both sentence (a) and sentence (b) are true.
Q112.
Consider the set of all possible five-card poker hands dealt fairly from a standard deck of fifty-two cards. How many atomic events are there in the joint probability distribution?
Discuss
Answer: (a).2, 598, 960
Q113.
In Artificial Intelligence (AI), which agent deals with happy and unhappy state?
Discuss
Answer: (d).Utility based agent
Q114.
If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search?
Discuss
Answer: (c).O(b^m)
Q115.
Let P, Q, R and S be Propositions. Assume that the equivalences P⇔(Q∨¬Q) and Q⇔R hold. Then the truth value of the formula (P∧Q)⇒((P∧R)∨S) is always :
Discuss
Answer: (a).True
Q116.
“If X, then Y unless Z” is represented by which of the following formulae in propositional logic?
Discuss
Answer: (b).(X ∧ ¬ Z) → Y
Q117.
Consider the following two well-formed formulas in prepositional logic.

F1 : P ⇒ ¬ P
F2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P)

Which of the following statements is correct?
Discuss
Answer: (a).F1 is Satisfiable, F2 is valid
Discuss
Answer: (a).Both deterministic and fully observable
Page 12 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!