MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 347 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
_________ is a the input to KDD. |
| A. | data. |
| B. | information. |
| C. | query. |
| D. | process. |
| Answer» B. information. | |
| 102. |
__________ clustering techniques starts with all records in one cluster and then try to split that clusterinto small pieces. |
| A. | agglomerative. |
| B. | divisive. |
| C. | partition. |
| D. | numeric. |
| Answer» C. partition. | |
| 103. |
Extreme values that occur infrequently are called as _________. |
| A. | outliers. |
| B. | rare values. |
| C. | dimensionality reduction. |
| D. | all of the above. |
| Answer» B. rare values. | |
| 104. |
Parallelism 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. |
| Answer» C. Structures in a database those are statistically relevant. | |
| 105. |
In web mining, _______ is used to find natural groupings of users, pages, etc. |
| A. | clustering. |
| B. | associations. |
| C. | sequential analysis. |
| D. | classification. |
| Answer» B. associations. | |
| 106. |
A frequent pattern tree is a tree structure consisting of ________. |
| A. | an item-prefix-tree. |
| B. | a frequent-item-header table. |
| C. | a frequent-item-node. |
| D. | both a & b. |
| Answer» E. | |
| 107. |
____________ are some popular OLAP tools. |
| A. | metacube, informix. |
| B. | oracle express, essbase. |
| C. | holap. |
| D. | molap. |
| Answer» B. oracle express, essbase. | |
| 108. |
_______ is concerned with discovering the model underlying the link structures of the web. |
| A. | web content mining. |
| B. | web structure mining. |
| C. | web usage mining. |
| D. | all of the above. |
| Answer» C. web usage mining. | |
| 109. |
The partition algorithm uses _______ scans of the databases to discover all frequent sets. |
| A. | two. |
| B. | four. |
| C. | six. |
| D. | eight. |
| Answer» B. four. | |
| 110. |
Which are the applications of proximity measures? |
| A. | classification |
| B. | clustering |
| C. | knn classifier |
| D. | all of these |
| Answer» E. | |
| 111. |
The sigmoid function also knows as __________functions. |
| A. | regression. |
| B. | logistic. |
| C. | probability. |
| D. | neural. |
| Answer» C. probability. | |
| 112. |
Pick out a hierarchical clustering algorithm. |
| A. | dbscan |
| B. | birch. |
| C. | pam. |
| D. | cure. |
| Answer» B. birch. | |
| 113. |
The frequent-item-header-table consists of __________ fields. |
| A. | only one. |
| B. | two. |
| C. | three. |
| D. | four. |
| Answer» C. three. | |
| 114. |
The transformed prefix paths of a node 'a' form a truncated database of pattern which co-occur with ais called _______. |
| A. | suffix path. |
| B. | fp-tree. |
| C. | conditional pattern base. |
| D. | prefix path. |
| Answer» D. prefix path. | |
| 115. |
Web content mining describes the discovery of useful information from the _______contents. |
| A. | text. |
| B. | web. |
| C. | page. |
| D. | level. |
| Answer» C. page. | |
| 116. |
Certain itemsets in the dashed circle whose support count reach support value during an iterationmove into the ______. |
| A. | dashed box. |
| B. | solid circle. |
| C. | solid box. |
| D. | none of the above. |
| Answer» B. solid circle. | |
| 117. |
________________ is an expensive process in building an expert system. |
| A. | analysis. |
| B. | study. |
| C. | design. |
| D. | information collection. |
| Answer» E. | |
| 118. |
Exceptional reporting in data warehousing is otherwise called as __________. |
| A. | exception. |
| B. | alerts. |
| C. | errors. |
| D. | bugs. |
| Answer» C. errors. | |
| 119. |
_______ mining is concerned with discovering the model underlying the link structures of the web. |
| A. | data structure. |
| B. | web structure. |
| C. | text structure. |
| D. | image structure. |
| Answer» C. text structure. | |
| 120. |
SOM is an acronym of _______________. |
| A. | self-organizing map. |
| B. | self origin map. |
| C. | single organizing map. |
| D. | simple origin map. |
| Answer» B. self origin map. | |
| 121. |
The important aspect of the data warehouse environment is that data found within the data warehouseis___________. |
| A. | subject-oriented. |
| B. | time-variant. |
| C. | integrated. |
| D. | all of the above. |
| Answer» E. | |
| 122. |
The data administration subsystem helps you perform all of the following, except__________. |
| A. | backups and recovery. |
| B. | query optimization. |
| C. | security management. |
| D. | create, change, and delete information. |
| Answer» E. | |
| 123. |
_______test is used in an online transactional processing environment. |
| A. | mega. |
| B. | micro. |
| C. | macro. |
| D. | acid. |
| Answer» E. | |
| 124. |
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 |
| Answer» D. None of these | |
| 125. |
Data redundancy between the environments results in less than ____________percent. |
| A. | one. |
| B. | two. |
| C. | three. |
| D. | four. |
| Answer» B. two. | |
| 126. |
The active data warehouse architecture includes __________ |
| A. | at least one data mart. |
| B. | data that can extracted from numerous internal and external sources. |
| C. | near real-time updates. |
| D. | all of the above. |
| Answer» E. | |
| 127. |
Treating incorrect or missing data is called as ___________. |
| A. | selection. |
| B. | preprocessing. |
| C. | transformation. |
| D. | interpretation. |
| Answer» C. transformation. | |
| 128. |
Crossover is used to _______. |
| A. | recombine the population\s genetic material. |
| B. | introduce new genetic structures in the population. |
| C. | to modify the population\s genetic material. |
| D. | all of the above. |
| Answer» B. introduce new genetic structures in the population. | |
| 129. |
The granularity of the fact is the _____ of detail at which it is recorded. |
| A. | transformation. |
| B. | summarization. |
| C. | level. |
| D. | transformation and summarization. |
| Answer» D. transformation and summarization. | |
| 130. |
Any superset of an infrequent set is an infrequent set. This is _______. |
| A. | maximal frequent set. |
| B. | border set. |
| C. | upward closure property. |
| D. | downward closure property. |
| Answer» D. downward closure property. | |
| 131. |
SOM was developed during ____________. |
| A. | 1970-80. |
| B. | 1980-90. |
| C. | 1990 -60. |
| D. | 1979 -82. |
| Answer» E. | |
| 132. |
The ___________ engine for a data warehouse supports query-triggered usage of data |
| A. | nntp |
| B. | smtp |
| C. | olap |
| D. | pop |
| Answer» D. pop | |
| 133. |
___________ of data means that the attributes within a given entity are fully dependent on theentire primary key of the entity. |
| A. | additivity. |
| B. | granularity. |
| C. | functional dependency. |
| D. | dimensionality. |
| Answer» D. dimensionality. | |
| 134. |
Research on mining multi-types of data is termed as _______ data. |
| A. | graphics. |
| B. | multimedia. |
| C. | meta. |
| D. | digital. |
| Answer» C. meta. | |
| 135. |
Box plot and scatter diagram techniques are _______. |
| A. | graphical. |
| B. | geometric. |
| C. | icon-based. |
| D. | pixel-based. |
| Answer» C. icon-based. | |
| 136. |
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» D. None of these | |
| 137. |
The data in current detail level resides till ________ event occurs. |
| A. | purge. |
| B. | summarization. |
| C. | archieved. |
| D. | all of the above. |
| Answer» E. | |
| 138. |
The term that is not associated with data cleaning process is ______. |
| A. | domain consistency. |
| B. | deduplication. |
| C. | disambiguation. |
| D. | segmentation. |
| Answer» E. | |
| 139. |
In web mining, _________ is used to know which URLs tend to be requested together. |
| A. | clustering. |
| B. | associations. |
| C. | sequential analysis. |
| D. | classification. |
| Answer» C. sequential analysis. | |
| 140. |
The a priori frequent itemset discovery algorithm moves _______ in the lattice. |
| A. | upward. |
| B. | downward. |
| C. | breadthwise. |
| D. | both upward and downward. |
| Answer» B. downward. | |
| 141. |
Converting data from different sources into a common format for processing is called as ________. |
| A. | selection. |
| B. | preprocessing. |
| C. | transformation. |
| D. | interpretation. |
| Answer» D. interpretation. | |
| 142. |
The main organizational justification for implementing a data warehouse is to provide ______. |
| A. | cheaper ways of handling transportation. |
| B. | decision support. |
| C. | storing large volume of data. |
| D. | access to data. |
| Answer» D. access to data. | |
| 143. |
Various visualization techniques are used in ___________ step of KDD. |
| A. | selection. |
| B. | transformaion. |
| C. | data mining. |
| D. | interpretation. |
| Answer» E. | |
| 144. |
Unsupervised algorithms |
| A. | It do not need the control of the human operator during their execution. |
| B. | An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars. |
| C. | The validation of a theory on the basis of a finite number of examples. |
| D. | None of these |
| Answer» B. An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars. | |
| 145. |
The non-root node of item-prefix-tree consists of ________ fields. |
| A. | two. |
| B. | three. |
| C. | four. |
| D. | five. |
| Answer» C. four. | |
| 146. |
Identify the correct subtype of Binary attribute. |
| A. | ordinal |
| B. | asymmetric |
| C. | symmetric |
| D. | both b and c |
| Answer» E. | |
| 147. |
The itemsets in the _______category structures are not subjected to any counting. |
| A. | dashes. |
| B. | box. |
| C. | solid. |
| D. | circle. |
| Answer» D. circle. | |
| 148. |
Strategic value of data mining is ______________. |
| A. | cost-sensitive. |
| B. | work-sensitive. |
| C. | time-sensitive. |
| D. | technical-sensitive. |
| Answer» D. technical-sensitive. | |
| 149. |
The itemsets that have completed on full pass move from dashed circle to ________. |
| A. | dashed box. |
| B. | solid circle. |
| C. | solid box. |
| D. | none of the above. |
| Answer» C. solid box. | |
| 150. |
Data set of designation {Professor, Assistant Professor, Associate Professor} is example of__________attribute. |
| A. | continuous |
| B. | ordinal |
| C. | numeric |
| D. | nominal |
| Answer» E. | |