Consider a swapping system in which memory consists of the holes as shown in Fig.A. Note that A to I represent processes in memory, and H1 to Hs are eight holes. Process P1. P2. .. Ps are generated sequentially, and their sizes are as follows: i Pi requests 8 KB. i Pz requests 10KB. 111. P3 requests 13KB. iv. Pa requests 5KB V. Ps requests 4KB Answer the following questions: Hị_ A 4KB H: | 10KB H3 в 5KB H4 | 16KB Hs D 8KB He E 9KB Hs 13КВ G 15КВ Fig. A (a) When using First-fit algorithm, (1) which hole will P1 will be loaded into? (2) which hole will P5 will be loaded into? (b) When using Best-fit algorithm, (3) which hole will P1 will be loaded into? (4) which hole will P5 will be loaded into? (c) When using worst-fit algorithm, (5) which hole will P1 will be loaded into? (6) which hole will P4 will be loaded into? (7) which hole will P5 will be loaded into? (d) When using Next-fit algorithm, (8) which hole will P2 will be loaded into? (9) which hole will P3 will be loaded into? (10) which hole will P4 will be loaded into?

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
icon
Related questions
Question
Consider a swapping system in which memory consists of the holes as shown in Fig.A. Note that A to I represent processes
in memory, and Hj to Hg are eight holes. Process Pj, P. ... , Ps are generated sequentially, and their sizes are as follows:
i Pi requests 8 KB.
P2 requests 10KB.
i.
111.
P3 requests 13KB.
iv.
P4 requests 5KB
Ps requests 4KB
V.
Answer the following questions:
Н. А На в На с
10KB
H4
16KB
D Hs
8KB
E
He
G
9KB
H: I
15KВ
Hs
13KB
4KB
5KB
Fig. A
(a) When using First-fit algorithm,
(1) which hole will P1 will be loaded into?
(2) which hole will P5 will be loaded into?
(b) When using Best-fit algorithm,
(3) which hole will P1 will be loaded into?
(4) which hole will P5 will be loaded into?
(c) When using worst-fit algorithm,
(5) which hole will P1 will be loaded into?
(6) which hole will P4 will be loaded into?
(7) which hole will P5 will be loaded into?
(d) When using Next-fit algorithm,
(8) which hole will P2 will be loaded into?
(9) which hole will P3 will be loaded into?
(10) which hole will P4 will be loaded into?
Transcribed Image Text:Consider a swapping system in which memory consists of the holes as shown in Fig.A. Note that A to I represent processes in memory, and Hj to Hg are eight holes. Process Pj, P. ... , Ps are generated sequentially, and their sizes are as follows: i Pi requests 8 KB. P2 requests 10KB. i. 111. P3 requests 13KB. iv. P4 requests 5KB Ps requests 4KB V. Answer the following questions: Н. А На в На с 10KB H4 16KB D Hs 8KB E He G 9KB H: I 15KВ Hs 13KB 4KB 5KB Fig. A (a) When using First-fit algorithm, (1) which hole will P1 will be loaded into? (2) which hole will P5 will be loaded into? (b) When using Best-fit algorithm, (3) which hole will P1 will be loaded into? (4) which hole will P5 will be loaded into? (c) When using worst-fit algorithm, (5) which hole will P1 will be loaded into? (6) which hole will P4 will be loaded into? (7) which hole will P5 will be loaded into? (d) When using Next-fit algorithm, (8) which hole will P2 will be loaded into? (9) which hole will P3 will be loaded into? (10) which hole will P4 will be loaded into?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education