What is Released problems?

What is Released problems?
by

1 Answer

Answer :

 A problem with fewer restrictions on the actions is called a relaxed problem. 
by

Related questions

The expert system developed at MIT to solve mathematical problems is known as ___________ a) RAND b) ISIS c) MACSYMA d) MOLGEN

Description : The expert system developed at MIT to solve mathematical problems is known as ___________ a) RAND b) ISIS c) MACSYMA d) MOLGEN

Last Answer : c) MACSYMA

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

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

An AI system developed by Daniel Bobrow to read and solve algebra word problems. a) SHRDLU b) SIMD c) BACON d) STUDENT

Description : An AI system developed by Daniel Bobrow to read and solve algebra word problems. a) SHRDLU b) SIMD c) BACON d) STUDENT

Last Answer : d) STUDENT

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

Adversarial search problems uses ____________ a) Competitive Environment b) Cooperative Environment c) Neither Competitive nor Cooperative Environment d) Only Competitive and Cooperative Environment

Description : Adversarial search problems uses ____________ a) Competitive Environment b) Cooperative Environment c) Neither Competitive nor Cooperative Environment d) Only Competitive and Cooperative Environment

Last Answer : a) Competitive Environment

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

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

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

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

_______________ 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

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

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)

People overcome natural language problems by _____________ a) grouping attributes into frames b) understanding ideas in context c) identifying with familiar situations d) both understanding ideas in context & identifying with familiar situations

Description : People overcome natural language problems by _____________ a) grouping attributes into frames b) understanding ideas in context c) identifying with familiar situations d) both understanding ideas in context & identifying with familiar situations

Last Answer : d) both understanding ideas in context & identifying with familiar situations

Membership function can be thought of as a technique to solve empirical problems on the basis of A. knowledge B. examples C. learning D. experience

Description : Membership function can be thought of as a technique to solve empirical problems on the basis of A. knowledge B. examples C. learning D. experience

Last Answer : D. experience

ANN is composed of large number of highly interconnected processing elements(neurons) working in unison to solve problems. A. True B. False C. D.

Description : ANN is composed of large number of highly interconnected processing elements(neurons) working in unison to solve problems. A. True B. False C. D.

Last Answer : A. True

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

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

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

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 class of problem that Perceptron can solve successfully c) Because they are the only mathematical functions that are continue d) Because they are the only mathematical functions you can draw

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

What are the two sub problems in discourse understanding?

Description : What are the two sub problems in discourse understanding?

Last Answer : i. Reference Resolution  ii. The structure of coherent discourse.

What are the things that agent knows in online search problems?

Description : What are the things that agent knows in online search problems?

Last Answer : a. Actions(s) b. Step cost function C(s, a, s’) c. Goal TEST(s)

Define Optimization Problems.

Description : Define Optimization Problems.

Last Answer :  The aim of this problem is to find the best state according to an objective function. 

Give example for real world end toy problems.

Description : Give example for real world end toy problems.

Last Answer : Real world problem examples: i. Airline travel problem. ii. Touring problem. iii. Traveling salesman problem. iv. VLSI Layout problem v. Robot navigation vi. Automatic Assembly vii. Internet searching  Toy problem Examples:  Vacuum world problem.  8 – Queen problem  8 – Puzzle problem

Give example problems for Artificial Intelligence.

Description : Give example problems for Artificial Intelligence. 

Last Answer : i. Toy problems ii. Real world problems

PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic

Last Answer : C. Predicate calculus 

In ____ the goal is for the software to use what it has learned in one area to solve problems in other areas. A. Machine Learning B. Deep Learning C. Neural Networks D. None of these

Description : In ____ the goal is for the software to use what it has learned in one area to solve problems in other areas. A. Machine Learning B. Deep Learning C. Neural Networks D. None of these

Last Answer : B. Deep Learning 

______ is a branch of computer science which deals with helping machines finds solutions to complex problems in a more human like fashions A. Artificial Intelligence B. Internet of Things C. Embedded System D. Cyber Security

Description : ______ is a branch of computer science which deals with helping machines finds solutions to complex problems in a more human like fashions A. Artificial Intelligence B. Internet of Things C. Embedded System D. Cyber Security

Last Answer : A. Artificial Intelligence 

The hardware feature of LISP machines generally includes _____________ a) Large memory and high-speed processorb) Letter quality printers and eight-inch disk drives c) A mouse and specialized keyboard d) A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

Description : The hardware feature of LISP machines generally includes _____________ a) Large memory and high-speed processorb) Letter quality printers and eight-inch disk drives c) A mouse and specialized keyboard d) A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

Last Answer : d) A mouse and specialized keyboard, Letter quality printers and eight-inch disk drives

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

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

