Assume the memory contains 6 holes with the sizes of 190, 550, 220, 420, 650, and 110 A sequence of requests for 4 blocks is to be satisifed: A = 210, B = 430, C = 100, D = 420. The following table has two rows for each of the four memory allocation strategies (first fit, next fit, best fit, worst fit). Fill in the table as follows: • Block Allocated: Enter the letter of the memory block that will be placed in the indicated hole. If more than one block is allocated in a hole, include both blocks with no spaces (e.g. "DG"). If no block is allocated in a hile, enter "-". • Remaining Size: Enter the size of the remaining hole after all four memory blocks are placed. H1: 190 H2: 550 Н3: 220 H4: 420 H5: 650 H6: 110 Block First Fit Blank 1 Blank 2 Blank 3 Blank 4 Blank 5 Blank 6 Allocated Remaining Blank 7 Blank 8 Blank 9 Blank 10 Blank 11 Blank 12 Size Block Next Fit Blank 13 Blank 14 Blank 15 Blank 16 Blank 17 Blank 18 Allocated Remaining Blank 19 Blank 20 Blank 21 Blank 22 Blank 23 Blank 24 Size Block Best Fit Blank 25 Blank 26 Blank 27 Blank 28 Blank 29 Blank 30 Allocated Remaining Blank 31 Blank 32 Blank 33 Blank 34 Blank 35 Blank 36 Size Block Worst Fit Blank 37 Blank 38 Blank 39 Blank 40 Blank 41 Blank 42 Allocated Remaining Blank 43 Blank 44 Blank 45 Blank 46 Blank 47 Blank 48 Size
Assume the memory contains 6 holes with the sizes of 190, 550, 220, 420, 650, and 110 A sequence of requests for 4 blocks is to be satisifed: A = 210, B = 430, C = 100, D = 420. The following table has two rows for each of the four memory allocation strategies (first fit, next fit, best fit, worst fit). Fill in the table as follows: • Block Allocated: Enter the letter of the memory block that will be placed in the indicated hole. If more than one block is allocated in a hole, include both blocks with no spaces (e.g. "DG"). If no block is allocated in a hile, enter "-". • Remaining Size: Enter the size of the remaining hole after all four memory blocks are placed. H1: 190 H2: 550 Н3: 220 H4: 420 H5: 650 H6: 110 Block First Fit Blank 1 Blank 2 Blank 3 Blank 4 Blank 5 Blank 6 Allocated Remaining Blank 7 Blank 8 Blank 9 Blank 10 Blank 11 Blank 12 Size Block Next Fit Blank 13 Blank 14 Blank 15 Blank 16 Blank 17 Blank 18 Allocated Remaining Blank 19 Blank 20 Blank 21 Blank 22 Blank 23 Blank 24 Size Block Best Fit Blank 25 Blank 26 Blank 27 Blank 28 Blank 29 Blank 30 Allocated Remaining Blank 31 Blank 32 Blank 33 Blank 34 Blank 35 Blank 36 Size Block Worst Fit Blank 37 Blank 38 Blank 39 Blank 40 Blank 41 Blank 42 Allocated Remaining Blank 43 Blank 44 Blank 45 Blank 46 Blank 47 Blank 48 Size
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:Assume the memory contains 6 holes with the sizes of 190, 550, 220, 420, 650, and 110
A sequence of requests for 4 blocks is to be satisifed: A = 210, B = 430, C = 100, D = 420.
The following table has two rows for each of the four memory allocation strategies (first fit, next fit, best fit, worst fit). Fill in the table
as follows:
Block Allocated: Enter the letter of the memory block that will be placed in the indicated hole. If more than one block
is allocated in a hole, include both blocks with no spaces (e.g. "DG"). If no block is allocated in a hile, enter "-".
• Remaining Size: Enter the size of the remaining hole after all four memory blocks are placed.
H1: 190
H2: 550
H3: 220
H4: 420
H5: 650
H6: 110
Block
First Fit
Blank 1
Blank 2
Blank 3
Blank 4
Blank 5
Blank 6
Allocated
Remaining
Blank 7
Blank 8
Blank 9
Blank 10
Blank 11
Blank 12
Size
Block
Next Fit
Blank 13
Blank 14
Blank 15
Blank 16
Blank 17
Blank 18
Allocated
Remaining
Blank 19
Blank 20
Blank 21
Blank 22
Blank 23
Blank 24
Size
Block
Best Fit
Blank 25
Blank 26
Blank 27
Blank 28
Blank 29
Blank 30
Allocated
Remaining
Blank 31
Blank 32
Blank 33
Blank 34
Blank 35
Blank 36
Size
Block
Worst Fit
Blank 37
Blank 38
Blank 39
Blank 40
Blank 41
Blank 42
Allocated
Remaining
Blank 43
Blank 44
Blank 45
Blank 46
Blank 47
Blank 48
Size
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY