Questions from Operating Systems

Q: An alternative algorithm for insertion into a B-tree is the

An alternative algorithm for insertion into a B-tree is the following: As the insertion algorithm travels down the tree, each full node that is encountered is immediately split, even though it may tur...

Q: Both the search and the insertion time for a B-tree

Both the search and the insertion time for a B-tree are a function of the height of the tree. We would like to develop a measure of the worst-case search or insertion time. Consider a B-tree of degree...

Q: Ignoring overhead for directories and file descriptors, consider a file system

Ignoring overhead for directories and file descriptors, consider a file system in which files are stored in blocks of 16K bytes. For each of the following file sizes, calculate the percentage of waste...

Q: What are the advantages of using directories?

What are the advantages of using directories?

Q: Directories can be implemented either as “special files” that can

Directories can be implemented either as “special files” that can only be accessed in limited ways or as ordinary data files. What are the advantages and disadvantages of each approach?

Q: Generalize Equations (1.1) and (1.2

Generalize Equations (1.1) and (1.2) in Appendix 1A to n-level memory hierarchies.

Q: What common events lead to the creation of a process?

What common events lead to the creation of a process?

Q: For the processing model of Figure 3.6, briefly define

For the processing model of Figure 3.6, briefly define each state. Figure 3.6:

Q: What does it mean to preempt a process?

What does it mean to preempt a process?

Q: What is swapping and what is its purpose?

What is swapping and what is its purpose?