Which kind of planning consists of successive representations of different levels of a plan? a) Hierarchical planning b) Non-hierarchical planning c) Project planning

Description : Which kind of planning consists of successive representations of different levels of a plan? a) Hierarchical planning b) Non-hierarchical planning c) Project planning

Last Answer : a) Hierarchical planning

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

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

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

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)

In LISP, the square root of X is referenced as _____________ a) sqrt(x) b) (sqrt x) c) x/2 d) x/3

Description : In LISP, the square root of X is referenced as _____________ a) sqrt(x) b) (sqrt x) c) x/2 d) x/3

Last Answer : b) (sqrt x)

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

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

The cray X-MP, IBM 3090 and connection machine can be characterized as ____________ a) SISD b) SIMD c) MISD d) MIMD

Description : The cray X-MP, IBM 3090 and connection machine can be characterized as ____________ a) SISD b) SIMD c) MISD d) MIMD

Last Answer : b) SIMD

The Newell and Simon program that proved theorems of Principal Mathematical was ____________ a) Elementary Perceiver b) General Problem Solver c) Logic Theorist d) Boolean Algebra

Description : The Newell and Simon program that proved theorems of Principal Mathematical was ____________ a) Elementary Perceiver b) General Problem Solver c) Logic Theorist d) Boolean Algebra

Last Answer : c) Logic Theorist

The primary method that people use to sense their environment is ____________ a) reading b) writing c) speaking d) seeing

Description : The primary method that people use to sense their environment is ____________ a) reading b) writing c) speaking d) seeing

Last Answer : d) seeing

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

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

The company that grew out of research at the MIT AI lab is ____________ a) AI corp b) LMI c) Symbolics d) Both LMI & Symbolics

Description : The company that grew out of research at the MIT AI lab is ____________ a) AI corp b) LMI c) Symbolics d) Both LMI & Symbolics

Last Answer : d) Both LMI & Symbolics

Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail somewhere between 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic

Description : Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail ... 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic

Last Answer : b) Fuzzy logic

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

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

Visual clues that are helpful in computer vision include __________ a) color and motion b) depth and texture c) height and weight d) color and motion, depth and texture

Description : Visual clues that are helpful in computer vision include __________ a) color and motion b) depth and texture c) height and weight d) color and motion, depth and texture

Last Answer : d) color and motion, depth and texture

The explanation facility of an expert system may be used to ____________ a) construct a diagnostic model b) expedite the debugging process c) explain the system’s reasoning process d) explain the system’s reasoning process & expedite the debugging process

Description : The explanation facility of an expert system may be used to ____________ a) construct a diagnostic model b) expedite the debugging process c) explain the system’s reasoning process d) explain the system’s reasoning process & expedite the debugging process

Last Answer : d) explain the system’s reasoning process & expedite the debugging process

In 1985, the famous chess player David Levy beat a world champion chess program in four straight games by using orthodox moves that confused the program. What was the name of the chess program? a) Kaissa b) CRAY BLITZ c) Golf d) DIGDUG

Description : In 1985, the famous chess player David Levy beat a world champion chess program in four straight games by using orthodox moves that confused the program. What was the name of the chess program? a) Kaissa b) CRAY BLITZ c) Golf d) DIGDUG

Last Answer : b) CRAY BLITZ

Idempotency law is I. P Ú P = P. II. P Ù P = P. III. P + P = P. a) Only (I) b) Only (II) c) Only (III) d) Both (I) and (II)

Description : Idempotency law is I. P Ú P = P. II. P Ù P = P. III. P + P = P. a) Only (I) b) Only (II) c) Only (III) d) Both (I) and (II)

Last Answer : a) Only (I)

Knowledge may be I. Declarative. II. Procedural. III. Non-procedural. a) Only (I) b) Only (II) c) Only (III) d) Both (I) and (II)

Description : Knowledge may be I. Declarative. II. Procedural. III. Non-procedural. a) Only (I) b) Only (II) c) Only (III) d) Both (I) and (II)

Last Answer : d) Both (I) and (II)

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

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

What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state

Description : What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state

Last Answer : a) An initial state and one or more goal states

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)

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!)

Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Last Answer : b) The entire tree so far been generated must be stored in BFS

An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Description : An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Last Answer : a) It terminates with a solution when one exists

What is a Cybernetics? a) Study of communication between two machines b) Study of communication between human and machine c) Study of communication between two humans d) Study of Boolean values

Description : What is a Cybernetics? a) Study of communication between two machines b) Study of communication between human and machine c) Study of communication between two humans d) Study of Boolean values

Last Answer : b) Study of communication between human and machine

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

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