Consider the following snapshot of a system:A. How many instances of each resource type in the system? (2 points)B. What is the content of the matrix need? (2 points)C. Is the system in a safe state? Why? (3 points)D. If a request from Process P2 arrives for (0,1,0,0), can the request be granted immediately? (3 points)
查看答案
Consider the following segment table:What are the physical addresses for the following logical addresses?a) 0, 550b) 5, 100c) 2, 480d) 1,103e) 4, 120
Consider the following page reference string: 1, 2, 3, 4, 5, 6, 3, 4, 5, 6, 1, 2, 1, 0, 1, 0, 5.With 4 frames, how many page faults would occur with the following page replacement algorithms? Fill in the tables accordingly. (Remember all frames are initially empty, so your first unique pages will all cost one fault each.) RS: reference strings; F0: frame 0, F1: frame 1, etc.a). OPT (5 points)Total page fault?b). LRU (6 points)Total page fault?
The logical address space is 64KB and the physical address space is 32KB in a system, and the system is addressed by byte. If a process needs 6 pages, the page size is 1KB. The operating system allocates 4 frames to this process by using fixed allocation and local replacement strategy as in the following table(not page table).When the process is executing, it wants to access the data whose logical address of 13BAH at time 160.
Given a hard disk of 200 tracks (Track 0‐199) with Track 0 being the innermost track. Write down the track numbers the disk head will travel for the following 4 disk scheduling algorithms with the following sequence of disk track requests: 93, 129, 98, 110, 43, 155, 150, 47, 40. The disk head has just finished a request at track 115 and is currently at track 108. What is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests.1)FCFS 2)SCAN 3)SSTF 4)C-LOOK