Standard planning algorithms assumes environment to be ___________

a) Deterministic

b) Fully observable

c) Single agent

d) Stochastic

1 Answer

Answer :

a) Deterministic

Related questions

Description : What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Rational d) Primary

Last Answer : a) Local

Description : What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic

Last Answer : a) Deterministic

Description : Satellite Image Analysis System is (Choose the one that is not applicable). a) Episodic b) Semi-Static c) Single agent d) Partially Observable

Last Answer : d) Partially Observable

Description : Categorize Crossword puzzle in Fully Observable / Partially Observable. a) Fully Observable b) partially Observable c) All of the mentioned d) None of the mentioned

Last Answer : a) Fully Observable

Description : A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False

Last Answer : a) True

Description : Probabilistic models are also called ........................... a. Deterministic models b. Dynamic models c. Stochastic models d. None of these

Last Answer : c. Stochastic models

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

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

Last Answer : b) Partially Observable

Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Last Answer : c) Graph-Plan

Description : Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal

Last Answer : a) Most-constrained variable

Description : __________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Last Answer : b) Local Beam search

Description : Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

Last Answer : a) True

Description : Searching using query on Internet is, use of ___________ type of agent. a) Offline agent b) Online agent c) Both Offline & Online agent d) Goal Based & Online agent

Last Answer : d) Goal Based & Online agent

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

Last Answer : a) Detect when a solution has been found

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

Description : A re-planning agent uses execution monitoring and splices in repairs as needed. a) True b) False

Last Answer : a) True

Description : ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules. a) GraphPlan b) Hierarchical task network (HTN) c) SatPlan d) None of the mentioned

Last Answer : b) Hierarchical task network (HTN)

Description : Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False

Last Answer : a) True

Description : ____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms

Last Answer : d) MIN/MAX Algorithms

Description : Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space

Last Answer : d) Less memory & Finds a solution in large infinite space

Description : Distinguish between A* and AO* algorithms?

Last Answer : Ans:- A* algorithm:-  A* uses a best-first search and finds the least-cost path from a given initial node to one goal node (out of one or more possible goals).  It uses a distance-plus- ... node as SOLVED.  If starting node is SOLVED or value greater than FUTILITY, stop, else repeat from 2.

Description : Which of the following(s) is/are found in Genetic Algorithms? (i) evolution (ii) selection (iii) reproduction (iv) mutation (a) i & ii only (b) i, ii & iii only (c) ii, iii & iv only

Last Answer : (a) i & ii only

Description : Core of soft Computing is A. Fuzzy Computing, Neural Computing, Genetic Algorithms B. Fuzzy Networks and Artificial Intelligence C. Artificial Intelligence and Neural Science D. Neural Science and Genetic Science

Last Answer : D. Neural Science and Genetic Science

Description : n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Last Answer : A. A measure of the desired maximal complexity of data mining algorithms

Description : Evolutionary computation is A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. C. ... the knowledge of an expert formulated in terms of if-then rules. D . None of these

Last Answer : B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution.

Description : Expert systems A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution C. an information base ... the knowledge of an expert formulated in terms of if-then rules D . None of these

Last Answer : C. an information base filled with the knowledge of an expert formulated in terms of if-then rules

Description : ______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned

Last Answer : c) Fuzzy Set

Description : What are the algorithms to have efficient parsing?

Last Answer : i. Left to right parsing algorithm  ii. Chart Parsing algorithm.  iii. Left corner parsing

Description : What is Genetic Algorithms?

Last Answer : Genetic Algorithm is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.

Description : What are the 2 types of memory bounded heuristic algorithms?

Last Answer : i. Recursive Best First Search(RBFS)  ii. Memory bounded A*(MA*)

Description : Deep learning is a subfield of machine learning where concerned algorithms are inspired by the structured and function of the brain called _____. A. Machine learning B. Artificial neural networks C. Deep learning D. Robotics

Last Answer : B. Artificial neural networks 

Description : Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is “significant,” regardless of whether the agents are cooperative or competitive. a) True b) False

Last Answer : a) True

Description : Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor

Last Answer : b) Task environment

Description : Which environment is called as semi dynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Environment does not change with the passage of time, but Agent performance changes

Last Answer : d) Environment does not change with the passage of time, but Agent performance changes

Description : Which is used to select the particular environment to run the agent? a) Environment creator b) Environment Generator c) Both Environment creator & Generator d) None of the mentioned

Last Answer : b) Environment Generator

Description : What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent d) Observation

Last Answer : a) Problem

Description : The Task Environment of an agent consists of ____________ a) Sensors b) Actuators c) Performance Measures d) All of the mentioned

Last Answer : d) All of the mentioned

Description : What is rational at any given time depends on? a) The performance measure that defines the criterion of success b) The agent’s prior knowledge of the environment c) The actions that the agent can perform d) All of the mentioned

Last Answer : d) All of the mentioned

Description : Agents behavior can be best described by ____________ a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing

Last Answer : b) Agent function

Description : Give the structure of agent in an environment? 

Last Answer : Agent interacts with environment through sensors and actuators. An Agent is anything that can be viewed as perceiving (i.e.) understanding its environment through sensors and acting upon that environment through actuators.  

Description : Terzaghi's analysis assumes: (A) Soil is homogeneous and isotropic (B) Elastic zone has straight boundaries inclined at = to the horizontal and plastic zones fully developed (C) Failure zones do not extend above the horizontal plane through the base of the footing (D) All the above

Last Answer : Answer: Option D

Description : General games involves ____________ a) Single-agent b) Multi-agent c) Neither Single-agent nor Multi-agent d) Only Single-agent and Multi-agent

Last Answer : d) Only Single-agent and Multi-agent

Description : The game of Poker is a single agent. a) True b) False

Last Answer : b) False

Description : Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Last Answer : b) Fully connected

Description : How the compactness of the bayesian network can be described? a) Locally structured b) Fully structured c) Partial structure d) All of the mentioned

Last Answer : a) Locally structured

Description : What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both Partial & Fully

Last Answer : d) Both Partial & Fully

Description : Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Last Answer : b) Fully connected

Description : Which of the following is not true? A : For robotics, you should have a knowledge of different sensors B : For robotics, you must be able to write different planning algorithms C : For robotics, you may have to use actuators D : For robotics, you do not require help of computer engineers, mechanical

Last Answer : D : For robotics, you do not require help of computer engineers, mechanical