Skip to main content

CS614 Current Final Term Fall 2013 Shared by Schaudhry File 2



My paper
Questions (5marks)
1. Describes Issue may occur during Data Acquisition & Cleansing in agriculture case study ?
2. Why pilot strategy is recommended for construction of DWH?
3. Five statements of different data mining techniques?
• Classifying credit applicants as low, medium, or high risk
• Classifying instructor rating as excellent, very good, good, fair, or poor
• Building a model and assigning a value from 0 to 1 to each member of the set.Then classifying the members into categories based on a threshold value.
• Predicting how much customers will spend during next 6 months.
• It is up to you to determine what meaning, if any, to attached to resulting clusters.
1. Which indexing technique is better for that query “SELECT * FROM R WHERE 0<= b and b<42” Questions (3 marks) 1. What are the tasks performed through import export wizard to load data? 2. The four categories of Data Quality Improvement write any three? 3. Write three  )LDrawbacks of traditional web searches? 4. (ek bhooooooool gea  Questions (2marks) 1. Two disadvantages of waterfall development methodology of data warehouse? 2. SSL stand for? 3. Write activity of development Kimball's life cycle model?
4. Is Data Mining uses statistical algorithms to discover patterns and regularities or not?

 

Comments

Popular posts from this blog

CS301 Current Finalterm Paper Spring 2014 Shared By M. Waleed

My Tday's Cs301 Paper: Mcq's Are From Moaz And Some Are From Handouts. Subjective Is From Moaz Majority One. 1- The Image Segmentation Define? 2- The Maximum Number Level Of Nodes In Binary Tree 3-The Iteration Array Have To Sort. 4- The Hapified Array Have To Solved 5- The Algorithm Of Binary Seaoh Tree 6-Sara Arrays Wala He Tha Ya Heap Wala. 7-....Wala Wala Wala...

CS614 Quiz No.3 Shared by Students (Solved), Spring 2014

______ index stores first value in each block in the sequential file and a pointer to the block.  Select correct option:   Dense  Sparse  B-Tree  Hash In context of data parallelism, the work done by query processor should be:  Select correct option:  Almost zero  Maximum  Pipelined  Filtered across partitions The optimizer uses a hash join to join two tables if they are joined using an equijoin and  Select correct option:   Outer table has less number of rows  Inner table has less number of rows  Cardinality of tables is equal  Large amount of data needs to be joined Bitmap index is appropriate for:  Select correct option:  Low cardinality data  High cardinality data  Clustered data  Aggregated data If a task takes “T” time units to execute on a single data item, then execution of this task on “N” data items will take __...

CS614 Quiz No.4 Shared by MT Khan (Solved)

Question # 1 of 10 ( Start time: 09:04:39 PM ) Total Marks: 1 A typical cycle of implementing the change in DWH comprises of the sequence: Select correct option: Production -> QA -> Development Development-> QA -> Production(CORRECT) Development -> Production -> QA Production -> Development -> QA Question # 2 of 10 ( Start time: 09:05:16 PM ) Total Marks: 1 Vertically wide data means: Select correct option: Dataset has large no. of attributes Dataset has large no. of records(CORRECT) Dataset has attribute skews Dataset has partitioning skews Question # 3 of 10 ( Start time: 09:05:43 PM ) Total Marks: 1 In ___________ phase of kimballs approach, we identify the components needed now and in future. Select correct option: Requirement definition Architectural design Product development Analytical application development Question # 4 of 10 ( Start time: 09:06:56 PM ) Total Marks: 1 Technical architecture design supports the communicat...