If a hypothesis says it should be positive, but in fact it is negative, we call it ___________

a) A consistent hypothesis

b) A false negative hypothesis

c) A false positive hypothesis

d) A specialized hypothesis

1 Answer

Answer :

c) A false positive hypothesis

Related questions

Description : If a hypothesis says it should be positive, but in fact, it is negative, we call it __________ a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis

Last Answer : c) A false positive hypothesis

Description : If a hypothesis says it should be positive, but in fact, it is negative, we call it a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis e) A true positive hypothesis

Last Answer : c) A false positive hypothesis

Description : Inductive learning involves finding a __________ a) Consistent Hypothesis b) Inconsistent Hypothesis c) Regular Hypothesis d) Irregular Hypothesis

Last Answer : a) Consistent Hypothesis

Description : Inductive learning involves finding a a) Consistent Hypothesis b) Inconsistent Hypothesis c) Regular Hypothesis d) Irregular Hypothesis e) Estimated Hypothesis

Last Answer : a) Consistent Hypothesis

Description : The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable. a) True b) False

Last Answer : a) True

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

Description : The hardware features of LISP machines generally include __________ a) large memory and a high-speed processor b) letter-quality printers and 8-inch disk drives c) a mouse and a specialized keyboard d) large memory and a high-speed processor & a mouse and a specialized keyboard

Last Answer : d) large memory and a high-speed processor & a mouse and a specialized keyboard

Description : In LISP, the atom that stands for “False” is ___________ a) t b) nil c) y d) time

Last Answer : b) nil

Description : Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Last Answer : b) Ockham razor

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 : Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned

Last Answer : b) Ockham razor

Description : Define a consistent plan.

Last Answer : A consistent plan is one in which there are no contradictions in the ordering or binding constraints. 

Description : Which are more suitable normal form to be used with definite clause? a) Positive literal b) Negative literal c) Generalized modus ponens d) Neutral literal

Last Answer : c) Generalized modus ponens

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

Description : Subject orientation A . The science of collecting, organizing, and applying numerical facts B. Measure of the probability that a certain hypothesis is incorrect given certain observations. C. ... specially built around all the existing applications of the operational data D . None of these

Last Answer : C. One of the defining aspects of a data warehouse, which is specially built around all the existing applications of the operational data

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

Last Answer : b) Unrealizable

Description : A hypothesis that States the nature (positive or negative) of the interaction between two or more variables is called a. Associated Hypothesis b. Casual Hypothesis c. Null Hypothesis d. Directional Hypothesis

Last Answer : d. Directional Hypothesis

Description : CoAP is specialized in ___________ A. Internet applications B. Device applications C. Wireless applications D. Wired applications

Last Answer : A. Internet applications 

Description : A striking feature of living cells is a marked difference between the composition of the cytosol and the extracellular milieu. Which of the following statement(s) concerning the mechanisms of maintenance ... d. The selectivity of cell membranes relates only to ions and not organic compounds

Last Answer : Answer: a The survival of the cell requires that cytosolic composition be maintained within narrow limits, despite the constant influx of nutrients and the simultaneous outflow of waste. A ... be altered drastically as a result of regulatory or signaling processes that occur within the cell

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 : In his landmark book Cybernetics, Norbert Wiener suggested a way of modeling scientific phenomena using not energy, but ___________ a) mathematics b) intelligence c) information d) history

Last Answer : c) information

Description : Marketers must take steps to make sure that pricing objectives they set are consistent with the organisation's ___________ and ___________ . A)advertising objectives; marketing ... ; marketing objectives C)marketing objectives; promotional objectives D)overall objectives; promotional objectives

Last Answer : B)overall objectives; marketing objectives

Description : From where did the new fact inferred on new iteration is derived? a) Old fact b) Narrow fact c) New fact d) All of the mentioned

Last Answer : c) New fact

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 area of AI that investigates methods of facilitating communication between people and computers is ___________ a) natural language processing b) symbolic processing c) decision support d) robotics

Last Answer : a) natural language processing

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

Description : Seymour Papert of the MIT AI lab created a programming environment for children called ___________ a) BASIC b) LOGO c) MYCIN d) FORTRAN

Last Answer : b) LOGO

Description : Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned

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

Description : MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned

Last Answer : b) human factors

Description : In LISP, the function returns t if is even and nil otherwise ___________ a) (evenp ) b) (even ) c) (numeven ) d) (numnevenp )

Last Answer : a) (evenp )

Description : Fuzzy logic is usually represented as ___________ a) IF-THEN-ELSE rules b) IF-THEN rules c) Both IF-THEN-ELSE rules & IF-THEN rules

Last Answer : b) IF-THEN rules

Description : The values of the set membership is represented by ___________ a) Discrete Set b) Degree of truth c) Probabilities d) Both Degree of truth & Probabilities

Last Answer : b) Degree of truth

Description : A constructive approach in which no commitment is made unless it is necessary to do so is ___________ a) Least commitment approach b) Most commitment approach

Last Answer : a) Least commitment approach

Description : A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Last Answer : a) Both discrete and continuous variables

Description : Uncertainty arises in the wumpus world because the agent’s sensors give only ___________ a) Full & Global information b) Partial & Global Information c) Partial & local Information d) Full & local information

Last Answer : c) Partial & local Information

Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Last Answer : a) Deterministic

Description : Forward chaining systems are _____________ where as backward chaining systems are ___________ a) Goal-driven, goal-driven b) Goal-driven, data-driven c) Data-driven, goal-driven d) Data-driven, data-driven

Last Answer : c) Data-driven, goal-driven

Description : What among the following could the universal instantiation of ___________ For all x King(x) ^ Greedy(x) => Evil(x) a) King(John) ^ Greedy(John) => Evil(John) b) King(y) ^ Greedy(y) => Evil(y) c) King(Richard) ^ Greedy(Richard) => Evil(Richard) d) All of the mentioned

Last Answer : d) All of the mentioned

Description : The adjective first-order distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of ... Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency

Last Answer : c) Higher Order Logic

Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned

Last Answer : d) All of the mentioned

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 : 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 : The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Backtrack search

Description : Searching using query on Internet is, use of ___________ type of agent. a) Offline agent b) Online agent c) Both Offline & Online agent d) Goal Based & Online agent

Last Answer : d) Goal Based & Online agent

Description : Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost

Last Answer : c) The one closest to the goal node

Description : A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Last Answer : c) Best-First-Search

Description : A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned

Last Answer : d) All of the mentioned