Description : What is a pattern database?
Last Answer : This database is the storage of exact solution costs for every possible sub problem instance.
Description : What Difference between disjoint and overlapping constraints?
Last Answer : Need answer
Description : What is a disjoint events mean?
Last Answer : In probability theory, disjoint events are two (or more) events where more than one cannot occur in the same trial. It is possible that none of them occur in a particular trial.
Description : Mutual exclusion problem occurs between: a) processes that share resources b) processes that do not use the same resources c) two disjoint processes that do not interact d) None of The Above
Last Answer : a) processes that share resources
Description : A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles. (A) n-2, n-1 (B) n-3, n-2 (C) n-1, n (D) n-2, n-2
Last Answer : (B) n-3, n-2
Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned
Last Answer : a) (ii) and (iii) are true
Description : An Artificial Intelligence technique that allows computers to understand associations and relationships between objects and events is called _____________ a) heuristic processing b) cognitive science c) relative symbolism d) pattern matching
Last Answer : c) relative symbolism
Description : Artificial neural network used for A. Pattern Recognition B. Classification C. Clustering D. All of these
Last Answer : D. All of these
Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned
Description : An AI technique that allows computers to understand associations and relationships between objects and events is called: a. heuristic processing b. cognitive science c. relative symbolism d. pattern matching
Last Answer : d. pattern matching
Description : Define pattern matching.
Last Answer : The inner loop of an algorithm involves finding all the possible unifiers with facts in the KB. This is called pattern matching.
Description : Where did all the facts are stored to implement store and fetch function? a) Database b) Knowledge base c) Datamart d) All of the mentioned
Last Answer : b) Knowledge base
Description : An expert system differs from a database program in that only an expert system _____________ a) contains declarative knowledge b) contains procedural knowledge c) features the retrieval of stored information d) expects users to draw their own conclusions
Last Answer : b) contains procedural knowledge
Description : What is the name of the computer program that contains the distilled knowledge of an expert? a) Database management system b) Management information System c) Expert system d) Artificial intelligence
Last Answer : c) Expert system
Description : Transparency A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these
Last Answer : C. Worth of the output of a machine learning program that makes it understandable for humans
Description : Quantitative attributes are A. A reference to the speed of an algorithm, which is quadratically dependent on the size of the data B. Attributes of a database table that can take only numerical values C. Tools designed to query a database D. None of these
Last Answer : B. Attributes of a database table that can take only numerical values
Description : Shallow knowledge A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these
Last Answer : B. The information stored in a database that can be, retrieved with a single query
Description : Prolog is A. A programming language based on logic B. A computer where each processor has its own operating system, its own memory, and its own hard disk C. Describes the structure of the contents of a database D. None of these
Last Answer : A. A programming language based on logic
Description : Perceptron is A. General class of approaches to a problem. B. Performing several computations simultaneously C. Structures in a database those are statistically relevant D. Simple forerunner of modern neural networks, without hidden layers
Last Answer : D. Simple forerunner of modern neural networks, without hidden layers
Description : n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these
Last Answer : A. A measure of the desired maximal complexity of data mining algorithms
Description : Search space A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query. C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these
Last Answer : A . The large set of candidate solutions possible for a problem
Description : Massively parallel machine is A. A programming language based on logic B. A computer where each processor has its own operating system, its own memory, and its own hard disk C. Describes the structure of the contents of a database. D. None of these
Last Answer : B. A computer where each processor has its own operating system, its own memory, and its own hard disk
Description : extendible architecture is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. ... of attributes in a database table that refers to data in another table D. None of these
Last Answer : A. Modular design of a software application that facilitates the integration of new modules
Description : Falsification is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. A set of attributes in a database table that refers to data in another table D. None of these
Last Answer : B. Showing a universal law or rule to be invalid by providing a counter example
Description : The Hadoop list includes the HBase database, the Apache Mahout ________ system, and matrix operations. a) Machine learning b) Pattern recognition c) Statistical classification d) Artificial intelligence
Last Answer : Machine learning
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 : 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 : 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 : 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
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 : 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)
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 : 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
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
Description : The primary method that people use to sense their environment is ____________ a) reading b) writing c) speaking d) seeing
Last Answer : d) seeing
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 : 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
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
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 : 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
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
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
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)
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)
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 : 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
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 : 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
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