McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Common Topics in Competitive and Entrance exams .
| 301. |
Which is not the type of attribute used in distance measure? |
| A. | ordinal |
| B. | nominal |
| C. | binay |
| D. | rank |
| Answer» D. rank | |
| 302. |
_____ method is used to find the distance between two objects represented by numerical attributes. |
| A. | euclidean distance |
| B. | minkowski distance |
| C. | manhattan distance |
| D. | all of these |
| Answer» D. all of these | |
| 303. |
Contingency table is prepared for _______ attribute data. |
| A. | ordinal |
| B. | nominal |
| C. | binay |
| D. | integer |
| Answer» C. binay | |
| 304. |
Which are the applications of proximity measures? |
| A. | classification |
| B. | clustering |
| C. | knn classifier |
| D. | all of these |
| Answer» D. all of these | |
| 305. |
_________ matrix represents the distance between all objects in the dataset |
| A. | confusion |
| B. | dissimilarity |
| C. | similarity |
| D. | square |
| Answer» B. dissimilarity | |
| 306. |
If o1 and o2 are two objects and distance between these objects is zero then it means_____ |
| A. | o1 and o2 are totally similar |
| B. | o1 and o2 are totally dissimilar |
| C. | o1 and o2 are similar |
| D. | o1 and o2 are partially dissimilar |
| Answer» A. o1 and o2 are totally similar | |
| 307. |
Identify the correct subtype of Binary attribute. |
| A. | ordinal |
| B. | asymmetric |
| C. | symmetric |
| D. | both b and c |
| Answer» D. both b and c | |
| 308. |
_____ Lower when objects are more alike. |
| A. | dissimilarity |
| B. | recall |
| C. | similarity |
| D. | accuracy |
| Answer» A. dissimilarity | |
| 309. |
Adaptive system management is |
| A. | It uses machine-learning techniques. Here program can learn from past experience and adapt themselves to new situations |
| B. | Computational procedure that takes some value as input and produces some value as output. |
| C. | Science of making machines performs tasks that would require intelligence when performed by humans |
| D. | None of these |
| Answer» A. It uses machine-learning techniques. Here program can learn from past experience and adapt themselves to new situations | |
| 310. |
Algorithm is |
| A. | It uses machine-learning techniques. Here program can learn from past experience and adapt themselves to new situations |
| B. | Computational procedure that takes some value as input and produces some value as output |
| C. | Science of making machines performs tasks that would require intelligence when performed by humans |
| D. | None of these |
| Answer» B. Computational procedure that takes some value as input and produces some value as output | |
| 311. |
Background knowledge referred to |
| A. | Additional acquaintance used by a learning algorithm to facilitate the learning process |
| B. | A neural network that makes use of a hidden layer. |
| C. | It is a form of automatic learning. |
| D. | None of these |
| Answer» A. Additional acquaintance used by a learning algorithm to facilitate the learning process | |
| 312. |
Back propagation networks is |
| A. | Additional acquaintance used by a learning algorithm to facilitate the learning process |
| B. | A neural network that makes use of a hidden layer |
| C. | It is a form of automatic learning. |
| D. | None of these |
| Answer» B. A neural network that makes use of a hidden layer | |
| 313. |
Bayesian classifiers is |
| A. | A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory. |
| B. | Any mechanism employed by a learning system to constrain the search space of a hypothesis. |
| C. | An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation. |
| D. | None of these |
| Answer» A. A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory. | |
| 314. |
Bias is |
| A. | A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory. |
| B. | Any mechanism employed by a learning system to constrain the search space of a hypothesis. |
| C. | An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation. |
| D. | None of these |
| Answer» B. Any mechanism employed by a learning system to constrain the search space of a hypothesis. | |
| 315. |
Case-based learning is |
| A. | A class of learning algorithm that tries to find an optimum classification of a set of examples using the probabilistic theory. |
| B. | Any mechanism employed by a learning system to constrain the search space of a hypothesis. |
| C. | An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation. |
| D. | None of these |
| Answer» C. An approach to the design of learning algorithms that is inspired by the fact that when people encounter new situations, they often explain them by reference to familiar experiences, adapting the explanations to fit the new situation. | |
| 316. |
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 |
| Answer» A. This takes only two values. In general, these values will be 0 and 1 and they can be coded as one bit | |
| 317. |
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 |
| Answer» B. The natural environment of a certain species | |
| 318. |
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 |
| Answer» C. Systems that can be used without knowledge of internal operations | |
| 319. |
Artificial intelligence is |
| A. | It uses machine-learning techniques. Here program can learn from past experience and adapt themselves to new situations |
| B. | Computational procedure that takes some value as input and produces some value as output. |
| C. | Science of making machines performs tasks that would require intelligence when performed by humans |
| D. | None of these |
| Answer» C. Science of making machines performs tasks that would require intelligence when performed by humans | |
| 320. |
Cache is |
| A. | It is a memory buffer that is used to store data that is needed frequently by an algorithm in order to minimize input/ output traffic |
| B. | The number of different values that a given attribute can take |
| C. | A mathematical conception of space where the location of a point is given by reference to its distance from two or three axes intersecting at right angles |
| D. | None of these |
| Answer» A. It is a memory buffer that is used to store data that is needed frequently by an algorithm in order to minimize input/ output traffic | |
| 321. |
Cardinality of an attribute is |
| A. | It is a memory buffer that is used to store data that is needed frequently by an algorithm in order to minimize input/ output traffic |
| B. | The number of different values that a given attribute can take |
| C. | A mathematical conception of space where the location of a point is given by reference to its distance from two or three axes intersecting at right angles |
| D. | None of these |
| Answer» B. The number of different values that a given attribute can take | |
| 322. |
Cartesian space is |
| A. | It is a memory buffer that is used to store data that is needed frequently by an algorithm in order to minimize input/ output traffic |
| B. | The number of different values that a given attribute can take |
| C. | A mathematical conception of space where the location of a point is given by reference to its distance from two or three axes intersecting at right angles |
| D. | None of these |
| Answer» A. It is a memory buffer that is used to store data that is needed frequently by an algorithm in order to minimize input/ output traffic | |
| 323. |
Classification is |
| 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 |
| Answer» A. A subdivision of a set of examples into a number of classes | |
| 324. |
Classification accuracy is |
| A. | A subdivision of a set of examples into a number of classes |
| B. | 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 |
| Answer» B. Measure of the accuracy, of the classification of a concept that is given by a certain theory | |
| 325. |
Cluster is |
| A. | Group of similar objects that differ significantly from other objects |
| B. | Operations on a database to transform or simplify data in order to prepare it for a machine-learning algorithm |
| C. | Symbolic representation of facts or ideas from which information can potentially be extracted |
| D. | None of these |
| Answer» A. Group of similar objects that differ significantly from other objects | |
| 326. |
Data is |
| A. | Group of similar objects that differ significantly from other objects |
| B. | Operations on a database to transform or simplify data in order to prepare it for a machine-learning algorithm |
| C. | Symbolic representation of facts or ideas from which information can potentially be extract |
| Answer» C. Symbolic representation of facts or ideas from which information can potentially be extract | |
| 327. |
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 |
| Answer» A. Complete | |
| 328. |
A definition or a concept is ———————if it does not classify any examples as coming within the concept |
| A. | Complete |
| B. | Consistent |
| C. | Constant |
| D. | None of these |
| Answer» B. Consistent | |
| 329. |
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 |
| Answer» C. The task of assigning a classification to a set of examples | |
| 330. |
Database 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 |
| Answer» A. Large collection of data mostly stored in a computer system | |
| 331. |
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 |
| Answer» B. The removal of noise errors and incorrect input from a database | |
| 332. |
Data dictionary 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 |
| Answer» 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. | |
| 333. |
Data mining 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 time- variant non-volatile collection of data in support of management |
| D. | None of these |
| Answer» A. The actual discovery phase of a knowledge discovery process | |
| 334. |
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 time- variant non-volatile collection of data in support of management |
| D. | None of these |
| Answer» B. The stage of selecting the right data for a KDD process | |
| 335. |
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 time- variant non-volatile collection of data in support of management |
| D. | None of these |
| Answer» C. A subject-oriented integrated time- variant non-volatile collection of data in support of management | |
| 336. |
Coding is |
| A. | Group of similar objects that differ significantly from other objects |
| B. | Operations on a database to transform or simplify data in order to prepare it for a machine-learning algorithm |
| C. | Symbolic representation of facts or ideas from which information can potentially be extracted |
| D. | None of these |
| Answer» B. Operations on a database to transform or simplify data in order to prepare it for a machine-learning algorithm | |
| 337. |
DB/2 is |
| A. | A family of relational database manage- ment systems marketed by IBM |
| B. | Interactive systems that enable decision makers to use databases and models on a computer in order to solve ill- structured 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 |
| Answer» A. A family of relational database manage- ment systems marketed by IBM | |
| 338. |
Decision support systems (DSS) 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 ill- structured 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 |
| Answer» B. Interactive systems that enable decision makers to use databases and models on a computer in order to solve ill- structured problems | |
| 339. |
Decision trees 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 ill- structured 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 |
| Answer» C. It consists of nodes and branches starting from a single root node. Each node represents a test, or decision. | |
| 340. |
Deep knowledge referred to |
| A. | It is hidden within a database and can only be recovered if one is given certain clues (an example IS encrypted information) |
| B. | The process of executing implicit previously unknown and potentially useful information from dat(A) |
| C. | An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes. |
| D. | None of these |
| Answer» A. It is hidden within a database and can only be recovered if one is given certain clues (an example IS encrypted information) | |
| 341. |
Discovery is |
| A. | It is hidden within a database and can only be recovered if one is given certain clues (an example IS encrypted information). |
| B. | The process of executing implicit previously unknown and potentially useful information from dat(A) |
| C. | An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes. |
| D. | None of these |
| Answer» B. The process of executing implicit previously unknown and potentially useful information from dat(A) | |
| 342. |
DNA (Deoxyribonucleic acid) |
| A. | It is hidden within a database and can only be recovered if one is given certain clues (an example IS encrypted information). |
| B. | The process of executing implicit previously unknown and potentially useful information from dat (A) |
| C. | An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes. |
| D. | None of these |
| Answer» C. An extremely complex molecule that occurs in human chromosomes and that carries genetic information in the form of genes. | |
| 343. |
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 |
| Answer» A. A stage of the KDD process in which new data is added to the existing selection | |
| 344. |
Enumeration is referred to |
| 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 |
| Answer» 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 | |
| 345. |
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 theo- rem |
| D. | None of these |
| Answer» C. The distance between two points as calculated using the Pythagoras theo- rem | |
| 346. |
Heuristic is |
| A. | A set of databases from different vendors, possibly using different database paradigms |
| B. | An approach to a problem that is not guaranteed to work but performs well in most cases. |
| C. | Information that is hidden in a database and that cannot be recovered by a simple SQL query. |
| D. | None of these |
| Answer» B. An approach to a problem that is not guaranteed to work but performs well in most cases. | |
| 347. |
Heterogeneous databases referred to |
| A. | A set of databases from different vendors, possibly using different database paradigms |
| B. | An approach to a problem that is not guaranteed to work but performs well in most cases. |
| C. | Information that is hidden in a database and that cannot be recovered by a simple SQL query. |
| D. | None of these |
| Answer» A. A set of databases from different vendors, possibly using different database paradigms | |
| 348. |
Hidden knowledge referred to |
| A. | A set of databases from different vendors, possibly using different database paradigms |
| B. | An approach to a problem that is not guaranteed to work but performs well in most cases. |
| C. | Information that is hidden in a database and that cannot be recovered by a simple SQL query. |
| D. | None of these |
| Answer» C. Information that is hidden in a database and that cannot be recovered by a simple SQL query. | |
| 349. |
Hybrid is |
| A. | Combining different types of method or information |
| B. | Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. |
| C. | Decision support systems that contain an Information base filled with the knowledge of an expert formulated in terms of if-then rules. |
| D. | None of these |
| Answer» A. Combining different types of method or information | |
| 350. |
Evolutionary computation is |
| A. | Combining different types of method or information |
| B. | Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. |
| C. | Decision support systems that contain an Information base filled with the knowledge of an expert formulated in terms of if-then rules. |
| D. | None of these |
| Answer» B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.