Mock Quiz Hub

Time: 00:00

Quiz

Navigate through questions using the controls below

Question 1 of 60 Quiz ID: q1

Which of the following best describes the relationship between speed, cost, and reliability in physical storage media classification?

Faster storage is always cheaper and more reliable

Storage speed increases with cost, while reliability varies by storage type

All storage types have similar cost-performance ratios

Reliability is inversely proportional to storage speed

Question 2 of 60 Quiz ID: q2

What is the key difference between volatile and non-volatile storage?

Volatile storage is faster than non-volatile storage

Volatile storage loses contents when power is switched off, non-volatile storage retains contents

Non-volatile storage is always more expensive than volatile storage

Volatile storage has unlimited write cycles, non-volatile storage has limited cycles

Question 3 of 60 Quiz ID: q3

Main memory typically has access times in the range of:

1 to 10 seconds

1 to 10 milliseconds

10s to 100s of nanoseconds

1 to 10 microseconds

Question 4 of 60 Quiz ID: q4

Which characteristic of flash memory makes it unsuitable for frequent updates?

It has slower read speeds than magnetic disks

It can only support a limited number (10K-1M) of write/erase cycles

It requires constant power to maintain data

It has higher cost per byte than main memory

Question 5 of 60 Quiz ID: q5

What is the typical capacity range of magnetic disks as mentioned in the lecture?

Up to 640 MB

Up to 1.5 TB as of 2009

Up to 100 GB

Up to 500 GB

Question 6 of 60 Quiz ID: q6

Which storage medium is described as 'write-once, read-many' (WORM)?

Magnetic tape

Flash memory

CD-ROM and certain optical disks

Main memory

Question 7 of 60 Quiz ID: q7

What is the primary disadvantage of tape storage compared to disk storage?

Lower capacity

Higher cost per byte

Sequential-access only, much slower than disk

Volatility - data is lost on power failure

Question 8 of 60 Quiz ID: q8

In the storage hierarchy, what are the three main levels?

Cache, RAM, ROM

Primary, secondary, tertiary storage

Volatile, semi-volatile, non-volatile

Fast, medium, slow storage

Question 9 of 60 Quiz ID: q9

In a magnetic disk, what is a sector?

A circular track on the platter surface

The smallest unit of data that can be read or written

The arm that positions the read-write head

A collection of multiple platters

Question 10 of 60 Quiz ID: q10

What does a cylinder consist of in a multi-platter disk system?

All sectors on a single track

The i-th track of all the platters

All tracks on a single platter

The collection of all read-write heads

Question 11 of 60 Quiz ID: q11

What are the two main components of disk access time?

Read time and write time

Seek time and rotational latency

Transfer time and processing time

Cylinder time and sector time

Question 12 of 60 Quiz ID: q12

What is the typical range for average seek time on modern disks?

1 to 3 milliseconds

4 to 10 milliseconds

10 to 20 milliseconds

20 to 50 milliseconds

Question 13 of 60 Quiz ID: q13

What does MTTF stand for in disk performance measures?

Maximum Time To Failure

Mean Time To Failure

Minimum Time To Failure

Median Time To Failure

Question 14 of 60 Quiz ID: q14

What is a block in the context of disk storage?

A single sector on a track

A contiguous sequence of sectors from a single track

An entire track on a platter

A complete cylinder across all platters

Question 15 of 60 Quiz ID: q15

What is the elevator algorithm used for?

Data compression on disks

Disk-arm-scheduling to minimize arm movement

Error correction in disk reads

Buffer management in main memory

Question 16 of 60 Quiz ID: q16

What is the advantage of using nonvolatile write buffers?

They increase disk capacity

They speed up disk writes by immediate buffering to non-volatile RAM

They reduce the number of read-write heads needed

They eliminate the need for error checking

Question 17 of 60 Quiz ID: q17

What does RAID stand for?

Rapid Access Independent Disks

Redundant Arrays of Independent Disks

Random Access Integrated Disks

Reliable Array of Inexpensive Drives

Question 18 of 60 Quiz ID: q18

What is the main goal of mirroring in RAID systems?

Increase storage capacity

Improve read performance only

Store extra information to rebuild data lost in disk failure

Reduce the number of disks needed

Question 19 of 60 Quiz ID: q19

In block-level striping, where does block i of a file go with n disks?

Disk i

Disk (i mod n) + 1

Randomly assigned disk

Always the first available disk

