Operating System



Item Name

A Burroughs B7000/B6000 MCP file can be tagged as sensitive

A Burroughs B7000/B6000 MCP file can be tagged as sensitive data. When such a file is deleted, its storage area is overwritten by some random bits. For what purpose would such a scheme be useful?

A certain computer provides its users with a virtual memory

A certain computer provides its users with a virtual memory space of 232 bytes. The computer has 218 bytes of physical memory. The virtual memory is implemented by paging, and the page size is 4,096 bytes. A user process generates the virtual address 11123456. Explain how the system establishes the corresponding physical location. Distinguish between software and hardware operations.

A CPU-scheduling algorithm determines an order for the execution

A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given n processes to be scheduled on one processor, how many different schedules are possible? Give a formula in terms of n.

A file is to be shared among different processes, each

A file is to be shared among different processes, each of which has a unique number. The file can be accessed simultaneously by several processes, subject to the following constraint: The sum of all unique do { while (TRUE) { flag[i] = want_in; j = turn; while (j != i) { if (flag [j] I= idle) { j = turn; else j = (j + 1) % n; } flag [i] j = 0; in_cs; while ( (j < n) && (j = = i || flag[j] !=...

A multimedia application consists of a set containing 100 images

A multimedia application consists of a set containing 100 images 10 minutes of video and 10 minutes of audio. The compressed sizes of the images video and audio are 500 MB 550 MB and 8 MB respectively. The images were compressed at a ratio of 15 : 1, and the video and audio were compressed at 200 : 1 and 10 : 1, respectively. What were the sizes of the images, video, and audio before compression?

A page-replacement algorithm should minimize the number of page

A page-replacement algorithm should minimize the number of page faults. We can achieve this minimization by distributing heavily used pages evenly over all of memory, rather than having them compete for a small number of page frames. We can associate with each page frame a counter of the number of pages associated with that frame. Then, to replace a page, we can search for the page frame with the...

A possible method for preventing deadlocks is to have a

A possible method for preventing deadlocks is to have a single, higher­ order resource that must be requested before any other resource. For example, if multiple threads attempt to access the synchronization objects A··· E, deadlock is possible. (Such synchronization objects may include mutexes, semaphores, condition variables, and the like.) We can prevent the deadlock by adding a sixth...

A Pthread program that performs the summation function was provi

A Pthread program that performs the summation function was provided in Section 4.3.1. Rewrite this program in Java.

A simplified view of thread states is Ready, Running, and

A simplified view of thread states is Ready, Running, and Blocked, where a thread is either ready and waiting to be scheduled, is running on the processor, or is blocked (i.e. is waiting for I/O.) This is illustrated in Figure. Assuming a thread is in the Running state, answer the following questions: (Be sure to explain your answer.) a. Will the thread change state if it incurs a page fault? If...

A single-lane bridge connects the two Vermont villages of North

A single-lane bridge connects the two Vermont villages of North Tunbridge and South Tunbridge. Farmers in the two villages use this bridge to deliver their produce to the neighboring town. The bridge can become deadlocked if a northbound and a southbound farmer get on the bridge at the same time (Vermont farmers are stubborn and are unable to back up.) Using semaphores, design an algorithm that...