CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Fractions

Consider six ...

Question

Consider six memory partitions of size 200 KB, 400 KB, 600 KB, 500 KB, 300 KB, and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?

Open in App

Solution

The best fit algorithm finds the smallest sufficient partition.

$∴$ The memory partitions 200 KB and 300 KB are not allotted.

Suggest Corrections

thumbs-up

1

Similar questions

Q. Memory size is 1000 KB. Variable prutitioning is used for memory allocation to processes. Currently there are 2 partitions of size 200 KB & 250 KB & 2 free holes. The smallest request that could be denied is _____ KB. (Rounded off with no decimal points)

Q. Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order should files be stored?

Q. Consider a swapping system in which memory consists of hole sizes in following order.
11 KB, 8 KB, 18 KB, 19KB, 5KB, 6KB, 12KB, 19KB, 20KB
Which hole is taken for segment request of 15KB by using first fit?

Q. Consider 27 bit logical address and page frame size is 1 KB, if each PTE size is 4 Byte then the size of page table (in KB) of virtual program is

Q. Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segments size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window is

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Introduction

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Standard VI Mathematics

Join BYJU'S Learning Program

CrossIcon