Reference no: EM132263357
Questions: Suppose that we have free segments with sizes: 6, 17, 25, 14, and 19. Place a program with size 13kB in the free segment using first-fit, best-fit and worst fit?
2. Demonstrate the LRU page replacement algorithm for the given example.
There are 8 pages and 4 frames. Consider the page referencing string:
" 1, 2, 3, 4, 3, 1, 4, 2, 5, 2, 1, 2, 5, 4". Compute the number of page faults and page hits using LRU page replacement algorithm.
3. Create a main directory (A), and then sub directory (B). Delete the folder (A) and state what happened!
4. Consider the following request queue for disk cylinders:
65, 48, 79, 49, 82, 33, 112, 90, 155
Using the Shortest Seek Time First (SSTF) algorithm, find the total head movements using schematic diagram for a disk of 200 cylinders (0-199). It is assumed that read write head is initially present at cylinder number 50.