Question 20 of 60 Quiz ID: q20

Which RAID level offers the best write performance?

RAID 0

RAID 1

RAID 5

RAID 6

Question 21 of 60 Quiz ID: q21

What is the main disadvantage of RAID Level 4?

No fault tolerance

Too expensive to implement

Parity block becomes a bottleneck for independent block writes

Cannot handle multiple disk failures

Question 22 of 60 Quiz ID: q22

How does RAID Level 5 solve the bottleneck problem of RAID Level 4?

By eliminating parity completely

By using multiple parity disks

By partitioning data and parity among all N + 1 disks

By using faster disks for parity storage

Question 23 of 60 Quiz ID: q23

Why is RAID Level 3 not used anymore?

It's too expensive to implement

Bit-striping forces single block reads to access all disks, wasting disk arm movement

It doesn't provide adequate fault tolerance

It requires specialized hardware not commonly available

Question 24 of 60 Quiz ID: q24

In what type of environment is RAID Level 1 preferred over Level 5?

Low-cost storage environments

High update environments such as log disks

Read-only database applications

Applications with large amounts of data but low update rates

Question 25 of 60 Quiz ID: q25

What is the main characteristic of optical disk access compared to magnetic disks?

Faster seek time

Higher data transfer rates

Slower seek time (about 100 msec) due to heavier optical read head

More reliable under all conditions

Question 26 of 60 Quiz ID: q26

What is the capacity of a standard Blu-ray disk?

4.7 GB

17 GB

27 GB (54 GB for double sided)

640 MB

Question 27 of 60 Quiz ID: q27

What is the main use of magnetic tapes in modern database systems?

Primary storage for frequently accessed data

Backup and archival storage of infrequently used information

Real-time transaction processing

Index storage for fast data retrieval

Question 28 of 60 Quiz ID: q28

In fixed-length record organization, what happens when record i is deleted using the 'move records' approach?

The record is marked as deleted but not removed

Records i + 1, ..., n are moved to positions i, ..., n – 1

The last record is moved to position i

A pointer chain is created to link free records

Question 29 of 60 Quiz ID: q29

What is the advantage of using free lists for deleted records?

Faster deletion process

Better cache performance

More space efficient representation by reusing space for normal attributes

Simpler implementation

Question 30 of 60 Quiz ID: q30

What causes variable-length records in database systems?

Only storage of multiple record types in a file

Storage of multiple record types, variable length fields, and repeating fields

Only record types with variable length strings

Only record types with repeating fields

Question 31 of 60 Quiz ID: q31

In the slotted page structure, what does the header contain?

Only the number of record entries

Only the end of free space location

Number of record entries, end of free space, and location/size of each record

Only pointers to other pages

Question 32 of 60 Quiz ID: q32

Which file organization method is suitable for applications requiring sequential processing of the entire file?

Heap organization

Sequential organization

Hash organization

Clustered organization

Question 33 of 60 Quiz ID: q33

What is the main advantage of multitable clustering file organization?

Reduces storage space requirements

Stores related records on the same block to minimize I/O

Eliminates the need for indexing

Simplifies record insertion and deletion

Question 34 of 60 Quiz ID: q34

What type of information does the data dictionary (system catalog) store?

Only table and column names

Only user authentication data

Metadata including relation information, user data, statistical data, and physical organization

Only database performance statistics

Question 35 of 60 Quiz ID: q35

What is the primary goal of the buffer manager?

To increase disk storage capacity

To minimize the number of block transfers between disk and memory

To compress data before storage

To encrypt sensitive database information

Question 36 of 60 Quiz ID: q36

When does the buffer manager write a replaced block back to disk?

Always, regardless of whether it was modified

Never, data is lost when replaced

Only if it was modified since it was last written to/fetched from disk

Only when explicitly requested by the user

Question 37 of 60 Quiz ID: q37

Why can LRU (Least Recently Used) be a bad strategy for certain database access patterns?

It uses too much memory

It's too slow to implement

For repeated scans of data, like nested loop joins, it may not predict future references well

It doesn't work with variable-length records

Question 38 of 60 Quiz ID: q38

What is a pinned block in buffer management?

A block that is permanently stored in memory

A block that is not allowed to be written back to disk

A block that contains critical system information

A block that is currently being read from disk

Question 39 of 60 Quiz ID: q39

What is the main purpose of indexing in database systems?

To compress data for storage efficiency

To speed up access to desired data

