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

1 Answer

Answer :

b) NP complete

Related questions

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 : To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________ a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

Last Answer : a) Forward Searching

Description : Does solving "P=NP?" require filling every hole ever left in math?

Last Answer : answer:I think the answer is that solving it would then successively fill every hole in math. It seems that the answer is not P=NP. If I knew what it took to solve P=NP then I certainly wouldn’t tell!

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 : 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 : The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search

Last Answer : (B) Constraint satisfaction

Description : In constraint satisfaction problem, constraints can be stated as . (A) Arithmatic equations and inequalities that bind the values of variables (B) Arithmatic equations and inequalities ... impose restrictions over variables (D) Arithmatic equations that discard constraints over the given variables

Last Answer : (A) Arithmatic equations and inequalities that bind the values of variables

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

Last Answer : a) True

Description : 60. While solving a LP problem, infeasibility may be removed by a. Adding another constraint b. Adding another variable c. Removing a constraint d. Removing a variable

Last Answer : c. Removing a constraint

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

Description : Show the relationship of an entailment constraint.

Last Answer :  Hypothesis ^ Descriptions |= classifications 

Description : Define constraint propagation.

Last Answer : It is the general term for propagating (i.e.) spreading the implications of constraints on the variable on to other variable. 

Description : Given the following statements :  S1 : The subgraph-isomorphism problem takes two graphs G1 and G2 and asks whether G1 is a subgraph of G2.  S2 : The set-partition problem takes as input a set S of numbers and ... S1 is P problem and S2 is P problem. (D) S1 is P problem and S2 is NP problem.

Last Answer : (B) S1 is NP problem and S2 is NP problem.

Description : While solving an LPP, infeasibility may be removed by: a. Removing a variable b. Removing a constraint c. Adding a variable d. Adding a constraint

Last Answer : b. Removing a constraint

Description : What is a finite set of rules that specifies a language? a) Signs b) Communication c) Grammar d) Phrase

Last Answer : c) Grammar

Description : Vector A. It do not need the control of the human operator during their execution B. An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars C. The validation of a theory on the basis of a finite number of examples D. None of these

Last Answer : B. An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars

Description : 66. Which method is an iterative procedure for solving LPP in a finite number of steps? a. Simplex algorithm b. Slack variable c. Big M method d. Simplex method

Last Answer : d. Simplex method

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 : The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)

Last Answer : c) O(n!)

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

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

Description : The process by which the brain 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 : d) Both Planning problem & Partial order planning

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 : Can anyone explain what NP-hard means?

Last Answer : answer:From your link on Wiki for NP-hard : NP-hardness (non-deterministic polynomial-time hard), in computational complexity theory, is a class of problems that are, informally, at least as ... been proven. Moreover, the class NP also contains all problems which can be solved in polynomial time.

Description : For all you Computer Science types...Does P=NP?

Last Answer : Probably not. Million dollar prize.

Description : Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is _______. a. nP(1 – P)n – 1 b. nP c. P(1 – P)n – 1 d. n P (1 – P)n – 1

Last Answer : a. nP(1 – P)n – 1

Description : Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is .................. (1) nP(1-P)n-1 (2) nP (3) P(1-P)n-1 (4) nP(1-P)n-1

Last Answer :  nP(1-P)n-1

Description : What is an NP problem? Does this refer to a specific kind of logic problem?

Last Answer : I’m going to go out on a limb and guess that NP here stands for Neurolinguistic Programming… Although that is normally abbreviated to NLP… (have you pm’d the person who wrote NP in their answer?)

Description : In a rule-based system, procedural domain knowledge is in the form of __________ a) production rules b) rule interpreters c) meta-rules d) control rules

Last Answer : a) production rules

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 : A computer program that contains expertise in a particular domain is called? a) intelligent planner b) automatic processor c) expert system d) operational symbolizer

Last Answer : c) expert system

Description : Consider a good system for the representation of knowledge in a particular domain. What property should it possess? a) Representational Adequacy b) Inferential Adequacy c) Inferential Efficiency d) All of the mentioned

Last Answer : d) All of the mentioned

Description : An Artificial Intelligence system developed by Terry A. Winograd to permit an interactive dialogue about a domain he called blocks-world. a) SHRDLU b) SIMD c) BACON d) STUDENT

Last Answer : a) SHRDLU