Practice Data mining and ware house - computer mcq Online Quiz (set-1) For All Competitive Exams

Q-1)   A definition of a concept is——if it recognizes all the instances of that concept.

(a) Complete

(b) Consistent

(c) Constant

(d) None of these

Q-2)   Learning algorithm referrers to

(a) An algorithm that can learn

(b) A sub-discipline of computer science that deals with the design and implementation of learning algorithms.

(c) A machine-learning approach that abstracts from the actual strategy of an individual algorithm and can therefore be applied to any other form of machine learning.

(d) None of these

Q-3)   Machine learning is

(a) An algorithm that can learn

(b) A sub-discipline of computer science that deals with the design and implementation of learning algorithms.

(c) An approach that abstracts from the actual strategy of an individual algorithm and can therefore be applied to any other form of machine learning.

(d) None of these

Q-4)   Meta-data 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

Q-5)   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

Q-6)   Classification task referred to

(a) A subdivision of a set of examples into a number of classes

(b) A measure of the accuracy, of the classification of a concept that is given by a certain theory

(c) The task of assigning a classification to a set of examples

(d) None of these

Q-7)   Data warehouse is

(a) The actual discovery phase of a knowledge discovery process

(b) The stage of selecting the right data for a KDD process

(c) A subject-oriented integrated timevariant non-volatile collection of data in support of management

(d) None of these

Q-8)   Data selection is

(a) The actual discovery phase of a knowledge discovery process

(b) The stage of selecting the right data for a KDD process

(c) A subject-oriented integrated timevariant non-volatile collection of data in support of management

(d) None of these

Q-9)   Data cleaning is

(a) Large collection of data mostly stored in a computer system

(b) The removal of noise errors and incorrect input from a database

(c) The systematic description of the syntactic structure of a specific database. It describes the structure of the attributes the tables and foreign key relationships.

(d) None of these

Q-10)   DB/2 is

(a) A family of relational database management systems marketed by IBM

(b) Interactive systems that enable decision makers to use databases and models on a computer in order to solve illstructured problems

(c) It consists of nodes and branches starting from a single root node. Each node represents a test, or decision.

(d) None of these

Q-11)   Synapse is

(a) A class of graphic techniques used to visualize the contents of a database

(b) The division of a certain space into various areas based on guide points.

(c) A branch that connects one node to another

(d) None of these

Q-12)   Enrichment is

(a) A stage of the KDD process in which new data is added to the existing selection

(b) The process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them.

(c) The distance between two points as calculated using the Pythagoras theorem.

(d) None of these

Q-13)   Euclidean distance measure is

(a) A stage of the KDD process in which new data is added to the existing selection.

(b) The process of finding a solution for a problem simply by enumerating all possible solutions according to some pre-defined order and then testing them.

(c) The distance between two points as calculated using the Pythagoras theorem

(d) None of these

Q-14)   Multi-dimensional knowledge is

(a) A class of learning algorithms that try to derive a Prolog program from examples

(b) A table with n independent attributes can be seen as an n- dimensional space

(c) A prediction made using an extremely simple method, such as always predicting the same output.

(d) None of these

Q-15)   Inductive logic programming is

(a) A class of learning algorithms that try to derive a Prolog program from examples*

(b) A table with n independent attributes can be seen as an n- dimensional space.

(c) A prediction made using an extremely simple method, such as always predicting the same output.

(d) None of these

Q-16)   Key is referred to

(a) Non-trivial extraction of implicit previously unknown and potentially useful information from dat(A)

(b) Set of columns in a database table that can be used to identify each record within this table uniquely

(c) collection of interesting and useful patterns in a database

(d) none of these

Q-17)   Knowledge is referred to

(a) Non-trivial extraction of implicit previously unknown and potentially useful information from dat(A)

(b) Set of columns in a database table that can be used to identify each record within this table uniquely.

(c) collection of interesting and useful patterns in a database

(d) none of these

Q-18)   Binary attribute are

(a) This takes only two values. In general, these values will be 0 and 1 and they can be coded as one bit

(b) The natural environment of a certain species

(c) Systems that can be used without knowledge of internal operations

(d) None of these

Q-19)   Biotope are

(a) This takes only two values. In general, these values will be 0 and 1 and they can be coded as one bit.

(b) The natural environment of a certain species

(c) Systems that can be used without knowledge of internal operations

(d) None of these

Q-20)   Black boxes

(a) This takes only two values. In general, these values will be 0 and 1 and they can be coded as one bit.

(b) The natural environment of a certain species

(c) Systems that can be used without knowledge of internal operations

(d) None of these