1. Given the following information: Job List: Memory Block List: Job Memory Memory Block Memory Block Size Number Requested Job 1 100K Block 1 500K (low-order memory) Job 2 80K Block 2 910K Job 3 500K Block 3 100K Job 4 70K Block 4 300K (high-ordermemory) Use the best-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. 2. Use the first-fit algorithm to indicate final memory blocks are occupied by which jobs. 3. Use the first-fit algorithm to indicate final memory blocks are occupied by which jobs. 4. Use the worse-fit algorithm to indicate final memory blocks are occupied by which jobs.

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...
icon
Related questions
Question

question 2 is asking for best-fit*

1. Given the following information:
Job List:
Memory Block List:
Job
Memory
Memory Block
Memory Block Size
Number
Requested
Job 1
100K
Block 1
500K (low-order memory)
Job 2
80K
Block 2
910K
Job 3
500K
Block 3
100K
Job 4
70K
Block 4
300K (high-order memory)
Use the best-fit algorithm to indicate which memory blocks are allocated to each of the four arriving
jobs.
2. Use the first-fit algorithm to indicate final memory blocks are occupied by which jobs.
3. Use the first-fit algorithm to indicate final memory blocks are occupied by which jobs.
4. Use the worse-fit algorithm to indicate final memory blocks are occupied by which jobs.
Transcribed Image Text:1. Given the following information: Job List: Memory Block List: Job Memory Memory Block Memory Block Size Number Requested Job 1 100K Block 1 500K (low-order memory) Job 2 80K Block 2 910K Job 3 500K Block 3 100K Job 4 70K Block 4 300K (high-order memory) Use the best-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. 2. Use the first-fit algorithm to indicate final memory blocks are occupied by which jobs. 3. Use the first-fit algorithm to indicate final memory blocks are occupied by which jobs. 4. Use the worse-fit algorithm to indicate final memory blocks are occupied by which jobs.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY