Questions from Operating Systems

Q: The Fibonacci sequence is defined as follows: F0=0,

The Fibonacci sequence is defined as follows: F0=0, F1=1, Fn+2=Fn+1+Fn, n≥0 a. Could this sequence be used to establish a buddy system? b. What would be the advantage of this system over the binary bu...

Q: During the course of execution of a program, the processor will

During the course of execution of a program, the processor will increment the contents of the instruction register (program counter) by one word after each instruction fetch, but will alter the conten...

Q: Consider a simple paging system with the following parameters: 232 bytes

Consider a simple paging system with the following parameters: 232 bytes of physical memory; page size of 210 bytes; 216 pages of logical address space. a. How many bits are in a logical address? b. H...

Q: Write the binary translation of the logical address 0001010010111010 under the following

Write the binary translation of the logical address 0001010010111010 under the following hypothetical memory management schemes, and explain your answer: a. A paging system with a 256-address page si...

Q: Consider a simple segmentation system that has the following segment table:

Consider a simple segmentation system that has the following segment table: / For each of the following logical addresses, determine the physical address or indicate if a segment fault occurs: a. 0,...

Q: Consider a memory in which contiguous segments S1, S2, …,

Consider a memory in which contiguous segments S1, S2, …, Sn are placed in their order of creation from one end of the store to the other, as suggested by the following figure: Whe...

Q: Consider the following ways of handling deadlock: (1)

Consider the following ways of handling deadlock: (1) banker’s algorithm, (2) detect deadlock and kill thread, releasing all resources, (3) reserve all resources in advance, (4) restart thread and...

Q: Now consider this correct solution to the preceding problem: /

Now consider this correct solution to the preceding problem: a. Explain how this program works and why it is correct. b. This solution does not completely prevent newly arriving processes from cuttin...

Q: Now consider another correct solution to the preceding problem: /

Now consider another correct solution to the preceding problem: a. Explain how this program works and why it is correct. b. Does this solution differ from the preceding one in terms of the number of...

Q: It should be possible to implement general semaphores using binary semaphores.

It should be possible to implement general semaphores using binary semaphores. We can use the operations semWaitB and semSignalB and two binary semaphores, delay and mutex. Consider the following: In...