One the main drawback of this type of planning system is that it requires a lot of computational powers at each node. a) True b) False

One the main drawback of this type of planning system is that it requires a lot of computational

powers at each node.

a) True

b) False
by

1 Answer

Answer :

a) True
by

Related questions

The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False

Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False

Last Answer : a) True

Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node. a) True b) False

Description : Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node. a) True b) False

Last Answer : a) True

What are the advantages of neural networks over conventional computers? (i) They have the ability to learn by example (ii) They are more fault tolerant (iii)They are more suited for real time operation due to their high ‘computational’ rates a) (i) and (ii) are true b) (i) and (iii) are true c) Only (i) d) All of the mentioned

Description : What are the advantages of neural networks over conventional computers? (i) They have the ability to learn by example (ii) They are more fault tolerant (iii)They are more suited for real time operation due to their high ... true b) (i) and (iii) are true c) Only (i) d) All of the mentioned

Last Answer : d) All of the mentioned

Which of the following is true? (i) On average, neural networks have higher computational rates than conventional computers. (ii) Neural networks learn by example. (iii) Neural networks mimic the way the human brain works. a) All of the mentioned are true b) (ii) and (iii) are true c) (i), (ii) and (iii) are true d) None of the mentioned

Description : Which of the following is true? (i) On average, neural networks have higher computational rates than conventional computers. (ii) Neural networks learn by example. (iii) Neural networks mimic the way the human brain works. ... ) are true c) (i), (ii) and (iii) are true d) None of the mentioned

Last Answer : a) All of the mentioned are true

What are the advantages of neural networks over conventional computers? (i) They have the ability to learn by example (ii) They are more fault tolerant (iii)They are more suited for real time operation due to their high ‘computational’ rates a) (i) and (ii) are true b) (i) and (iii) are true c) Only (i) d) All of the mentioned

Description : What are the advantages of neural networks over conventional computers? (i) They have the ability to learn by example (ii) They are more fault tolerant (iii)They are more suited for real time operation due to their high ... true b) (i) and (iii) are true c) Only (i) d) All of the mentioned

Last Answer : d) All of the mentioned

Which of the following is true? (i) On average, neural networks have higher computational rates than conventional computers. (ii) Neural networks learn by example. (iii) Neural networks mimic the way the human brain works. a) All of the mentioned are true b) (ii) and (iii) are true c) (i), (ii) and (iii) are true d) None of the mentioned

Description : Which of the following is true? (i) On average, neural networks have higher computational rates than conventional computers. (ii) Neural networks learn by example. (iii) Neural networks mimic the way the human brain works ... ) are true c) (i), (ii) and (iii) are true d) None of the mentioned

Last Answer : a) All of the mentioned are true

The name “best-first search” is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function. a) True b) False

Description : The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the ... is choose the node that appears to be best according to the evaluation function. a) True b) False

Last Answer : a) True

Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

Description : Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

Last Answer : b) False

Computational learning theory analyzes the sample complexity and computational complexity of __________ a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning

Description : Computational learning theory analyzes the sample complexity and computational complexity of __________ a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning

Last Answer : b) Inductive learning

Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned

Description : Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned

Last Answer : b) Reflective

Artificial intelligence is A . It uses machine-learning techniques. Here program can learn From past experience and adapt themselves to new situations B. Computational procedure that takes some value as input and produces some value as output. C. Science of making machines performs tasks that would require intelligence when performed by humans D . None of these

Description : Artificial intelligence is A . It uses machine-learning techniques. Here program can learn From past experience and adapt themselves to new situations B. Computational procedure that takes some ... performs tasks that would require intelligence when performed by humans D . None of these

Last Answer : C. Science of making machines performs tasks that would require intelligence when performed by humans

Computational learning theory analyzes the sample complexity and computational complexity of a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning e) Knowledge based learning

Description : Computational learning theory analyzes the sample complexity and computational complexity of a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning e) Knowledge based learning

Last Answer : b) Inductive learning

Chomsky’s linguistic computational theory generated a model for syntactic analysis through __________ A. Regular Grammar B. Regular Expression C. Regular Word D. None of these

Description : Chomsky’s linguistic computational theory generated a model for syntactic analysis through __________ A. Regular Grammar B. Regular Expression C. Regular Word D. None of these

Last Answer : A. Regular Grammar

_____ model were developed and incorporated in machines which mimicked the functionalities of human origin. A. Functional model B. Neural model C. Computational model D. None of above

Description : _____ model were developed and incorporated in machines which mimicked the functionalities of human origin. A. Functional model B. Neural model C. Computational model D. None of above

Last Answer : C. Computational model 

_____ Model should reflect how results were obtained. A. Design model B. Logic model C. Computational model D. None of above

Description : _____ Model should reflect how results were obtained. A. Design model B. Logic model C. Computational model D. None of above

Last Answer : C. Computational model 

Give the drawback of DFS.

Description : Give the drawback of DFS. 

Last Answer : The drawback of DFS is that it can get stuck going down the wrong path. Many problems have very deep or even infinite search tree. So dfs will never be able to recover from an unlucky choice at ... the top of the tree. So DFS should be avoided for search trees with large or infinite maximum depths 

Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Description : Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Last Answer : d) All of the mentioned

Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Description : Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Last Answer : d) All of the mentioned

Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole. a) True b) False

Description : Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole. a) True b) False

Last Answer : a) True

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

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

Last Answer : a) True

Planning problem can be described as a propositional logic. a) True b) False

