Third component of a planning system is to ___________ a) Detect when a solution has been found b) Detect when solution will be found c) Detect whether solution exists or not d) Detect whether multiple solutions exist

Third component of a planning system is to ___________
a) Detect when a solution has been found
b) Detect when solution will be found
c) Detect whether solution exists or not
d) Detect whether multiple solutions exist
by

1 Answer

Answer :

a) Detect when a solution has been found
by

Related questions

An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Description : An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Last Answer : b) It is guaranteed to return an optimal solution when one exists

Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Last Answer : b) The entire tree so far been generated must be stored in BFS

Strategies that know whether one non-goal state is “more promising” than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search

Description : Strategies that know whether one non-goal state is “more promising” than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search

Last Answer : d) Informed & Heuristic Search

Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Last Answer : a) Deterministic

An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Description : An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Last Answer : a) It terminates with a solution when one exists

A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Last Answer : a) True

When planning the audit, if the auditor has no reason to believe that illegal acts exist, the auditor should a. Include audit procedures which have a strong probability of detecting illegal acts. b. Make inquiries of management regarding their policies and regarding their knowledge of violations, and then rely on normal audit procedures to detect errors, irregularities, and illegalities. c. Still include some audit procedures designed specifically to uncover illegalities. d. Ignore the topic

Description : When planning the audit, if the auditor has no reason to believe that illegal acts exist, the auditor should a. Include audit procedures which have a strong probability of detecting illegal ... c. Still include some audit procedures designed specifically to uncover illegalities. d. Ignore the topic

Last Answer : Make inquiries of management regarding their policies and regarding their knowledge of violations, and then rely on normal audit procedures to detect errors, irregularities, and illegalities

When planning the audit, if the auditor has no reason to believe that illegal acts exist, the auditor should a. Make inquiries of management regarding their policies and their knowledge of violations, and then rely on normal audit procedures to detect errors, irregularities, and illegalities. b. Still include some audit procedures designed specifically to uncover illegalities. c. Ignore the topic. d. Include audit procedures which have a strong probability of detecting illegal acts

Description : When planning the audit, if the auditor has no reason to believe that illegal acts exist, the auditor should a. Make inquiries of management regarding their policies and their knowledge of ... Ignore the topic. d. Include audit procedures which have a strong probability of detecting illegal acts

Last Answer : Make inquiries of management regarding their policies and their knowledge of violations, and then rely on normal audit procedures to detect errors, irregularities, and illegalities

Assertion (A) Both rhombic and monoclinic sulphur exist as `S_(8)` but oxygen exists as `O_(2)`. Reason (R ) Oxygen forms `ppi-ppi` multiple bond due

Description : Assertion (A) Both rhombic and monoclinic sulphur exist as `S_(8)` but oxygen exists as `O_(2)`. Reason (R ) Oxygen forms `ppi-ppi` multiple bond due

