Skip to main content

CS614 Current Finalterm Paper Spring 2014 Shared By Maahi

Objective Was Too Much Easy And Almost From Moaz File..
Subjective:
1. What Is Web Data Warehouse? (2 Marks)
2. What Are The Four Issues Of Clickstream Data? (2 Marks)
3. Write First Two Phases Of Kimball's Aproach Of Business Dimensional Lifecycle. (2 Marks)
4. There Are Four Categories Of Data Quality Improvement. Write Any Two. (2 Marks)
5. Data Profiling Is A Process Which Involves Gathering Of Information. What Are The Purposes That It Must Fulfill? (3 Marks)
6. What Are The Drawbacks Of Traditional Web Searchers? (3 Marks)
7. Apply Run Length Encoding On The Given Code And Write Output. (3 Marks)
Case-I: 1111111110000111
Case-Ii: 00001111000000
8. Identify The Given Statement As Correct Or Incorrect And Justify Your Answer In Either Case. (3 Marks)
"One-Way Clustering Is Used To Get Local View And Two-Way Clustering Is Used To Get Global View."
9. A Pilot Project Strategy Is Highly Recommended In Data Warehouse. What Are The Reasons For Its Recommendation? (5 Marks)
10. Data Acquisition And Cleansing. (5 Marks)
11. A Table Was Given And Asked To Use Bitmap Indexes Technique And Make Index Tables For "Tickettype" And "Flightno". (5 Marks)
12. 1 Table Dia Hua Tha Us Mein Name, Item, Time Aur Gender Dia Hua Tha Aur Sath Ye Statement Di Hui Thi. (5 Marks)
If
 Items/Time >= 6
Then
 Gender= ‘F’
Else
 Gender = ‘M’
A) Find The Accuracy % Of Given Data.
B) If Name: Ali, Items: 2, Time: 14, Then Find The Gender Of Ali.
Remember Me In Ur Prayers. And Best Of Luck For Cs614 Paper..:)


Comments

Post a Comment

Please give us your feedback & help us to improve this site.

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...
1 comment
Read more

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 __...
Post a Comment
Read more

CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____ Select correct option: sorted linked list sorted binary trees        ok sorted linear array pointer array During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition. Select correct option: It will not have left child        ok It will not have right child It will not have both left and right children None of given options Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Select correct option: Input-restricted deque Output-restricted deque Priority queues        ok A BST generated from the data in ascending order is ____________. Select correct option: Linear Nonlinear Balanced        ok Un sorted In a program a reference variable, say x, can be declared as Sele...
1 comment
Read more