Description : Planning problem can be described as a propositional logic. a) True b) False

Last Answer : a) True

Planning graphs works only for prepositional planning problems. a) True b) False

Description : Planning graphs works only for prepositional planning problems. a) True b) False

Last Answer : a) True

Sussman Anomaly illustrates a weakness of interleaved planning algorithm. a) True b) False

Description : Sussman Anomaly illustrates a weakness of interleaved planning algorithm. a) True b) False

Last Answer : b) False

Sussman Anomaly can be easily and efficiently solved by partial order planning. a) True b) False

Description : Sussman Anomaly can be easily and efficiently solved by partial order planning. a) True b) False

Last Answer : a) True

Partial-order planning is the opposite of total-order planning. a) True b) False

Description : Partial-order planning is the opposite of total-order planning. a) True b) False

Last Answer : a) True

What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label d) None of the mentioned

Description : What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) ... branch represents outcome of test and each leaf node represents class label d) None of the mentioned

Last Answer : c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label

Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function returning highest evaluation c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Description : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable

Last Answer : a) Evaluation function returning lowest evaluation

What is one drawback of increasing automation? a. The product requires increased time/expense for subsequent short-move repositioning. b. Operating second shift becomes more expensive. c. Automation causes large leaps in repositioning. d. Automation slows production capability. e. It requires more employees for the production line.

Description : What is one drawback of increasing automation? a. The product requires increased time/expense for subsequent short-move repositioning. b. Operating second shift becomes more expensive. c. ... d. Automation slows production capability. e. It requires more employees for the production line.

Last Answer : a. The product requires increased time/expense for subsequent short-move repositioning.

Natural Language generation is the main task of Natural language processing. a) True b) False

Description : Natural Language generation is the main task of Natural language processing. a) True b) False

Last Answer : a) True

What is the consequence between a node and its predecessors while creating bayesian network? a) Functionally dependent b) Dependant c) Conditionally independent d) Both Conditionally dependant & Dependant

Description : What is the consequence between a node and its predecessors while creating bayesian network? a) Functionally dependent b) Dependant c) Conditionally independent d) Both Conditionally dependant & Dependant

Last Answer : c) Conditionally independent

What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Description : What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Last Answer : c) Path cost from start node to current node + Heuristic cost

What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

Last Answer : a) Heuristic function

Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Description : Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Last Answer : c) The one closest to the goal node

Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost

Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost

Last Answer : c) Estimated cost of cheapest path from root to goal node

A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned

Description : A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned

Last Answer : d) All of the mentioned

Which search method will expand the node that is closest to the goal? a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned

Description : Which search method will expand the node that is closest to the goal? a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned

Last Answer : b) Greedy best-first search

Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Description : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Best-first search

Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest

Description : Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest

Last Answer : a) Shallowest

Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost

Description : Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost

Last Answer : c) Deepest

uniform-cost search expands the node n with the __________ a) Lowest path cost b) Heuristic cost c) Highest path cost d) Average path cost

Description : uniform-cost search expands the node n with the __________ a) Lowest path cost b) Heuristic cost c) Highest path cost d) Average path cost

Last Answer : a) Lowest path cost

A heuristic is a way of trying __________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than the other is d) All of the mentioned

Description : A heuristic is a way of trying __________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than the other is d) All of the mentioned

Last Answer : d) All of the mentioned

What is the consequence between a node and its predecessors while creating Bayesian network? a) Conditionally dependent b) Dependent c) Conditionally independent d) Both a & b

Description : What is the consequence between a node and its predecessors while creating Bayesian network? a) Conditionally dependent b) Dependent c) Conditionally independent d) Both a & b

Last Answer : c) Conditionally independent

Define search node.

Description : Define search node.

Last Answer : The root of the search tree that is the initial state of the problem is called search node. 

Which of the following technique overcomes drawback related to LOC? A. Project Planning Sheet B. Function Point Metric C. COCOMO D. COCOMO2

Description : Which of the following technique overcomes drawback related to LOC? A. Project Planning Sheet B. Function Point Metric C. COCOMO D. COCOMO2

Last Answer : B. Function Point Metric

The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds. a) True b) False

Description : The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The ... are backed up through the tree as the recursion unwinds. a) True b) False

Last Answer : a) True

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

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

Which of the following is true in Statistical reasoning? a) The representation is extended to allow some kind of numeric measure of certainty to be associated with each statement b) The representation is extended to allow ‘TRUE or FALSE’ to be associated with each statement c) The representation is extended to allow some kind of numeric measure of certainty to be associated common to all statements

Description : Which of the following is true in Statistical reasoning? a) The representation is extended to allow some kind of numeric measure of certainty to be associated with each statement b) The ... extended to allow some kind of numeric measure of certainty to be associated common to all statements

Last Answer : a) The representation is extended to allow some kind of numeric measure of certainty to be associated with each statement

Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. a) True – this works always, and these multiple perceptrons learn to classify even complex problems. b) False – perceptrons are mathematically incapable of solving linearly inseparable functions, no matter what you do c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded d) False – just having a single perceptron is enough

Description : Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. ... have to be explicitly hand-coded d) False - just having a single perceptron is enough

Last Answer : c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded

Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B) Object-oriented databases store computational instructions in the same place as the data. (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases. (D) Object-oriented databases store more types of data than relational databases and access that data faster.

Description : Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B ... Object-oriented databases store more types of data than relational databases and access that data faster.

Last Answer : (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases.

What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Description : What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Last Answer : b) Linearization