Question 5:1 Based on Chapter 9, consider the following memory partitions of 300 KB, 200 KB, 600 KB, 200 and 400 KB (in order), and processes of 112 KB, 390 KB, 500 KB, and 250 KB (in order). a) How would each of the first-fit, best-fit, and worst-fit algorithms place the above processes in the given memory partitions. Use the below representation of the memory partitions and fill it for every algorithm. (6 marks) Memory Partition 300 200 600 200 400 Process b) Which algorithm makes the most efficient use of memory?

Question 5:1 Based on Chapter 9, consider the following memory partitions of 300 KB, 200 KB, 600 KB, 200 and 400 KB (in order), and processes of 112 KB, 390 KB, 500 KB, and 250 KB (in order). a) How would each of the first-fit, best-fit, and worst-fit algorithms place the above processes in the given memory partitions. Use the below representation of the memory partitions and fill it for every algorithm. (6 marks) Memory Partition 300 200 600 200 400 Process b) Which algorithm makes the most efficient use of memory?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

- Consider 7 memory partitions of size 470 KB, 400 KB, 600 KB, 200 KB, 500 KB, 300 KB and 250 KB. These partitions need to be allocated to 6 processes of sizes 190 KB, 491 KB, 468 KB and 210 KB, 357 KB and 587 KB in that order. Perform the allocation of processes using- First Fit Algorithm Best Fit Algorithm Worst Fit Algorithm 470 KB 400 KB 600 KB 200 KB 500 KB 300 KB 250 KB (190 KL) P1 491 KB P2 468 KB P3 (210 KB P4 357 KB) P5 587 KL P6
Suppose there are memory partitions of 200 KB, 600 KB, 300 KB, 400 KB and 700 KB. These partitions are in order. Use first fit, best fit, and worst fit algorithms to allocate processes of parameters 312 KB, 517 KB, 212 KB, and 526 KB, and solve the Represent the allocations with the help of a figure or table. and Which algorithms of the three make the most efficient use of memory?
a) Given Static memory partitions shown in the following picture, Draw diagrams on how would each of the first-fit, best-fit, worst-fit algorithms place processes with the space requirement of the processes - P1 (146 KB), P2(425 KB), P3(240 KB), P4(89 KB) and P5(450 KB) (in order). Which algorithm makes the most effective use of memory? Answer with justification. 2. Memory Partitions: 200 250 450 160 320 150 600 KB KB KB KB KB KB KB b) Assume that in a certain situation of paged memory management system page size is 2KB, find the page number and offset for the following logical addresses of 32 bit or references (provide as a decimal number): i) 1085 ii) 30000 iii) 19467 iv) 15385 c) Describe the advantages of paging over segmentation.
b) Solve/Briefly discuss: 1) Suppose five memory partitions of 200 KB, 600 KB, 300 KB, 400 KB, and 700 KB (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 315 KB, 520 KB, 115 KB, and 430 KB (in order)? Which algorithm makes the most efficient use of memory? 2) Compare the First fit and Best fit partition allocation with reference to Memory Man-agement. 3) What should be the optimal size of a page/frame?
Suppose there are memory partitions of 455 KB, 305 KB, 355 KB and 655 KB. These partitions are in order. Use first fit, best fit, and worst fit algorithms to allocate processes of parameters 415 KB, 515 KB, 215 KB, and 330 KB, and solve the following: a. Represent the allocations with the help of a figure or table. b. Which algorithms of the three make the most efficient use of memory?
5. Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would each of the a) first-fit, b) best-fit, and d) worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory? Diagrams may be used for this question. ore pe incro
b) Solve/Briefly discuss: 1) Suppose five memory partitions of 200 KB, 600 KB, 300 KB, 400 KB, and 700 KB (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processesof 315 KB, 520 KB, 115 KB, and 430 KB (in order)? Which algorithm makes the most efficient use of memory?2) Compare the First fit and Best fit partition allocation with reference to Memory Management.3) What should be the optimal size of a page/frame
Consider the memory partitions of size: 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order). Apply each of the first-fit, best-fit, and worst-fit algorithms to place processes of sizes: 212 KB, 417 KB, 112 KB, and 426 KB (in order). Which algorithm makes the most efficient use of memory?
You are given six fixed memory partitions of 405 KB, 510 KB, 360 KB, 130 KB, 650 KB,and 215 KB (in that order). Show by illustrating with a diagram how would the first-fit,best-fit, and worst-fit algorithms place processes of size 161 KB, 510 KB, 590 KB, 210KB, and 330 KB (in that order). Rank the algorithms in terms of how efficiently theyutilize memory. Calculate the internal fragmentation for each algorithm.
Based on the picture attached, please answer the following questions, thank you in advance. (a) Verify that the Available array has been calculated correctly.(b) Calculate the Need matrix. (c) Show that the current state is safe, that is, show a safe sequence of processes. Inaddition, to the sequence show how the Available (working array) changes as eachprocess terminates. (d) Given the request (3,2,3,3) from Process P5. Should this request be granted? Why or why not?
Example : Suppose there are memory partitions of 200 KB, 600 KB, 300 KB, 400 KB and 700 KB. These partitions are in order. Use first fit, best fit, and worst fit algorithms to allocate processes of parameters 312 KB, 517 KB, 212 KB, and 526 KB, and solve the following: Represent the allocations with the help of a figure or table.
a) Given Static memory partitions shown in the following picture, Draw diagrams on how would each of the first-fit, best-fit, worst-fit algorithms place processes with the space requirement of the processes KB), P4(89 KB) and P5(450 KB) (in order). Which algorithm makes the most effective use of memory? Answer with justification. 2. P1 (146 КB), Р2(425 КВ), Р3(240 Memory Partitions: 200 KB 250 450 160 320 150 600 KB KB KB KB KB KB Assume that in a certain situation of paged memory management system page size b) is 2KB, find the page number and offset for the following logical addresses of 32 bit or references (provide as a decimal number): i) 1085 ii) 30000 iii) 19467 iv) 15385 c) Describe the advantages of paging over segmentation.