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.
| 201. |
Quadratic complexity is |
| A. | A reference to the speed of an algorithm, which is quadratically dependent on the size of the dat(A) |
| B. | Attributes of a database table that can take only numerical values. |
| C. | Tools designed to query a database. |
| D. | None of these |
| Answer» B. Attributes of a database table that can take only numerical values. | |
| 202. |
In ________ algorithm each cluster is represented by the center of gravity of the cluster. |
| A. | k-medoid. |
| B. | k-means. |
| C. | stirr. |
| D. | rock. |
| Answer» C. stirr. | |
| 203. |
RBF stands for _____________. |
| A. | radial basis function. |
| B. | radial bio function. |
| C. | radial big function. |
| D. | radial bi function. |
| Answer» B. radial bio function. | |
| 204. |
The actual amount of reduction at each learning step may be guided by _________. |
| A. | learning cost. |
| B. | learning level. |
| C. | learning rate. |
| D. | learning time. |
| Answer» D. learning time. | |
| 205. |
The goal of _____ is to discover both the dense and sparse regions of a data set. |
| A. | association rule. |
| B. | classification. |
| C. | clustering. |
| D. | genetic algorithm. |
| Answer» D. genetic algorithm. | |
| 206. |
Link Analysis is otherwise called as ___________. |
| A. | affinity analysis. |
| B. | association rules. |
| C. | both a & b. |
| D. | prediction. |
| Answer» D. prediction. | |
| 207. |
Dynamuc Itemset Counting Algorithm was proposed by ____. |
| A. | bin et al. |
| B. | argawal et at. |
| C. | toda et al. |
| D. | simon et at. |
| Answer» B. argawal et at. | |
| 208. |
__________ describes the discovery of useful information from the web contents. |
| A. | web content mining. |
| B. | web structure mining. |
| C. | web usage mining. |
| D. | all of the above. |
| Answer» B. web structure mining. | |
| 209. |
Data warehousing is used in_______________ |
| A. | transaction system |
| B. | database management system |
| C. | decision support system |
| D. | expert system |
| Answer» D. expert system | |
| 210. |
___________ training may be used when a clear link between input data sets and target outputvalues does not exist. |
| A. | competitive. |
| B. | perception. |
| C. | supervised. |
| D. | unsupervised. |
| Answer» E. | |
| 211. |
___________ is a method of incremental conceptual clustering. |
| A. | corba. |
| B. | olap. |
| C. | cobweb. |
| D. | sting. |
| Answer» D. sting. | |
| 212. |
__________ is a subject-oriented, integrated, time-variant, nonvolatile collection of data in supportof management decisions. |
| A. | data mining. |
| B. | data warehousing. |
| C. | web mining. |
| D. | text mining. |
| Answer» C. web mining. | |
| 213. |
The second phaase of A Priori algorithm is ____________. |
| A. | candidate generation. |
| B. | itemset generation. |
| C. | pruning. |
| D. | partitioning. |
| Answer» D. partitioning. | |
| 214. |
If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction containjam, 10000 transaction contain both bread and jam. Then the support of bread and jam is _______. |
| A. | 2% |
| B. | 20% |
| C. | 3% |
| D. | 30% |
| Answer» B. 20% | |
| 215. |
The cluster features of different subclusters are maintained in a tree called ___________. |
| A. | cf tree. |
| B. | fp tree. |
| C. | fp growth tree. |
| D. | b tree. |
| Answer» B. fp tree. | |
| 216. |
The biggest drawback of the level indicator in the classic star-schema is that it limits_________.http://grdmcqonline/printqp.php?heading=II M.Sc(IT) [2012-2014], Se...4 of 34 8/20/2013 2:47 PM |
| A. | quantify. |
| B. | qualify. |
| C. | flexibility. |
| D. | ability. |
| Answer» D. ability. | |
| 217. |
The technology area associated with CRM is _______________. |
| A. | specialization. |
| B. | generalization. |
| C. | personalization. |
| D. | summarization. |
| Answer» D. summarization. | |
| 218. |
The basic idea of the apriori algorithm is to generate________ item sets of a particular size &scans the database. |
| A. | candidate. |
| B. | primary. |
| C. | secondary. |
| D. | superkey. |
| Answer» B. primary. | |
| 219. |
An algorithm called________is used to generate the candidate item sets for each pass after thefirst. |
| A. | apriori. |
| B. | apriori-gen. |
| C. | sampling. |
| D. | partition. |
| Answer» C. sampling. | |
| 220. |
_______________ is an example of application development environments. |
| A. | visual basic. |
| B. | oracle. |
| C. | sybase. |
| D. | sql server. |
| Answer» B. oracle. | |
| 221. |
_____________ helps to uncover hidden information about the data.http://grdmcqonline/printqp.php?heading=II M.Sc(IT) [2012-2014], Se...17 of 34 8/20/2013 2:47 PM |
| A. | induction. |
| B. | compression. |
| C. | approximation. |
| D. | summarization. |
| Answer» D. summarization. | |
| 222. |
_____________ helps to uncover hidden information about the data. |
| A. | induction. |
| B. | compression. |
| C. | approximation. |
| D. | summarization. |
| Answer» D. summarization. | |
| 223. |
In data warehousing what is time-variant data? |
| A. | data in the warehouse is only accurate and valid at some point in time or over time interval |
| B. | data in the warehouse is always accurate and valid |
| C. | data in the warehouse is not accurate |
| D. | data in the warehouse is only accurate sometimes |
| Answer» B. data in the warehouse is always accurate and valid | |
| 224. |
_________ is the connectivity of the neuron that give simple devices their real power. a. b. c. d. |
| A. | water. |
| B. | air. |
| C. | power. |
| D. | fire. |
| Answer» E. | |
| 225. |
______ are effective tools to attack the scalability problem. |
| A. | sampling. |
| B. | parallelization |
| C. | both a & b. |
| D. | none of the above. |
| Answer» D. none of the above. | |
| 226. |
___________ data are noisy and have many missing attribute values. |
| A. | preprocessed. |
| B. | cleaned. |
| C. | real-world. |
| D. | transformed. |
| Answer» D. transformed. | |
| 227. |
An operational system is _____________. |
| A. | used to run the business in real time and is based on historical data. |
| B. | used to run the business in real time and is based on current data. |
| C. | used to support decision making and is based on current data. |
| D. | used to support decision making and is based on historical data. |
| Answer» C. used to support decision making and is based on current data. | |
| 228. |
In a feed- forward networks, the conncetions between layers are ___________ from input to output. |
| A. | bidirectional. |
| B. | unidirectional. |
| C. | multidirectional. |
| D. | directional. |
| Answer» C. multidirectional. | |
| 229. |
________________defines the structure of the data held in operational databases and used byoperational applications. |
| A. | user-level metadata. |
| B. | data warehouse metadata. |
| C. | operational metadata. |
| D. | data mining metadata. |
| Answer» D. data mining metadata. | |
| 230. |
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» C. Decision support systems that contain an Information base filled with the knowledge of an expert formulated in terms of if-then rules. | |
| 231. |
Describing some characteristics of a set of data by a general model is viewed as ____________ |
| A. | induction. |
| B. | compression. |
| C. | approximation. |
| D. | summarization. |
| Answer» C. approximation. | |
| 232. |
____________ is a metadata repository. |
| A. | prism solution directory manager. |
| B. | corba. |
| C. | stunt. |
| D. | cobweb. |
| Answer» B. corba. | |
| 233. |
What is a Star Schema? |
| A. | a star schema consists of a fact table with a single table for each dimension |
| B. | a star schema is a type of database system |
| C. | a star schema is used when exporting data from the database |
| D. | none of these |
| Answer» B. a star schema is a type of database system | |
| 234. |
Minkowski distance is a function used to find the distance between two |
| A. | binary vectors |
| B. | boolean-valued vectors |
| C. | real-valued vectors |
| D. | categorical vectors |
| Answer» D. categorical vectors | |
| 235. |
A directory to help the DSS analyst locate the contents of the data warehouse is seen in ______. |
| A. | current detail data. |
| B. | lightly summarized data. |
| C. | metadata. |
| D. | older detail data. |
| Answer» D. older detail data. | |
| 236. |
The ________ algorithm is based on the observation that the frequent sets are normally very fewin number compared to the set of all itemsets. |
| A. | a priori. |
| B. | clustering. |
| C. | association rule. |
| D. | partition. |
| Answer» E. | |
| 237. |
Maintenance of cache consistency is the limitation of __________________. |
| A. | numa. |
| B. | unam. |
| C. | mpp. |
| D. | pmp. |
| Answer» D. pmp. | |
| 238. |
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 |
| Answer» B. A computer where each processor has its own operating system, its own memory, and its own hard disk. | |
| 239. |
What does the acronym ETL stands for? |
| A. | explain,transfer and lead |
| B. | extract,transform and load |
| C. | extract,transfer and load |
| D. | effect,transfer and load |
| Answer» C. extract,transfer and load | |
| 240. |
The FP-growth algorithm has ________ phases. |
| A. | one. |
| B. | two. |
| C. | three. |
| D. | four. |
| Answer» C. three. | |
| 241. |
_____ 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» E. | |
| 242. |
Data warehouse architecture is based on ______________. |
| A. | dbms. |
| B. | rdbms. |
| C. | sybase. |
| D. | sql server. |
| Answer» C. sybase. | |
| 243. |
___________ of data means that the attributes within a given entity are fully dependent on the entireprimary key of the entity. |
| A. | additivity. |
| B. | granularity. |
| C. | functional dependency. |
| D. | dimensionality. |
| Answer» D. dimensionality. | |
| 244. |
Highly summarized data is _______. |
| A. | compact and easily accessible. |
| B. | compact and expensive. |
| C. | compact and hardly accessible. |
| D. | compact. |
| Answer» B. compact and expensive. | |
| 245. |
Fact tables are ___________. |
| A. | completely demoralized. |
| B. | partially demoralized. |
| C. | completely normalized. |
| D. | partially normalized. |
| Answer» D. partially normalized. | |
| 246. |
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» B. o1 and o2 are totally dissimilar | |
| 247. |
SQL stand for _________. |
| A. | standard query language. |
| B. | structured query language. |
| C. | standard quick list. |
| D. | structured query list. |
| Answer» C. standard quick list. | |
| 248. |
_______ are needed to identify training data and desired results. |
| A. | programmers. |
| B. | designers. |
| C. | users. |
| D. | administrators. |
| Answer» D. administrators. | |
| 249. |
A ___________ model identifies patterns or relationships. |
| A. | descriptive. |
| B. | predictive. |
| C. | regression. |
| D. | time series analysis. |
| Answer» B. predictive. | |
| 250. |
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» B. Interactive systems that enable decision makers to use databases and models on a computer in order to solve ill- structured problems | |