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)

1 Answer

Answer :

d) Mars Hover (Robot Navigation)

Related questions

Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Last Answer : b) Travelling Salesman problem

Description : A problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible. Heuristic A. Algebraic B. Hyroglyphics C. Hypertext

Last Answer : C. Hypertext

Description : Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) All of the mentioned

Last Answer : d) All of the mentioned

Description : Which is the best way to go for Game playing problem? a) Linear approach b) Heuristic approach (Some knowledge is stored) c) Random approach d) An Optimal approach

Last Answer : b) Heuristic approach (Some knowledge is stored)

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

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

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

Description : A basic line following robot is based on __________ a) Strong Artificial Intelligence approach b) Weak Artificial Intelligence approach c) Cognitive Artificial Intelligence approach d) Applied Artificial Intelligence approach

Last Answer : b) Weak Artificial Intelligence approach

Description : Programming a robot by physically moving it through the trajectory you want it to follow is called _____________ a) contact sensing control b) continuous-path control c) robot vision control d) pick-and-place control

Last Answer : b) continuous-path control

Description : Programming a robot by physically moving it through the trajectory you want it to follow be called __________ a) contact sensing control b) continuous-path control c) robot vision control d) pick-and-place control

Last Answer : b) continuous-path control

Description : In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of: (A) rows or columns (B) rows+columns (C) rows+columns-1 (D) rows+columns+1

Last Answer : (A) rows or columns

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

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

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

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

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

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

Last Answer : d) All of the mentioned

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

Last Answer : a) Intelligent goal-based agent

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

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

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

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

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

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. 

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 

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 

Description : The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Last Answer : b) Partial order planning

Description : Artificial landmarks positioned exclusively for the functions of A : Robot localization B : Global localization C : Path finding D : Approximation location

Last Answer : A : Robot localization

Description : Which is the best way to go for Game playing problem? (A) Linear approach (B) Heuristic approach (C) Random approach (D) Optimal approach

Last Answer : (B) Heuristic approach

Description : Which of the following “laws” is Asimov’s first and most important law of robotics? a) robot actions must never result in damage to the robot b) robots must never take actions harmful to humans c) robots must follow the directions given by humans d) robots must make business a greater profit

Last Answer : b) robots must never take actions harmful to humans

Description : Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context? a) continuous speech recognition b) connected word recognition c) isolated word recognition d) speaker-dependent recognition

Last Answer : c) isolated word recognition

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

Description : Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

Last Answer : c) Greedy local search

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

Description : A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

Last Answer : a) True

Description : Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search

Last Answer : d) A* search

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

Description : When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal

Last Answer : b) When all step costs are equal

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search

Last Answer : a) Depth-First Search

Description : What is meant by simulated annealing in artificial intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling ... not return an optimal solution when there is a proper cooling schedule d) None of the mentioned

Last Answer : a) Returns an optimal solution when there is a proper cooling schedule

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Optimal search d) Linear Search

Last Answer : a) Depth-First Search

Description : A perceptron is a ——————————–. a) Feed-forward neural network b) Back-propagation algorithm c) Back-tracking algorithm d) Feed Forward-backward algorithm e) Optimal algorithm with Dynamic programming

Last Answer : a) Feed-forward neural network

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

Last Answer : A. Heuristic 

Description : What's your weirdest approach to problem solving?

Last Answer : Put in an earbud and figure it out as you go

Description : 7. Who defined Operations Research as scientific approach to problem solving for executive management? a. E.L. Arnoff b. P.M.S. Blackett c. H.M. Wagner d. None of the above

Last Answer : c. H.M. Wagner

Description : An intuitive manager could best be described as one who: A)uses scientific problem solving B)eliminates uncertainty in decision making C)searches out facts and data systematically D)uses an orderly approach to gathering information E)uses personal knowledge and experience to make decisions

Last Answer : E)uses personal knowledge and experience to make decisions

Description : Who defined Operations Research as scientific approach to problem solving for executive management. a. E L Arnoff b. H M Wagner c. Churchman d. None of these

Last Answer : b. H M Wagner

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 : Ability to think, puzzle, make judgments, plan, learn, communication by its own is known as ___ AI. A. Narrow AI B. General AI C. Super AI D. None of above

Last Answer : C. Super AI 

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