Scribd
Upload
37 views2 pages

Quiz CS614 3

This document is a quiz for CS614 dated June 30, 2025, containing ten multiple-choice questions related to data anomalies, parallel operations, data representation, and time complexity. Each question tests knowledge on specific concepts in data handling and processing. The quiz aims to assess students' understanding of these topics.

Uploaded by

wardahsalam2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views2 pages

Quiz CS614 3

This document is a quiz for CS614 dated June 30, 2025, containing ten multiple-choice questions related to data anomalies, parallel operations, data representation, and time complexity. Each question tests knowledge on specific concepts in data handling and processing. The quiz aims to assess students' understanding of these topics.

Uploaded by

wardahsalam2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CS614 - Quiz No.

3 Date: 30 June 2025

Q.1 Which is not a class of anomalies in the following?


A. Semantically Dirty Data
B. Syntactically Dirty Data
C. Coverage Anomalies
D. Dirty Anomalies

Q.2 One of the preconditions to decide about operations to be parallelized is that:


A. Operations share same memory location
B. Output of one operation becomes input of other
C. Operations share same namespace
D. Operations can be implemented independent of each other

Q.3 _____ technique requires a separate column to specify the time and date when the last modification was
occurred.
A. RealTime extraction
B. TimeStamps
C. CheckMarks
D. Just-In-Time

Q.4 There are often multiple ways to represent the same piece of information. “FAST”, “National University”,
“FAST NU” and “Nat. Univ. of Computers “. This problem is known as_________________.
A. Composite key problem
B. Primary key problem
C. Simple key problem
D. Non primary key problem

Q.5 An optimized structure which is built primarily for retrieval, with update being only a secondary
consideration is
A. OLAP
B. OLTP
C. Inverted Index
D. DSS

Q.6 “More resources means proportionally less time for given amount of data”. The statement refers to:
A. Over-utilized system
B. Size-up
C. Speed-Up
D. Scale-Up

Q.7 Which of the following tasks can NOT be parallelized?


A. Creation of large indexes
B. Large table scans and joins
C. Partitioned index scans
D. None of the given options

Page 1
VU TOOLKIT BY PARADOXCIAL
CS614 - Quiz No.3 Date: 30 June 2025

Q.8 ________ is known as state of being only one of its kind or being without an equal or parallel.
A. Uniqueness
B. Completeness
C. Accessibility
D. Consistency

Q.9 Time Complexity of Key Creation process in basic Sorted Neighborhood (BSN) Method is ________.
A. O(2n)
B. O(log n)
C. O(n)
D. O(n log n)

Q.10 The data coming from outside the organization owning the DWH can have even ______________ quality data
i.e. different representation for same entity, transcription or typographical errors.
A. Average
B. Lower
C. Medium
D. Higher

Page 2
VU TOOLKIT BY PARADOXCIAL

You might also like