hutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. Dr.G.R.Damodaran College of Science (Autonomous, affiliated to the Bharathiar University. recognized by the UGC)Re- accredited at the ‘A’ Grade Level by the NAAC and ISO 9001:2008 Certified CRISL rated 'A’ (TN) for MBA and MIB Programmes I MSe(IT) [2012-2014] Semester III Core: Data Warehousing and Mining - 363U1 Multiple Choice Questions. 1. is a subject-oriented, integrated, time-variant, nonvolatike collection of data in support ‘of management decisions. A. Data Mining. B. Data Warehousing. f. Tesh Mining: ANSWER: B 2. The data Warehouse is. A. read only. B. write only. C. read write only. D. none. ANSWER: A 3. Expansion for DSS in DW is, A. Decision Support system. B, Decision Single System. C. Data Storable System. D. Data Support System ANSWER: A 4, The important aspect of the data warehouse environment is that data found within the data warehouse is A. subject-oriented. B, fiRanNateant D. Allof the above. ANSWER: D 5. The time horizon in Data warehouse is usually A. 1-2 years. B. 3-dyears. C. 5-6 years. D, 5-10 years. ANSWER: D 6. The data is stored, retrieved & updated in _ A. OLAP, B. OLTP, C. SMTP. lof 34 8/20/2013 2:47 PND. FIP. ANSWER: B _describes the data contained in the data warehouse. A. Relational data. B. Operational data. C. Metadata. D. Informational data, ANSWER: C 8 __predicts future trends & behaviors, allowing business managers to make proactive, knowledge-driven decisions, A. Data warehouse. B. Data mining. C. Datamarts. D. Metadata. ANSWER: B __is the heart of the warehouse. Dawning database serve B, Data warehouse database servers, C. Data mart database servers D. Relational data base servers. ANSWER: B 10. A. Oracle. B. DBZ. C. Informix. D. Redbrick. ANSWER: D is the specialized data warehouse database. MW defines the structure of the data held in operational databases and used by operational applications, A. User-level metadata B. Data warehouse metadata C. Operational metadata D. Data m netadata. ANSWER: C is held in the catalog of the warehouse database system, - ation level metads B. Algorithmic level metadata. C. Departmental level metadata, D. Core warehouse metadata. ANSWER: B maps the core warehouse metadata to business concepts, uniliar and useful to end A. Application level metada B. User level metadata. CC. Enduser level metadata. D. Core level metadata. ANSWER: A 2of 34 8/20/2013 2:47 PN30f 34 14,____ consists of formal definitions, such as a COBOL layout or a database schema. A. Classical metadata. B. Transformation metadata. C. Historical metadata. D. Structural metadata, ANSWER: A. 15, consists of information in the enterprise that is not in classical form. A. Mushy metadata B. Differential metadata C. Data warehouse. D, Data mining, ANSWER: A 16. databases are owned by particular departments or business A. Informational B. Operational. G. Bpth informational and operational ANSWER: B 17. The star schema is composed of ___ fact table. A.one, B. two. C. three. D. four. ANSWE! 18, The time horizon in operational environment is A. 30-60 days, B. 60-90 days C. 90-120 days. D. 120-150 da ANSWER: B 19. The key used in operational environment may not have an element of. A. time Boo 6 an ANSWER: A. 20, Data can be updated in A. data warehouse. B. data mining. C. operational. D. informational. ANSWER: C environment. 21. Record cannot be updated in _ A. OLTP. B. files C. RDBMS 8/20/2013 2:47 PN4o0f34 D. data warehouse ANSWER: D 22. The source of all data warehouse data is the. A. operational environment. B. informal environment. C. formal environment. D. technology environment. ANSWER: A 23. Data warehouse contains _ data that is never found in the operational environment. A. normalized. B. informational. C. summary. D. denormalized. ANSWER: C -y between the environments results in less than percent. ANSWER: A 25. Bill Inmon has estimated_ of the time required to build a data warehouse, is consumed in the conversion proc A. 10 percent. B. 20 percent. C. 40 percent D. 80 percent. ANSWER: D 26. Detail data in single fact table is otherwise known as. A. monoatomie dat B. diatomic data. C. atomie data, D. multiatomic data. 2x_-x4EGAlest iS used in an online transactional processing environment B. MICRO. ©. MACRO. D. ACID. ANSWER: D 28, is a good alternative to the star schema, A. Star schema, B. Snowdlake schema, C. Fact constellation. D, Star-snowflake schema, ANSWER: C 29. The biggest drawback of the level indicator in the classic star-schema is that it limits 8/20/2013 2:47 PNSof 34 A. quantify B. qualify. C. flexibility D. ability. ANSWER: C 30. A data warehouse is. A. updated by end users B. contains numerous naming conventions and formats C. organized around important subject areas. D, contains only current data. ANSWER: C 31. An operational system is A. used to nun 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: B 32. The generic two-level data warehouse architecture includes __ ‘A. at Teast one data mart. B. data that can extracted from numerous i CC. near real-time updates. D. far real-time updates. ANSWER: C ternal and external sources. 33. 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: D 34. Reconciled data is _ ‘A. data stored in the various operational systems throughout the organization B. current data intended to be the single source for all decision support systems. C. data stored in one operational system in the organization. D. data that has been selected and formatted for end-user support applications. ANSWER: B 35, Transient data is A. data in which chi eliminated. B. data in which changes to existing records do not cause the previous version of the records to be climinated. C. data that are never altered or deleted once they have been added. D. data that are never deleted once they have been added. ANSWER: A nges to existing records cause the previous version of the records to be 36. The extract process is ‘A. capturing all of the data contained in various operational systems. B. capturinga subset of the data contained in various operational systems. C. capturing all of the data contained in various decision support systems. 8/20/2013 2:47 PN60f 34. D. capturing subset of the data contained in various decision support systems. ANSWER: 37. Data scrubbing is ‘A. a process to reject data from the data warehouse and to create the necessary indexes. B. a process to load the data in the data warehouse and to create the necessary indexes, C. a process to upgrade the quality of data after it is moved into a data warehouse. D. a process to upgrade the quality of data before it is moved into a data warehouse ANSWER: D 38. The load and index is . A. a process to reject data from the data warehouse and to create the necessary indexes. B. a process to load the data in the data warehouse and to create the necessary indexes, C. a process to upgrade the quality of data after it is moved into a data warehouse. D. a process to upgrade the quality of data before it is moved into a data warehouse. ANSWER: B 39, Data transformation include BE BrOSSSS 1S SHANKS Gata Homa Sttinady Tevel to SUCUAEN ISVS C. joining data from one source into various sources of data. D. separating data from one source into various sources of data. ANSWER: A 40. is called a multifield transformation, A. Converting data from one field into multiple fields. B. Converting data from fields into field, CC. Converting data from double fields into multiple fields. D. Converting data from one field to one field. ANSWER: A. 1. The type of relationship in star schema is, ‘A. many-to-many. B. one-to-one. CC. one-to-many. D. many-to-one. ANSWER: C 42. Fact tables are 8: SAARI Race! C. completely normalized. D. partially normalized. ANSWER: C 43, is the goal of data mining. A. To explain some observed event or condition. B, To confirm that data exists. C. To analyze data for expected relationships. D. To create a new data warehouse. ANSWER: A 44, Business Intelligence and data warehousing is used for A. Forecasting. 8/20/2013 2:47 PNB. Data Mining. C. Analysis of large volumes of product sales data. D. Allof the above. ANSWER: D 45. The data administration subsystem helps you perform all of the follow A. backups and recovery. B. query optimization. C. security management, D. create, change, and delete information. ANSWER: D except, 46. The most common source of change data in refreshing a data warehouse is _ A. queryable change data. B. cooperative change data. CC. logged change data. D. snapshot change data. ANSWER: A 47. __ are responsible for running queries and reports against data warehouse tables. A. Hardware. B. Software. C. End users. D. Middle ware ANSWER: C 48. Query tool is meant for A. data acquisition, B. information delivery. C. information exchange. D. communication. ANSWER: A 49. Classification rules are extracted from A. root node. B. decision tree. C. siblings. D. branches, ANSWER: B 50, Dimensionality reduction reduces the data set size by removing __ A. relevant attributes. B. irrelevant attributes, C. derived attributes, D. composite attributes. ANSWER: B 31 is a method of incremental conceptual clustering. A. CORBA. B. OLAP. C. COBWEB. D. STING, ANSWER: C 8/20/2013 2:47 PN8 of 34 52. Effect of one attribute value on a given class is independent of values of other attribute is called A. value independence. B. class conditional independence. C. conditional independence D. unconditional independence. ANSWER: A 53. 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: C 54. Maintenance of cache consistency is the limitation of A. NUMA. B. UNAM. 6. BRB: ANSWER: C 55. Data warehouse architecture is based on _ A. DBMS. B. RDBMS. C. Sybase. D. SQL Server. ANSWER: B 56. Source data from the warehouse comes from _. A. ODS. B. TDS. C. MDDB. D. ORDBMS. ANSWER: A 57. __ isa data transformati n process, A. Comparison. B. Projection. £5. Balestin ANSWER: D 58. The technology area associated with CRM is A. specialization, B. generalization. ation. ANSWER: C 59. SMP stands for ‘A. Symmetric Multiprocessor. B, Symmetric Multiprogramming, C. Symmetric Metaprogramming. 8/20/2013 2:47 PND. Symmetric Microprogramming ANSWEI 60. __ are designed to overcome any limitations placed on the warehouse by the nature of the relational data model A. Operational database. B. Relational database. CC. Multidimensional database. D. Data repository. ANSWER: 61 relational data model. ‘A. Operational database. B. Relational database. C. Multidimensional database. D. Data repository. ANSWER: C 62. MDDB stands for A. multiple data doubling, B. multidimensional databases. C. multiple double dimension. D. multi-dimension doubling ANSWER: B 63, is data about data. A. Metadata. B. Microdata C. Minidata. D. Multidata. ANSWEI 64. ___ is an important functional component of the metadata. A. Digital directory. B. Repository. C. Information directory D. Data dictionary ANSWER: C 65. EIS stands for A. Extended interface system. B, Executive interface system. C. Executive information system. D. Extendable information system. ANSWER: C 66. is data collected from natural systems. A. MRI sean. B. ODS data. C. Statistical data, D. Historical data. ANSWER: A 9 of 34 ire designed to overcome any limitations placed on the warehouse by the nature of the 8/20/2013 2:47 PN10 of 34 is an example of application development environments. A. Visual Basic. B. Oracle. C. Sybase. D. SQL Server. ANSWER: A 68. The term that is not associated with data cleaning process is A. domain consistency. B. deduplication. C. disambiguation. D, segmenta ANSWER: D 69. are some popular OLAP tools. A. Metacube, Informix. B. Oracle Express, Essbase. C. HOLAP. ARR 70. Capability of data mining is to build models. A. retrospective. B. interrogative. C. predictive. D. imperative. ANSWER: C 7 is a process of determining the preference of customer's majority A. Association. B. Preferencing. C. Segmentation D. Classification. ANSWER: B 72. Strategic value of data mining is A. cost-sensitive B. work-sensitive C. time-sensitive, ARSWRRE gh-sensitive. 73. proposed the approach for data integration issues. A. Ralph Campbell. B. Ralph Kimball. C. John Raphlin. D. James Gosling. ANSWER: B 74, The terms equality and roll up are associated with _ A. OLAP. B. visualization. CC. data mart D. decision tree. 8/20/2013 2:47 PNlof34 hutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. ANSWER: C 75. Exceptional reporting in data warehousing is otherwise called as A. exception. B. alerts. C. errors. D. bugs. ANSWER: B 76, is a metadata repository. A. Prism solution directory manager. B. CORBA. C. STUNT. D. COBWEB. ANSWER: A 71. is an expensive process in building an expert system. A. Analysis. B. fudy, esti. D. Information collection. ANSWER: D 78. The full form of KDD is A. Knowledge database. B, Knowledge discovery in database. C. Knowledge data house. D. Knowledge data definition, ANSWER: B 79. The first International conference on KDD was held in the year A. 1996, B. 1997. C. 1995. D. 1994, ANSWER: C 80. Removing duplicate records is a process called A. recovery. B: data cleanan, D. data pruning. ANSWER: sl contains information that gives users an easy-to-understand perspective of the information stored in the data warehouse. ‘A. Business metadata. B, Technical metadata. C. Operational metadata, D. Financial metadata. ANSWER: A 82, system, helps to integrate, maintain and view the contents of the data warehousing 8/20/2013 2:47 PNA. Business directory. B. Information directory. C. Data dictionary D. Database. ANSWER: B 83. Discovery of cross-sales opportunities is called A. segmentation. B. visualization, C. correction. D, association ANSWE! 84, Data marts that incorporate data mining tools to extract sets of data are called A. independent data mart. B. dependent data marts, C. intra-entry data mart, D. inter-entry data mart. ANSWER: B 85. can generate programs itself, enabling it to carry out new tasks. A. Automated system. B. Decision making system. C. Self-learning system. D. Productivity system. ANSWER: D 86. The power of self-leaming system lies in A.cost. B. speed, C. accuracy D. simplicity. ANSWER: C 87. Building the informational database is done with the help of A. transformation or propagation tools. B. transformation tools only. C. propagation tools only. D. extraction tools. ANSWER: A 88. How many components are there in a data warehouse? A.owo, B. three. C. four D. five. ANSWER: D 89. Which of the following is not a component of a data warehouse? A. Metadata, B. Current detail data. C. Lightly summarized data. D. Component Key. ANSWER: D 8/20/2013 2:47 PN13 of 34 hutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. 90, __is data that is distilled from the low level of detail found at the current detailed leve. A. Highly summarized data. B. Lightly summarized data. C. Metadata. D. Older detail data. ANSWER: B 91. Highly summarized data is ‘A. compact and easily accessible. B. compact and expensive. C. compact and hardly accessible. D. compact. ANSWER: A 92. 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. 6: Utara data. ANSWER: C 93. Metadata contains atleast _ A. the structure of the data. B. the algorithms used for summarization. C. the mapping from the operational environment to the data warehouse. D. all of the above. ANSWER: D 94, Which of the following is not a old detail storage medium? A. Phot Optical Storage. B. RAID. C. Microfinche. D. Pen drive. ANSWER: D 95. The data from the operational environment enter _ of data warehouse. A. Current detail data. B. Older detail data. 5, Heghily SHRMRIZSG aa: ANSWER: A 96. The data in current detail level resides till___ event occurs. A. purge, B. summarization C. archieved, D. all of the above. ANSWER: D 97. The dimension tables describe the ___ A. entities, B. facts. C. keys, 8/20/2013 2:47 PN14 0f 34 D. units of measures. ANSWEI 98. The granularity of the fact is the __ of detail at which it is recorded. A. transformation. B. summarization. C level, D. transformation and summa ANSWER: C ization, 99, Which of the following is not a primary grain in analytical modeling? A. Transaction. B. Periodic snapshot C. Accumulating snapshot. D. Allof the above. ANSWER: B 100. Granularity is determined by 8: RURREE PRE, C. both A and B. D. none of the above. ANSWER: C 101 of data means that the attributes within a given entity are fully dependent on the entire primary key of the entit A. Additivity B, Granularity. C. Functional dependeney D. Dimensionality. ANSWER: C 102. A fact is said to be fully additive if A. it is additive over every dimension of its dimensionality. B. additive over atleast one but not all of the dimensions. CC. not additive over any dimension. D. None of the above. ANSWER: A TOA. act itis 0. AEN ofits dimensionatity, B. additive over atleast one but not all of the dimensions. C. not additive over any dimension. D. None of the above. ANSWER: B additive over every dimension of its dimensionality. B. additive over atleast one but not all of the dimensions. C. not additive over any dimension D. None of the above. ANSWER: C 105. Non-additive measures can often combined with additive measures to create new 8/20/2013 2:47 PN15 of 34 A. additive measures. B. non-additive measures. C. partially additive, D. Allof the above. ANSWER: A 106. A fact representing cumulative sales units over a day at a store for a product is a A.additive fact. B. fully additive fac C. partially additive fact D, non-additive fact. ANSWEI 107. of data means that the attributes within a given entity are fully dependent on the entire primary key of the entity. A. Additivity B. Granularity, C. Functional Depende: ARRIE RE 108. Which of the following is the other name of Data mining? A. Exploratory data analysis, B. Data driven discove C. Deductive learning. D. Allof the above. ANSWER: D 109. Which of the following is a predi A. Clustering. B, Regression. C. Summatization. D. Association rules, ANSWER: B ive model? 110. Which of the following is a descriptive model? A. Classification. B. Regression. iscovery. gion rules, model identi pattems or relationships. A. Descriptive. B. Predictive C. Regression. D. Time series analysis ANSWER: A 112. A predictive model makes use of A. current data, B. historical data. C. both current and historical data. D. assumptions, 8/20/2013 2:47 PNhutp://grdmegontine/printap.php theading: M M.Se(IT) [2012-2014], Se. ANSWER: B 113 maps data into predefined groups. A. Regression. B, Time series analysis C. Prediction. D. Classification. ANSWER: D 114,____is used to map a data item to a real valued prediction variable. A. Regression. B. Time series analysis C. Prediction. D. Classification. ANSWER: B 115. In . the value of an attribute is examined as it varies over time. A. Regression. B. Time series analy Sequence discover D. Prediction ANSWEI 116.In _ the groups are not predefined. A. Association rules. B, Summatization, C. Clusteri D. Prediction. ANSWER: C B. association rules. C. both A & B. D. Prediction, ANSWER: C 118 is a the input to KDD, A. Data. B: bylergration. D, Process. ANSWER: A 119. The output of KDD is A. Data. B. Information. C. Query. D, Useful information, ANSWER: D 120. The KDD process consists of steps. A. three. B. four 16 of 34 8/20/2013 2:47 PN17 0f34 C. five, D. six. ANSWER: C 121. Treating incorrect or missing data is called as A. selection. B. preprocessing C. transformation, D. interpretation. ANSWER: B 122. Converting data from different sources into a common format for processing is called as A. selection. B. preprocessing. C. transformation. D. interpretation. ANSWER: C 123. Various visua ‘A. selection, B. transformaion. C. data mini D. interpretation. ANSWER: D zation techniques are used in step of KDD. 124, Extreme values that occur infrequently are called as A. outliers. B. rare values C. dimensionality reduction. D. Allof the above. ANSWER: A 125. Box plot and scatter diagram techniques are __ A. Graphical. B. Geometric. C. Ieon-based. D. Pixel-based. ANSWER: B 124 is used (0 proceed from very specific knowledge to more general information, B. Compression. C. Approximation. D. Substitution, ANSWER: A 127. Describing some characteristics of a set of data by a general model is viewed as, A. Induction. B, Compression. C. Approximation. D. Summarization. ANSWER: B 128, helps to uncover hidden information about the data. 8/20/2013 2:47 PN18 of 34 confiden A. Induction. B. Compression. C. Approximation. D. Summarization. ANSWER: C 129. are needed to identify training data and desired results. A. Programmers. B, Designers. C. Users. D. Administrators. ANSWER: C 130. Overfitting occurs when a model A. does fit in future states. B. does not fit in future states, C. does fit in current state. D. does not fit in current state. ANSWER: B 131. The problem of dimensionality curse involves A. the use of some attributes may interfere with the correct completion of a data mining task. B. the use of some attributes may simply increase the overall complexity. C. some may decrease the efficiency of the algorithm. D. Allof the above. ANSWER: D 132. Incorrect or invalid data is known as _ A. changing data. B. noisy data C. outliers. D. missing data ANSWER: B 133. ROT is an acronym of A. Return on Investment. B, Return on Information. C. Repetition of Information. D. Runtime of Instruction ANSWER: A. 134. The _ of data could result in the disclosure of information that is deemed to be A. authorized use. B. unauthorized use. C. authenticated use. D. unauthenticated use. ANSWER: B 135 data are noisy and have many missing attribute values. A. Preprocessed. B. Cleaned. C. Real-world, D. Transformed. 8/20/2013 2:47 PN19 of 34 hutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. ANSWER: C 136. The rise of DBMS occurred in early A. 1950's. B. 1960's C.1970's D. 1980's. ANSWER: C 137. SQL stand for A. Standard Query Language. B, Structured Query Language. C. Standard Quick List. D. Structured Query list. ANSWER: B 138. Which of the following is not a data mining metric? A. Space complexity. B. figy complensty. D. Allof the above. ANSWER: D 139, Reducing the number of attributes to solve the high dimensionality problem is called as A. dimensionality curse. B, dimensionality reduction. C. cleaning, D. Overfitting. ANSWER: B 140, Data that are not of interest to the data mining task is called as _. A. missing data. B. changing data. C. irrelevant data. D. noisy data ANSWER: C 41 are effective tools to attack the scalability problem. A. Sampling. B. Bosalatigegon D. None of the above. ANSWER: C 142. Market-basket problem was formulated by A. Agrawal et al. B. Steve et al C. Toda et al. D. Simon et al. ANSWER: A. 143, Data mining helps in A. inventory management. B. sales promotion strate; 8/20/2013 2:47 PN20 of 34 hutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. C. marketing strategies. D. Allof the above. ANSWER: D 144. The proportion of transaction supporting X in T is called A. confidence. B. support. C. support count, D. Allof the above. ANSWER: B 145. The absolute number of transactions supporting X in T is called A. confidence. B. support. CC. support count. D. None of the above. ANSWER: C 146. Th ‘A. contd B. support. C. support count. D. None of the above. ANSWER: A we that says that transactions in D that support X also support Y is called ee 147. If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam, Then the support of bread and jam i A.2% B. 20% C.3% D. 30% ANSWER: A 148. 7 If T consist of 500000 transactions, 20000 transaction contain bread, 30000 transaction contain jam, 10000 transaction contain both bread and jam. Then the confidence of buying bread with jam is 334 B. 66.66% C.45% ARsWir: D 149. The left hand side of an association rule is called A. consequent. B. onset. C. antecedent. D. precedent. ANSWER: C 150, The right hand side of an association rule is called A. consequent. B. onset. C. antecedent. D. precedent. 8/20/2013 2:47 PNANSWER: A 151. Which of the following is not a desirable feature of any efficient algorithm? A. to reduce number of input operations. B. to reduce number of output operations. C. to be efficient in computing. D. to have maximal code length ANSWER: D All set of items whose support is greater than the user-specified minimum support are called as A. border set. B. frequent set. CC. maximal frequent set. D. lattice. ANSWER: B 153. Ifa set is a frequent set and no superset of this set is a frequent set, then itis called : puayimal frequent set : border set C. lattice. D. infrequent sets. ANSWER: A 154, Any subset of a frequent set is a frequent set. This is A. Upward closure property B, Downward closure property. CC. Maximal frequent set. D. Border set. ANSWE! 155. 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: C 156. If an itemset is not a frequent set and no superset of this is a frequent set, then it is A: Nraigpalfieauent set CC. Upward closure property D, Downward closure property. ANSWER: B 157. A priori algorithm is otherwise called as A. width-wise algorithm. B. level-wise algorithm, C. pincer-search algorithm, D. FP growth algorithm, ANSWER: B 158. The A Priori algorithm is a A. top-down search 21 of 34 8/20/2013 2:47 PNB. breadth first search. C. depth first search. D. bottom-up search. ANSWEI 159, The first phase of A Priori algorithm is A. Candidate generation B. Itemset generation. C. Pruning D. Partitioning ANSWER: A 160. The second phaase of A Priori algorithm is ‘A. Candidate generation B. Itemset generation. C. Pruning. D. Partitioning. ANSWER: C 161. The __ step eliminates the extensions of (k-1)-itemsets which are not found to be frequent, from being considered for counting support. A. Candidate generation. B. Pruning. C. Partitioning. D. Itemset eliminations. ANSWER: B 162. The a priori frequent itemset discovery algorithm moves _ in the lattice. A. upward, B. downward. C. breadthwise. D. both upward and downward. ANSWER: A 163. After the pruning of a priori algorithm, will remain. A. Only candidate set. B. No candidate set. C. Only border set. D. No border set. ANSWER: B 164. The number of iterations in a priori _ A. increases with the size of the maximum frequent set B. decreases with increase in size of the maximum frequent set. C. increases with the size of the data, D. decreases with the increase in size of the data. ANSWER: A 165. MFCS is the acronym of __. ‘A, Maximum Frequency Control Set B. Minimal Frequency Control Set. C. Maximal Frequent Candidate Set. D, Minimal Frequent Candidate Set. ANSWER: C 8/20/2013 2:47 PN23 of 34 A. Binet al B. Argawal et at. C. Toda et al. D. Simon et at. ANSWER: A 166. Dynamuc Itemset Counting Algorithm was proposed by 167. Itemsets in the category of structures have a counter and the stop number with them. A. Dashed. B. Circle. C. Box. D. Solid. ANSWER: A 168. The itemsets in the category structures are not subjected to any counting A. Dashes. B. Box. 5. tite ANSWER: C 169. Certain itemsets in the dashed circle whose support count reach support value during an iteration move into the A. Dashed box. B, Solid circle. C. Solid box, D. None of the above. ANSWER: A. 170. Certain itemsets enter afresh into the system and get into the ___. which are essentially the supersets of the itemsets that move from the dashed circle to the dashed box. A. Dashed box. B. Solid circle. C. Solid box. D. Dashed circle. ANSWER: D 171. The itemsets that have completed on full pass move from dashed circle to 8 Rabedbes: C. Solid box. D. None of the above. ANSWER: B 172. The FP- wth algorithm has phases. ANSWER: B 173. A frequent pattern tree is a tree structure consisting of __ ‘A. an item-prefix-tree. 8/20/2013 2:47 PN24 of 34 hutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. B. a frequent-item-header table. C. a frequent-item-node, D. both A&B. ANSWER: D 174. The non-root node of item-prefix-tree consists of __ fields. A. two. B. three. C. four. D. five, ANSWER: B 175. The frequent-item-header-table consists of _ fields, A. only one. B. two, C. three. D. four. ANSWER: B 176. The paths from root node to the nodes labelled 'a' are called A. transformed prefix path, B. suffix subpath. C. transformed suffix path. D. prefix subpath. ANSWER: D 177. The transformed prefix paths of a node ‘a form a truncated database of pattern which co-occur with a is called A, suffix path B. FP-tree. C. conditional pattern base. D. prefix path ANSWER: C 178. 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: C 179. Which of the following is a clustering algorithm? A.A priori. B. CLARA. C. Pincer-Search. D. FP-growth. ANSWER: B 180. clustering technique start with as many clusters as there are records, with each cluster having only one record. A. Agglomerative. B. divisive. C. Partition. D. Numeric. 8/20/2013 2:47 PN25 of 34 hutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. ANSWER: A 181,___clustering techniques starts with all records in one cluster and then try to split that cluster into small pieces. A. Agglomerative. B. Divisive. C. Partition. D. Numeric. ANSWER: B 182. Which of the following is a data set in the popular UCI machine-learning repository? A. CLARA, B. CACTUS. C. STIRR. D. MUSHROOM. ANSWER: D 183. In algorithm cach cluster is represented by the center of gravity of the cluster. f Emedeia. “means C.STIRR. D. ROCK. ANSWER: B 184. In each cluster is represented by one of the objects of the cluster located near the center. A. k-medoid. B, k-means. C. STIRR. D. ROCK. ANSWER: A 185. Pick out a k-medoid algoithm. A. DBSCAN. B. BIRCH. C. PAM. D. CURE. ANSWER: C 184, Rigkget{ hierarchical clustering algorithm, B. BIRCH, C. PAM. D. CURE. ANSWER: A 187. CLARANS stands for A. CLARA Net Server. B. Clustering Large Application RAnge Network Search. C. Clustering Large Applications based on RANdomized Search D, CLustering Application Randomized Search. ANSWER: 188. BIRCH is a 8/20/2013 2:47 PN26 of 34 ‘A. agglomerative clusterii B. hierarchical algorithm, C. hierarchical-agglomerative algorithm, algorithm, ANSWER: C 189. The cluster features of different subclusters are maintained in a tree called A. CFure. B. FP tree C. FP growth tree. D. Bree. ANSWEI 190. The ___algorithm is based on the observation that the frequent sets are normally very few in number compared to the set of all itemsets. A.A priori B, Clustering. C. Association rule. ANSARI 191. The partition algorithm uses _ A.two. B. four C. six. D. eight. ANSWER: A scans of the databases to discover all frequent sets. 192. 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: A 193 is the most well known association rule algorithm and is used in most commercial products, A. Apriori algorithm. B. Bicthiandlsegeatim: D. Pincer-search algorithm. ANSWER: 194. An algorithm called_ is used to generate the candidate item sets for each pass after the first. A. apriori B. apriori-gen. C. sampling, D. partition, ANSWER: B 195, The basic partition algorithm reduces the number of database scans to _ & divides it into partitions, 8/20/2013 2:47 PN27 of 34 A. one, B. two. C. three. D. four. ANSWER: B 196, and prediction may be viewed as types of classification, A. Decision, B. Verification, C. Estimation. D. Illustration. ANSWER: C 197. can be thought of as classifying an attribute value into one of a set of possible classes. A. Estimation. 198, Prediction can be viewed as forecasting a__value. A. non-continuous. B. constant. C. continuous, D. variable. ANSWER: C 199, ____data consists of sample input data as well as the classification assignment for the data, ‘A. Missing. B. Measuring. C. Non-training. D. Training. ANSWER: D 200. Rule based classification algorithms generate rule to perform the classification, A. if-then. B. while, C. do while. ARSWHERY A 201 are a different paradigm for computing which draws its neuroscience. A. Computer networks. B. Neural networks. C. Mobile networks. D. Antificial networks. ANSWER: B piration from 202. The human brain consists of a network of A. neurons. B. cells. C. Tissue, 8/20/2013 2:47 PN28 of 34 hutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. D. muscles ANSWER: A 203. Each neuron is made up of a number of nerve fibres called _ A. electrons. B. molecules. C. atoms, D. dendrites. ANSWER: D 204. The is a long, single fibre that originates trom the cell body. A. axon. B. neuron, C. dendrites. D. strands. ANSWER: A 205. A single axon makes of synapses with other neurons. 8: futieas. C. thousands. D. millions. ANSWER: C 206, is a complex chemical process in neural networks A. Receiving process. B, Sending proc C. Transmission process, D. Switching process. ANSWER: C 207,___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: D 208. are highly simplified models of biological neurons. 8: QSAIELASHEPREurons. C. Biological neurons. D. Technological neurons. ANSWER: 209. The biological neuron’s _ is a continuous function rather than a step function. A. read. B. write. C. output. D. input ANSWER: C 210, The threshold function is replaced by continuous functions called __ A. activation, functions. 8/20/2013 2:47 PN20 of 34 hutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. B. deactivation. C. dynamic D. standard. ANSWER: A 211. The sigmoid function also knows as functions. A. regression, B. logistic. C. probability. D. neural ANSWER: B 212. MLP stands for A. mono layer perception. B. many layer perception. C. more layer perception D. multi layer perception. ANSWER: D 213. Ina feed- forward networks, the conneetions between layers are output. A. bidirectional. B. unidirectional. C. multidirectional. D. directional. ANSWER: B 214. The nevwork topology is constrained to be eedforward. eedbackward. ved free. ved busy, ANSWER: A 4.7 Ate B. fi Cf Dit 215. RBF stands for A. Radial basis function, B. Radial bio function C. Radial big function. D. Radial bi function. ANSWER: A. 216. RBF have only hidden layer. A. four. B. three. C. two. D. one, ANSWER: D 217. RBF hidden layer units have a receptive field which has a value at which they have a maximal output A.top. B. bottom, C. centre. D. border. __ from input to ; that is, a particular input 8/20/2013 2:47 PNhutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. ANSWER: C 218,____training may be used when a clear Tink between input data sets and target output values does not exist. A. Competitive. B. Perception. C. Supervised. D. Unsupervised. ANSWER: D 219. employs the supervised mode of learning. A.RBF, B. MLP. C. MLP & RBF. D. ANN. ANSWER: C 20. design involves deciding on their centres and the sharpness of their Gaussians. # RRb. Cc. XOR. D. RBF. ANSWER: D 221 is the most widely applied neural network technique. A. ABC. B. PLM. C. LMP. D. MLP. ANSWER: D 222. SOM js an acronym of A. self-organizing map. in map. C. single organizing map. D. simple origin map. ANSWER: A 23. is one of the most popular models in the unsupervised framework. 8: 8RM. C. OSM. D. MSO. ANSWER: 224. The actual amount of reduction at each learning step may be guided by A. learning cost. B, leaming level. C. learning rate. D. learning time, ANSWER: C 225. The SOM was a neural network model developed b: A. Simon King. 30 of 34 8/20/2013 2:47 PNhutp://grdmegonline/printap.php%heading=Il M.Se(IT) [2012-2014], Se. B. Teuvokohonen. C. Tomoki Toda. 226. SOM was developed during A. 1970-80, B. 1980-90. C. 1990 -60. D. 1979-82, ANSWEI 227. Investment analysis used in neural networks is to predict the movement of __ from previous data A. engines. B. stock C. patterns. D. models ANSWER: B 228, SOMS are used to cluster a speci patient's drugs etc. A. physical B. logical C. medical D. technical. ANSWER: C dataset containing information about the 229. GA stands for A. Genetic algorithm B. Gene algorithm. C. General algorithm. D. Geo algorithm. ANSWER: A 230. GA was i A. 1955, B. 1965. ©. 1975. ARS ER: c roduced in the year 231. Genetic algorithms are search algorithms based on the mechanics of natural__ A. systems. B. genetics ANSWER: B 232. GAs were developed in the early A. 1970. B. 1960. C. 1950, D. 1940. 31 of 34 8/20/2013 2:47 PN32 of 34 hutp://grdmegontine/printap.php theading: ANSWER: A 233. The RSES system was developed in A. Poland. B. Italy. C. England. D. America. ANSWER: A 234. Crossover is used 10 A. recombine the population's genetic material. B. introduce new genetic structures in the population. C. to modify the population's genetic material D. Allof the above. ANSWER: A 235, The mutation operator A. recombine the population's genetic material, .jntrodce new genetic st tO modify the population D. Allof the above. ANSWER: B uctures in the population. genetic matetial 236. Which of the following is an operation in genetic algorithm? A. Inversion. B. Dominance. C. Genetic edge recombi D. Allof the above. ANSWER: D ion. 237, ____ is asystem created for rule induction. A. RBS, B. CBS C. DBS, D.LERS. ANSWER: D 238. NLP stands for A. Non Language Process. B. Natursibenghhege ripe. D, Natural Language Processing. ANSWER: D 239. Web content mining describes the discovery of useful information from the A. text. B. web. C. page. D. level. ANSWER: B 240. Research on mining multi-types of data is termed as_ data, A. graphics. B. multimedia. M M.Se(IT) [2012-2014], Se. contents, 8/20/2013 2:47 PN33 of 34 C. meta, D. digita ANSWER: B 241 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, ANSWEI 242,__is the way of studying the web link structure. A. Computer network. B. Physical network. C. Social network. D. Logical network. ANSWER: C 243. The ropose a measure of standing a node based on path counting ‘A. oper wep PrP Pi e B. close web. CC. link web, D. hidden web, ANSWER: B 244. In web mining, is used to find natural groupings of users, pages, A. clustering, B. association C. sequential analysis D. classification. ANSWER: A ete, 245. In web mining, is used to know the order in which URLs tend to be accessed A. clustering. B. associations. C. sequential analysis, D. classification ANSWER: C 246, yayehagiining. is used to know which URLs tend to be requested together, B. associations. C. sequential analysis, D. classification. ANSWER: B 247. describes the discovery of useful information from the web contents. A. Web content mining. B. Web structure mining. C. Web usage mining D, Allof the above. ANSWER: A 248, is concerned with discovering the model underlying the link structures of the web. 8/20/2013 2:47 PNA. Web content mining. B. Web structure mining. CC. Web usage mining. D. Allof the above. ANSWER: B 249. A link is said to be A. inti B. wansverse. 250. A link is said to be A. intrinsic. B. transverse. C. direct D. contrast. ANSWER: A link if it is between pages with different domain names. link if it is between pages with the same domain name. Statf Name LAXMLSREE.B.R.