4. The following is the memory configuration at a given point in time where dynamic partitioning scheme is used. The shaded areas indicate memory spaces already allocated to other processes, while the white spaces are holes (free memory spaces). The next FOUR (4) memory requests are 30M, followed by 50M, 20M and 40M (in order). Shade and indicate clearly which memory block will be allocated to each request using the first- fit and next-fit placement algorithms. (First-fit) 20M (Best-fit) 20M (Next-fit) 20M 80M 80M 20M 80M 20M (X is the lastest allocated block) 20M 50M 50M 50M 10M 10M 10M X 30M 30M 30M

Consider a file currently consisting of 83 blocks. Assume that the file control block (and the index block, in the case of indexed allocation) is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level) allocation strategies, if, for one block, the following conditions hold. In the contiguous allocation case, assume that there is room to grow in the beginning and in the end. Assume that the block information to be added is stored in memory. For linked allocation, there is a head and tail pointer pointing respectively to the first and last node. Note that while calculating the total number of I/O operations for each, also indicate how many are from r (read) and w (write). For each part, if there is more than one answer, choose the one that gives you the least number of I/O operations. The block is removed from the beginning The block is added after 41st block The block is removed from the end Assumptions: Read one whole…

[5] In Partition () of QuickSort(), which final position of the Pivot will be a useful one? The first index, the middle index or the last index? Would there be any other useful one beside those indicies? Why or why not?