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

1 Answer

Answer :

d) All of the mentioned

Related questions

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)

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 : Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Last Answer : b) Depth-first search algorithm

Description : What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned

Last Answer : d) All of the mentioned

Description : Constraint Propagation technique actually modifies the CSP problem. a) True b) False

Last Answer : a) True

Description : Consider a problem of preparing a schedule for a class of student. What type of problem is this? a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

Last Answer : c) CSP

Description : Define CSP.

Last Answer : Constraint Satisfaction problem (CSP) is defined by a set of variables X1,X2,…Xn and set of constraints C1,C2,…Cm. 

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

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 : _______________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) All of the mentioned

Last Answer : a) Constraints Satisfaction Problems

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

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 : What is used in determining the nature of the learning problem? a) Environment b) Feedback c) Problem d) All of the mentioned

Last Answer : b) Feedback

Description : What does the bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Last Answer : a) Complete description of the domain

Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Last Answer : b) SatPlan

Description : The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned

Last Answer : a) Planning problem

Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Last Answer : a) Propositional planning problem

Description : Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Last Answer : c) Problem decomposition

Description : Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Last Answer : b) Backward chaining

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

Description : ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the mentioned

Last Answer : b) Dynamic CSPs

Description : Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Last Answer : b) Tree algorithm

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

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

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 : Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

Last Answer : c) Design problem

Description : What is called an exploration problem? a) State and actions are unknown to the agent b) State and actions are known to the agent c) Only actions are known to agent d) None of the mentioned

Last Answer : a) State and actions are unknown to the agent

Description : In which agent does the problem generator is present? a) Learning agent b) Observing agent c) Reflex agent d) None of the mentioned

Last Answer : a) Learning agent

Description : What is used in determining the nature of the learning problem? a) Environment b) Feedback c) Problem d) All of the mentioned

Last Answer : b) Feedback

Description : What does the Bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Last Answer : a) Complete description of the domain

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 : Why are linearly separable problems of interest of neural network researchers? a) Because they are the only class of problem that network can solve successfully b) Because they are the only ... mathematical functions that are continue d) Because they are the only mathematical functions you can draw

Last Answer : b) Because they are the only class of problem that Perceptron can solve successfully

Description : If air is at pressure, p, of 3200 lbf/ft2 , and at a temperature, T, of 800 ˚R, what is the specific volume, v? (R=5303 ft-lbf/lbm-˚R, and air can be modeled as an ideal gas.)  A.9.8 ft^3/lbm  B.11.2 ft^3/lbm  C.13.33 ft^3/lbm  D.14.2 ft^3/lbm Formula: pv = RT v = RT / p

Last Answer : 13.33 ft^3/lbm

Description : Define MAP.

Last Answer : Maximum A Posteriori. A very common approximation is to make predictions based on single most probable hypotheses. This is MAP. 

Description : Is the brain in th CSP system?

Last Answer : What is the answer ?

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

Description : When a top-level function is entered, the LISP processor does? a) It reads the function entered b) It prints the result returned by the function c) Large memory and high-speed processor d) All of the mentioned

Last Answer : b) It prints the result returned by the function

Description : How can you evaluate 1.25 + sqrt (144) in LISP? a) 1.25+sqrt (1.44) b) (1.25+sqrt (1.44)) c) (+1.25 sqrt (1.44) d) All of the mentioned

Last Answer : c) (+1.25 sqrt (1.44)

Description : Which of the following contains output segments of AI programming? a) Printed language and synthesized b) Manipulation of physical object c) Locomotion d) All of the mentioned

Last Answer : d) All of the mentioned

Description : Which technique is being investigated as an approach to automatic programming? a) generative CAI b) specification by example c) non-hierarchical planning d) all of the mentioned

Last Answer : b) specification by example

Description : In which of the following areas may ICAI programs prove to be useful? a) educational institutions b) corporations c) department of Defense d) all of the mentioned

Last Answer : d) all of the mentioned

Description : For speech understanding systems to gain widespread acceptance in office automation, they must feature ____________ a) speaker independence b) speaker dependence c) isolated word recognition d) all of the mentioned

Last Answer : a) speaker independence

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

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

Description : In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned

Last Answer : a) (setq a 10)

Description : What is Weak AI? a) the embodiment of human intellectual capabilities within a computer b) a set of computer programs that produce output that would be considered to reflect intelligence if it ... the study of mental faculties using mental models implemented on a computer d) all of the mentioned

Last Answer : c) the study of mental faculties using mental models implemented on a computer

Description : Which of the following is a project of the Strategic Computing Program? a) Defense Advanced Research Projects Agency b) National Science Foundation c) Jet Propulsion Laboratory d) All of the mentioned

Last Answer : a) Defense Advanced Research Projects Agency