Last Answer : Assertion (A) Both rhombic and monoclinic sulphur exist as `S_(8)` but oxygen exists as `O_ ... Statement-I is not correct and Statement-II is correct

62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above

Description : 62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above

Last Answer : b. Feasible region should have a line segment

If all of the ground detection lamps burn with equal brilliance, whether the test button is depressed or released, then ___________. A. no grounds exist B. all phases are grounded C. all lamps show a ground D. all of the above

Description : If all of the ground detection lamps burn with equal brilliance, whether the test button is depressed or released, then ___________. A. no grounds exist B. all phases are grounded C. all lamps show a ground D. all of the above

Last Answer : Answer: A

Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

______ is a branch of computer science which deals with helping machines finds solutions to complex problems in a more human like fashions A. Artificial Intelligence B. Internet of Things C. Embedded System D. Cyber Security

Description : ______ is a branch of computer science which deals with helping machines finds solutions to complex problems in a more human like fashions A. Artificial Intelligence B. Internet of Things C. Embedded System D. Cyber Security

Last Answer : A. Artificial Intelligence 

Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex binary operation that cannot be solved using neural networks c) Because it can be solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Description : Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex ... solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Last Answer : d) Because it is the simplest linearly inseparable problem that exists.

Like relational databases there does exists fuzzy relational databases. a) True b) False

Description : Like relational databases there does exists fuzzy relational databases. a) True b) False

Last Answer : a) True

There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Last Answer : a) True

This set of Artificial Intelligence MCQs focuses on “Neural Networks – 2”. 1. Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex binary operation that cannot be solved using neural networks c) Because it can be solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Description : This set of Artificial Intelligence MCQs focuses on Neural Networks - 2 . 1. Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in ... by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Last Answer : d) Because it is the simplest linearly inseparable problem that exists.

Like relational databases there does exists fuzzy relational databases. a) True b) False

Description : Like relational databases there does exists fuzzy relational databases. a) True b) False

Last Answer : a) True

The expert system developed at MIT to solve mathematical problems is known as ___________ a) RAND b) ISIS c) MACSYMA d) MOLGEN

Description : The expert system developed at MIT to solve mathematical problems is known as ___________ a) RAND b) ISIS c) MACSYMA d) MOLGEN

Last Answer : c) MACSYMA

Which of the following solutions should the nurse anticipate for fluid replacement in the male patient? a) Lactated Ringer’s solution Replacement fluids may include isotonic electrolyte solutions and blood component therapy.

Description : Which of the following solutions should the nurse anticipate for fluid replacement in the male patient? a) Lactated Ringer's solution Replacement fluids may include isotonic electrolyte solutions and ... only to treat severe symptomatic hyponatremia and should be used only in intensive care units.

Last Answer : a) Lactated Ringer’s solution Replacement fluids may include isotonic electrolyte solutions and blood component therapy.

Transparency A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Description : Transparency A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Last Answer : C. Worth of the output of a machine learning program that makes it understandable for humans

Shallow knowledge A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Description : Shallow knowledge A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Last Answer : B. The information stored in a database that can be, retrieved with a single query

Search space A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query. C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Description : Search space A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query. C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Last Answer : A . The large set of candidate solutions possible for a problem

______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical

Description : ______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical 

Last Answer : A. Heuristic 

A ____ is a rule of thumb, strategy, trick, simplification, or any other kind of device which drastically limits search for solutions in large problem spaces. A. Heuristic B. Critical C. Value based D. Analytical

Description : A ____ is a rule of thumb, strategy, trick, simplification, or any other kind of device which drastically limits search for solutions in large problem spaces. A. Heuristic B. Critical C. Value based D. Analytical

Last Answer : A. Heuristic 

The longer a fault exists in a) the more tedious its removal becomes b) the more costly it is to detect and correct c) the less likely it is to be properly corrected d) All of the mentioned

Description : The longer a fault exists in a) the more tedious its removal becomes b) the more costly it is to detect and correct c) the less likely it is to be properly corrected d) All of the mentioned

Last Answer : d) All of the mentioned

The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)

Description : The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)

Last Answer : c) O(n!)

The area of AI that investigates methods of facilitating communication between people and computers is ___________ a) natural language processing b) symbolic processing c) decision support d) robotics

Description : The area of AI that investigates methods of facilitating communication between people and computers is ___________ a) natural language processing b) symbolic processing c) decision support d) robotics

Last Answer : a) natural language processing

In AI programming, a list may contain ___________ a) cells b) fields c) pointers d) all of the mentioned

Description : In AI programming, a list may contain ___________ a) cells b) fields c) pointers d) all of the mentioned

Last Answer : d) all of the mentioned

A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned

Description : A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned

Last Answer : d) all of the mentioned

In LISP, the atom that stands for “False” is ___________ a) t b) nil c) y d) time

Description : In LISP, the atom that stands for “False” is ___________ a) t b) nil c) y d) time

Last Answer : b) nil

Seymour Papert of the MIT AI lab created a programming environment for children called ___________ a) BASIC b) LOGO c) MYCIN d) FORTRAN

Description : Seymour Papert of the MIT AI lab created a programming environment for children called ___________ a) BASIC b) LOGO c) MYCIN d) FORTRAN

Last Answer : b) LOGO

Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned

Description : Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned

Last Answer : d) all of the mentioned

Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Description : Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned

Last Answer : d) All of the mentioned

In his landmark book Cybernetics, Norbert Wiener suggested a way of modeling scientific phenomena using not energy, but ___________ a) mathematics b) intelligence c) information d) history

Description : In his landmark book Cybernetics, Norbert Wiener suggested a way of modeling scientific phenomena using not energy, but ___________ a) mathematics b) intelligence c) information d) history

Last Answer : c) information

MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned

Description : MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned

Last Answer : b) human factors

In LISP, the function returns t if <integer> is even and nil otherwise ___________ a) (evenp <integer>) b) (even <integer>) c) (numeven <integer>) d) (numnevenp <integer>)

Description : In LISP, the function returns t if is even and nil otherwise ___________ a) (evenp ) b) (even ) c) (numeven ) d) (numnevenp )

Last Answer : a) (evenp )

Fuzzy logic is usually represented as ___________ a) IF-THEN-ELSE rules b) IF-THEN rules c) Both IF-THEN-ELSE rules & IF-THEN rules

Description : Fuzzy logic is usually represented as ___________ a) IF-THEN-ELSE rules b) IF-THEN rules c) Both IF-THEN-ELSE rules & IF-THEN rules

Last Answer : b) IF-THEN rules

The values of the set membership is represented by ___________ a) Discrete Set b) Degree of truth c) Probabilities d) Both Degree of truth & Probabilities

Description : The values of the set membership is represented by ___________ a) Discrete Set b) Degree of truth c) Probabilities d) Both Degree of truth & Probabilities

Last Answer : b) Degree of truth

A constructive approach in which no commitment is made unless it is necessary to do so is ___________ a) Least commitment approach b) Most commitment approach

Description : A constructive approach in which no commitment is made unless it is necessary to do so is ___________ a) Least commitment approach b) Most commitment approach

Last Answer : a) Least commitment approach

If a hypothesis says it should be positive, but in fact it is negative, we call it ___________ a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis

Description : If a hypothesis says it should be positive, but in fact it is negative, we call it ___________ a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis

Last Answer : c) A false positive hypothesis

A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Description : A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Last Answer : a) Both discrete and continuous variables

Uncertainty arises in the wumpus world because the agent’s sensors give only ___________ a) Full & Global information b) Partial & Global Information c) Partial & local Information d) Full & local information

Description : Uncertainty arises in the wumpus world because the agent’s sensors give only ___________ a) Full & Global information b) Partial & Global Information c) Partial & local Information d) Full & local information

Last Answer : c) Partial & local Information

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

Description : 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

Last Answer : c) Data-driven, goal-driven

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

Description : 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

Last Answer : d) All of the mentioned

The adjective “first-order” distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of predicate quantifiers or function quantifiers are permitted. a) Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency

Description : The adjective first-order distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of ... Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency

Last Answer : c) Higher Order Logic

First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Last Answer : d) All of the mentioned

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard

Description : Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard

Last Answer : b) NP complete

Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned

Last Answer : d) All of the mentioned