To provide data encryption

To backup database information

Question 40 of 60 Quiz ID: q40

What are the two basic kinds of indices?

Primary and secondary indices

Dense and sparse indices

Ordered indices and hash indices

Clustered and non-clustered indices

Question 41 of 60 Quiz ID: q41

What is a primary index?

The first index created on a table

An index on the primary key only

An index whose search key specifies the sequential order of the file

The most frequently used index

Question 42 of 60 Quiz ID: q42

What characterizes a dense index?

It contains more data than the original file

Index record appears for every search-key value in the file

It only works with numerical data

It requires less storage space than sparse indices

Question 43 of 60 Quiz ID: q43

When is a sparse index applicable?

Only when records are randomly distributed

When records are sequentially ordered on search-key

Only for numerical search keys

When the file is very small

Question 44 of 60 Quiz ID: q44

What is the main advantage of sparse indices over dense indices?

Faster search times

Better for range queries

Less space and less maintenance overhead for insertions and deletions

Works with any file organization

Question 45 of 60 Quiz ID: q45

Why are multilevel indices used?

To handle multiple data types

When the primary index does not fit in memory, making access expensive

To support multiple users simultaneously

To provide backup indexing

Question 46 of 60 Quiz ID: q46

Why must secondary indices be dense?

They are faster than sparse indices

They require less maintenance

Because records are not sequentially ordered on the secondary index search key

They use less storage space

Question 47 of 60 Quiz ID: q47

What is the main disadvantage of using secondary indices for sequential scans?

They don't support range queries

Each record access may fetch a new block from disk, making it expensive

They require more memory than primary indices

They cannot be updated

Question 48 of 60 Quiz ID: q48

What is the main advantage of B+-tree index files over indexed-sequential files?

They use less storage space

They automatically reorganize with small, local changes for insertions and deletions

They are simpler to implement

They work only with numerical data

Question 49 of 60 Quiz ID: q49

In static hashing, what is a bucket?

A hash function parameter

A unit of storage containing one or more records

A type of search key

An indexing algorithm

Question 50 of 60 Quiz ID: q50

What causes bucket overflow in hash file organization?

Only insufficient buckets

Only skewed distribution of records

Both insufficient buckets and skewed distribution of records

Only hash function errors

Question 51 of 60 Quiz ID: q51

What are bitmap indices particularly suitable for?

Large text fields

Attributes that take on a relatively small number of distinct values

Numerical computations only

Primary key indexing

Question 52 of 60 Quiz ID: q52

What are the three basic steps in query processing?

Input, Process, Output

Parsing and translation, Optimization, Evaluation

Scanning, Sorting, Joining

Reading, Writing, Indexing

Question 53 of 60 Quiz ID: q53

What does the parser do during query processing?

Executes the query plan

Optimizes the query for performance

Checks syntax and verifies relations

Returns results to the user

Question 54 of 60 Quiz ID: q54

What is the main goal of query optimization?

To reduce memory usage

To choose the evaluation plan with lowest cost among all equivalent plans

To simplify the query syntax

To increase database security

Question 55 of 60 Quiz ID: q55

What is typically the predominant factor in measuring query cost?

CPU processing time

Memory usage

Disk access

Network communication

Question 56 of 60 Quiz ID: q56

What is a transaction in database systems?

A single SQL statement

A unit of program execution that accesses and possibly updates various data items

A database backup operation

A user login session

Question 57 of 60 Quiz ID: q57

What does the 'A' in ACID properties stand for?

Availability

Atomicity

Accessibility

Authentication

Question 58 of 60 Quiz ID: q58

What does the Isolation property ensure in ACID?

Transactions run faster when isolated

Each transaction must be unaware of other concurrently executing transactions

Transactions cannot access the same data

Only one transaction can run at a time

Question 59 of 60 Quiz ID: q59

What does the Durability property guarantee?

Transactions complete quickly

Data is never lost during processing

After a transaction completes successfully, changes persist even if there are system failures

Transactions can be rolled back at any time

Question 60 of 60 Quiz ID: q60

What is the purpose of concurrency control in database systems?

To speed up transaction processing

To ensure that concurrent transactions do not interfere with each other and maintain database consistency

To limit the number of users accessing the database

To encrypt data during transactions

Quiz Summary

Review your answers before submitting

Total Questions

Answered

Remaining

00:00

Time Spent

Quiz

Quiz Summary

Confirm Submission