What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned

What is the major component/components for measuring the performance of problem solving?

a) Completeness

b) Optimality

c) Time and Space complexity

d) All of the mentioned
by

1 Answer

Answer :

d) All of the mentioned
by

Related questions

The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the? a) Student model b) Problem solving expertise c) Tutoring module d) All of the mentioned

Description : The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the? a) Student model b) Problem solving expertise c) Tutoring module d) All of the mentioned

Last Answer : c) Tutoring module

Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

Description : Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

Last Answer : b) When all step costs are equal

Match the following. a) Completeness i) How long does it take to find a solution b) Time Complexity ii) How much memory need to perform the search. c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one. A) a-iii, b-ii, c-i B) a-i, b-ii, c-iii C) a-iii, b-i, c-ii D) a-i, b-iii, c-ii

Description : Match the following. a) Completeness i) How long does it take to find a solution b) Time Complexity ii) How much memory need to perform the search. c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in ... , b-ii, c-iii C) a-iii, b-i, c-ii D) a-i, b-iii, c-ii

Last Answer : C) a-iii, b-i, c-ii

Where does the Bayes rule can be used? a) Solving queries b) Increasing complexity c) Decreasing complexity d) Answering probabilistic query

Description : Where does the Bayes rule can be used? a) Solving queries b) Increasing complexity c) Decreasing complexity d) Answering probabilistic query

Last Answer : d) Answering probabilistic query

What is the main task of a problem-solving agent? a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) All of the mentioned d) None of the mentioned

Description : What is the main task of a problem-solving agent? a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) All of the mentioned d) None of the mentioned

Last Answer : c) All of the mentioned

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 will solve the conjuncts of the rule so that the total cost is minimized? a) Constraint variable b) Conjunct ordering c) Data complexity d) All of the mentioned

Description : Which will solve the conjuncts of the rule so that the total cost is minimized? a) Constraint variable b) Conjunct ordering c) Data complexity d) All of the mentioned

Last Answer : b) Conjunct ordering

The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Last Answer : a) O(bd+1) and O(bd+1)

Write the time & space complexity associated with depth limited search.

Description : Write the time & space complexity associated with depth limited search.

Last Answer : Time complexity =O (bd) ,  b-branching factor,  d-depth of tree Space complexity=o (bl)

What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)

Description : What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)

Last Answer : d) O(bm)

Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Last Answer : d) All of the mentioned

A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Last Answer : d) Hierarchical plan

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

Web Crawler is a/an ____________ a) Intelligent goal-based agent b) Problem-solving agent

Description : Web Crawler is a/an ____________ a) Intelligent goal-based agent b) Problem-solving agent

Last Answer : a) Intelligent goal-based agent

A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

Description : A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

Last Answer : d) Mars Hover (Robot Navigation)

The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. a) True b) False

Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False

Last Answer : a) True

What is the term used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical

Description : What is the term used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical

Last Answer : a) Heuristic

Which term is used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical

Description : Which term is used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical

Last Answer : a) Heuristic

The CAI (Computer-Assisted Instruction) technique based on programmed instruction is __________ a) frame-based CAI b) generative CAI c) problem-solving CAI d) intelligent CAI

Description : The CAI (Computer-Assisted Instruction) technique based on programmed instruction is __________ a) frame-based CAI b) generative CAI c) problem-solving CAI d) intelligent CAI

Last Answer : a) frame-based CAI

List the steps involved in simple problem solving technique.

Description : List the steps involved in simple problem solving technique.

Last Answer : i. Goal formulation ii. Problem formulation iii. Search iv. Solution v. Execution phase

Define problem solving agent.

Description : Define problem solving agent.

Last Answer : Problem solving agent is one kind of goal based agent, where the agent Should select one action from sequence of actions which lead to desirable states. 

What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical

Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical

Last Answer : A. Heuristic 

What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical E. None of the above

Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical E. None of the above

Last Answer : A. Heuristic 

The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Description : The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Last Answer : c) Successor function, which takes current action and returns next immediate state

A problem in a search space is defined by one of these state. a) Initial state b) Last state c) Intermediate state d) All of the mentioned

Description : A problem in a search space is defined by one of these state. a) Initial state b) Last state c) Intermediate state d) All of the mentioned

Last Answer : a) Initial state

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

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

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

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 makes the complexity of the entire algorithm quadratic in the size? a) Clause b) Inference c) Resolution d) Occur check

Description : Which makes the complexity of the entire algorithm quadratic in the size? a) Clause b) Inference c) Resolution d) Occur check

Last Answer : d) Occur check

How many possible sources of complexity are there in forward chaining? a) 1 b) 2 c) 3 d) 4

Description : How many possible sources of complexity are there in forward chaining? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

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

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

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

Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Description : Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Last Answer : c) Learning element

Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

Description : Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

Last Answer : b) Quality of heuristic function

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

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

Which is used to improve the agents performance? a) Perceiving b) Learning c) Observing d) None of the mentioned

Description : Which is used to improve the agents performance? a) Perceiving b) Learning c) Observing d) None of the mentioned

Last Answer : b) Learning

The performance of an agent can be improved by __________ a) Learning b) Observing c) Perceiving d) None of the mentioned

Description : The performance of an agent can be improved by __________ a) Learning b) Observing c) Perceiving d) None of the mentioned

Last Answer : a) Learning

Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Description : Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Last Answer : c) Learning element

Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Description : Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Last Answer : d) All of the mentioned

Which of the following, is a component of an expert system? a) inference engine b) knowledge base c) user interface d) all of the mentioned

Description : Which of the following, is a component of an expert system? a) inference engine b) knowledge base c) user interface d) all of the mentioned

Last Answer : d) all of the mentioned

Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Description : Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned

Last Answer : d) All of the mentioned

56. Constraints in LP problem are called active if they a. Represent optimal solutions b. At optimality do not consume all the available resources c. Both a & b d. None of the above

Description : 56. Constraints in LP problem are called active if they a. Represent optimal solutions b. At optimality do not consume all the available resources c. Both a & b d. None of the above

Last Answer : a. Represent optimal solutions

Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? (A) Alternate optimality (B) Infeasibility (C) Unboundedness (D) All of the above

Description : Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? (A) Alternate optimality (B) Infeasibility (C) Unboundedness (D) All of the above

Last Answer : (A) Alternate optimality 

Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Last Answer : b) Hidden markov model

What are the components of a problem?

Description : What are the components of a problem?

Last Answer : There are four components. They are i. initial state ii. Successor function iii. Goal test iv. Path cost v. Operator vi. state space vii. path

Which suggests the existence of an efficient recursive algorithm for online smoothing? a) Matrix b) Constant space c) Constant time d) None of the mentioned

Description : Which suggests the existence of an efficient recursive algorithm for online smoothing? a) Matrix b) Constant space c) Constant time d) None of the mentioned

Last Answer : b) Constant space

In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Last Answer : c) Small search space

What will happen if the hypothesis space contains the true function? a) Realizable b) Unrealizable c) Both Realizable & Unrealizable d) None of the mentioned

Description : What will happen if the hypothesis space contains the true function? a) Realizable b) Unrealizable c) Both Realizable & Unrealizable d) None of the mentioned

Last Answer : b) Unrealizable