ZuoTi.Pro
Question

Given free memory blocks of A(500 KB), B(600 KB) and C(300 KB) [in order, as shown...

Given free memory blocks of A(500 KB), B(600 KB) and C(300 KB) [in order, as shown in the figure below], how would best-fit place processes of P1(160 KB), P2(500 KB), P3(132 KB) and P4(202 KB) (in order)? You may use the figures below to denote the allocation of processes into the partitions.

Solution: <Write your solution here. You may use the figures below to denote allocation of processes into the partitions.>

Best fit

A (500 KB)

B (600 KB)

C(300 KB)
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Best fit

A (500 KB)

P2=500

Free=0

B (600 KB)

P4=202

Free=398

C(300 KB)

P1=160

Free = 140

P3=132

Free=8


if you have any doubt then please ask me without any hesitation in the comment section below , if you like my answer then please thumbs up for the answer , before giving thumbs down please discuss the question it may possible that we may understand the question different way and i can edit and change the answers if you argue, thanks :)

0 0
Add a comment
Know the answer?
Add Answer to:
Given free memory blocks of A(500 KB), B(600 KB) and C(300 KB) [in order, as shown...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Given six memory partitions whose sizes (KB) in order are 300, 600, 350, 200, 750, and...

    Given six memory partitions whose sizes (KB) in order are 300, 600, 350, 200, 750, and 125, respectively, how would the first-fit, best-fit, and worst-fit algorithms placefive processes whose sizes (KB) in order are 115, 500, 358, 200, and 375, respectively? Please give your answers to the allocation strategy for each algorithm.

  • Operating Systems 1.       Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and...

    Operating Systems 1.       Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order), how would each of the first-fit, best-fit and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB (in that order)? Which algorithm makes the most efficient use of memory?

  • Given six memory partitions of 800 KB,500 KB,350KB,200KB,450KB and 100 KB (in order), how would the...

    Given six memory partitions of 800 KB,500 KB,350KB,200KB,450KB and 100 KB (in order), how would the first-fit, best-fit and worst-fit algorithms place processes of size 315KB,600KB, 345KB, 110KB and 400KB(in order) i) Which algorithm makes the most efficient use of memory? ii) Are there any internal and external fragmentation? If yes, how it can be solved?

  • Apply the first-fit, best-fit, and worst-fit algorithms separately the given processes in sequence from P1 to...

    Apply the first-fit, best-fit, and worst-fit algorithms separately the given processes in sequence from P1 to P4 and Identify which algorithm makes the most efficient use of memory? Show every step for process assignment, also discuss the internal and external fragmentation in the scenario. 220 KB P1 250 KB P2 390 KB 460 KB P4 P3 150 KB 100 KB 517 KB 340 KB Processes 730 KB Memory Partition

  • Design a line following robot by using AT89C51 microcontroller, DC motors and line sensors. Use Photo...

    Design a line following robot by using AT89C51 microcontroller, DC motors and line sensors. Use Photo transistors and LEDs to design a line sensor. Use DC motos and attach DC motors to Microcontroller by using H-Bridge IC or circuit. Use assembly language for programming. Draw the model and simulate it. Show all the schematics and connections. 3 نقاط Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), the processes of size 212KB,...

  • Memory Allocation a) Is it possible to have both internal and external fragmentation with fixed p...

    Memory Allocation a) Is it possible to have both internal and external fragmentation with fixed partition memory allocation? How about with dynamic/variable memory partition allocation? Explain. (1 point) b) Suppose we have 1000K of memory where the first 100K is reserved. Also suppose that the following processes have been allocated memory in the following order:                 P1: 100K, P2: 100K, P3: 25K, P4: 200K, P5: 200K, P6: 75K, P7: 100K. Create a diagram of memory. Suppose that P2, P4, and P6...

  • QUESTION 4 (a) Given a heap of memory management scheme with the following free list: U...

    QUESTION 4 (a) Given a heap of memory management scheme with the following free list: U H H H U H H 20KB н Tu 150KB 190KB U 240KB H 250KB H 340KB u 475KB OKB 70KB 120KB 295KB 440KB 500KB 560KB 690KB 800KB The following process request will be received in order: Process number Size in KB (Kilobytes) P1 90 P2 39 P3 27 P4 16 P5 36 Show how the memory requests above are allocated by using: i....

  • Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB (in order),

    Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 200 MB, 15 MB, 185 MB, 75 MB, 175 MB, and 80 MB (in order)? Indicate which—if any— requests cannot be satisfied. Comment on how efficiently each of the algorithms manages memory.

  • Answer the following question: Allocation Available A B C D 3 3 2 1 Ро P1...

    Answer the following question: Allocation Available A B C D 3 3 2 1 Ро P1 A B C D 2001 3121 2103 1312 1 432 Max ABCD 4212 5252 2316 1424 36 65 P2 P3 P4 The snapshot of a system 1) Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete. (Format: use process number only, e.g. 01234) 2) If a request from process P1 arrives for (1,1,0,0), can...

  • Fill in the table below based on the reference string (RS) shown. The resident set at time 0 is g...

    Fill in the table below based on the reference string (RS) shown. The resident set at time 0 is given Algorithm to use is: PFF with t-2 RS 2 35 3 212 3 2 4 3 45 3 P1 P2 )X P3 P4 P5 IN 2 OUT PF 1 Based on the logical adáresses given in problem 1 on the previous page what would that reference string be? 1. Given the following physical addresses and value in memory: Val |...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT