7.6. This diagram shows an example of memory configuration under dynamic partition- ing, after a number of placement and swapping-out operations have been carried out. Addresses go from left to right; gray areas indicate blocks occupied by processes; white areas indicate free memory blocks. The last process placed is 2-Mbyte and is marked with an X. Only one process was swapped out after that. 4M 1 MX 5M 8M 2M 4M 3M a. What was the maximum size of the swapped-out process? b. What was the size of the free block just before it was partitioned by X? c. A new 3-Mbyte allocation request must be satisfied next. Indicate the intervals of memory where a partition will be created for the new process under the fol- lowing four placement algorithms: best-fit, first-fit, next-fit, and worst-fit. For each algorithm, draw a horizontal segment under the memory strip and label it clearly.

7.2 Consider a fixed partitioning scheme with equal-size partitions of 2¹6 bytes and a total main memory size of 224 bytes. A process table is maintained that includes a pointer to a partition for each resident process. How many bits are required for the pointer? nicimate

Multi-tasking can not be achieved with a single processor machine.  True  False       2. Async/Await is best for network bound operations while multi-threading and parallel programming is best for CPU-bound operations.  True  False     3. The following is a characteristic of an async method:The name of an async method, by convention, ends with an "Async" suffix.  True  False   4. Using asynchronous code for network bound operations can speed up the time needed to contact the server and get the data back.  True  False     5. Asynchronous programming has been there for a long time but has tremendously been improved by the simplified approach of async programming in C# 5 through the introduction of:  The Task class  True  False

Consider a file system that uses a modifed contiguous-allocation scheme with support for extents. A file is a collection of extents, with each ex- tent corresponding to a contiguous set of blocks. A key issue in such systems is the degree of variability in the size of the extents. What are the advantages and disadvantages of the following schemes: a. All extents are of the same size, and the size is predetermined. b. Extents can be of any size and are allocated dynamically. c. Extents can be of a few fixed sizes, and these sizes are predeter- mined.