Virtual University of Pakistan

Spring 2025

CS614 – Data Warehousing

Assignment No.2 (Graded)

Maximum Marks: 20

Instructions                                                          Due Date: 24 June 2025

The purpose of this assignment is to give you hands-on practice. It is expected that students will solve the assignment themselves. The following rules will apply during the evaluation of the assignment.

●       Cheating from any source will result in zero marks in the assignment.

●       The submitted assignment does NOT open or the file is corrupted.

●       No assignment after the due date will be accepted.

●       Students can submit HTML, Images, and Plain text only in this inline Mode. The table can also be drawn in the interface.

●   The DOC/pdf File uploading option is unavailable for inline assignment submission.

Uploading Assignment Instruction

Follow the given instructions to submit the inline assignments.

•         Images of the following formats can be inserted in the inline assignment interface.

•         Images and tables can be inserted using the following highlighted options in the interface.

Objective & Learning Outcome                                                                

The objective of this assignment is to give:

●       Understand the Data Parallelism Concepts, Spatial Parallelism (Pipelining), Pipelining: Input vs. Speed-Up

●       This assignment blends theoretical understanding and real-world application of parallel processing concepts like data parallelism, pipelining, and partitioning.

Question No. 1                                                                               (15 Marks)

In an embassy, passport applications go through three processing stages:

1.      Verification of Documents

2.      Biometric Scanning

3.      Final Approval and Stamping

Each of these stages takes time T. Initially, the system processes applications sequentially, meaning that each of the three tasks is completed one after the other for a single application before the next one is started.

Now, the embassy implements a software-based pipeline where each stage is handled by a separate worker or system component. This allows for multiple applications to be processed simultaneously in a pipelined manner: while one application is being scanned biometrically, the next is having its documents verified, and the previous one is being stamped.

Consider the above scenario, calculate the following:

(A) Calculate the total time required to process:

20 applications in both sequential and pipelined executions (assume ideal conditions and equal time T per stage).

(B)  Calculate the Speed-Up factor of the process.

Speed-up =?

Question No. 2                                                                                (05 Marks)

The university's IT department is working on optimizing query performance in its student database. They are particularly interested in improving the speed of queries based on specific attributes such as Age.

To demonstrate the efficiency of bitmap indexing, a sample of five student records has been provided. The department has asked you, as a database intern, to construct bitmap indexes for the Age column and explore how these indexes can be used to process queries more efficiently.

Student Table:

Task:

Create a bitmap index for the value Age = 20 using a bit vector of length 5.

Submission Guidelines:

The assignment will be submitted as an inline assignment.

This assignment will cover the concepts discussed in lectures 23-27.

Note: Plagiarism will be checked for each question. Please answer the questions in your own words and marks will be awarded based on your answer and plagiarism report.

For any query about the assignment, contact at email CS614@vu.edu.pk