Buffer management in DBMS Theory - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding Buffer Replacement Policies

Which buffer replacement policy is best described as replacing the page that has not been used for the longest time?

A Least Recently Used (LRU)

B First-In-First-Out (FIFO)

C Most Recently Used (MRU)

D Clock Algorithm

💡 Hint

Think about which page has been idle the longest.

The Least Recently Used (LRU) policy replaces the page that has not been used for the longest time, assuming that pages used recently will likely be used again soon.

📋 Factual

intermediate

Buffer Pool Size Impact

What is the primary effect of increasing the size of the buffer pool in a database management system?

A Decreases the number of page faults

B Increases disk I/O operations

C Increases CPU usage significantly

D Decreases the size of the database

💡 Hint

Think about how more memory affects data access.

A larger buffer pool can hold more pages in memory, reducing the need to read from disk and thus decreasing page faults.

🔍 Analysis

advanced

Analyzing Buffer Pinning

In buffer management, what happens if a page is pinned in the buffer pool?

A The page is removed from the buffer pool

B The page is immediately written to disk

C The page cannot be replaced until it is unpinned

D The page is duplicated in the buffer pool

💡 Hint

Consider what pinning means for page replacement.

Pinning a page means it is in use and cannot be replaced until unpinned, ensuring data consistency during operations.

❓ Comparison

advanced

Comparing Dirty and Clean Pages

What is the key difference between a dirty page and a clean page in buffer management?

A Dirty pages are stored on disk; clean pages are only in memory

B Dirty pages are read-only; clean pages are writable

C Dirty pages are older than clean pages

D Dirty pages have been modified in memory but not written to disk; clean pages have not been modified

💡 Hint

Think about changes and disk synchronization.

Dirty pages contain changes not yet saved to disk, while clean pages match the disk content.

❓ Reasoning

expert

Effect of Buffer Management on Transaction Throughput

How does efficient buffer management improve transaction throughput in a database system?

A By increasing the number of transactions that require disk writes

B By reducing disk access latency, allowing faster data retrieval

C By forcing all transactions to wait for buffer availability

D By limiting the number of concurrent transactions

💡 Hint

Consider how memory caching affects speed.

Efficient buffer management keeps frequently accessed data in memory, reducing slow disk reads and improving transaction speed.