A 2Q buffer replacement policy is managing a 3-frame buffer pool. The current state of the queues is: LRU Queue (ordered least recently used first → most recently used last): {1, 2} FIFO Queue (ordered oldest inserted first → newest inserted last): {5} The next page reference is 6.   What will be the new state of the queues after this access?  

Can using a separate mutex for each page in a buffer pool avoid deadlocks?  

#include #include struct MyStruct { MyStruct(int value) { if (value

In arithmetic algebra, if you add two integers (e.g., 3 + 5), the result is another integer (8). Hence, the set of integers is closed under addition.   Which statement about closure property in relational algebra is true?  

What happens when the database page size is smaller than the disk block size? (e.g., the database uses 1 KB pages but the disk has an 4 KB block size)

Why is a solid-state drive (SSD) classified as non-volatile memory?  

Why is DRAM considered volatile memory?  

In PostgreSQL, why is the default buffer pool size set low (128 MB)?  

2Q buffer replacement policy is managing a 3-frame buffer pool. The current state of the queues is: LRU Queue (ordered least recently used first → most recently used last): {1, 2} FIFO Queue (ordered oldest inserted first → newest inserted last): {9} The next page reference is 2.   What will be the new state of the queues after this access?  

std::rand() % user_ids.size()   What is the possible output range of the following C++ expression?