Answered: 1) What is the worst-case number of…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Consider implementing a stack in a computer that has a relatively small amount of fast primary
memory and a relatively large amount of slower disk storage. The operations PUSH and POP work
on single-word values. The stack can grow to be much larger than can fit in memory, and thus most
of it must be stored on disk.

One stack implementation strategy is to keep one block (size m) of the stack in memory, and use a
small amount of memory to keep track of which block is in the memory and a stack pointer to the
disk address of the top element of the previous block. You can perform a stack operation only if
the relevant disk block resides in memory. If necessary, you can write the block currently in
memory to the disk and read the new block from the disk into memory. If the relevant disk block
is already in memory, then no disk accesses are required.

Based on the above information, answer the following questions:

(1) What is the worst-case number of disk accesses required for n PUSH operations?
What is the CPU time?

(2) What is the worst-case number of disk accesses required for n stack operations? What
is the CPU time?

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions