UGC NET CS 2014 June-paper-3
October 3, 2023Database-Management-System
October 3, 2023Process-Scheduling
Question 12
|
Let a memory have four free blocks of sizes 4k, 8k, 20k, 2k. These blocks are allocated following the best-fit strategy. The allocation requests are stored in a queue as shown below.
The time at which the request for J7 will be completed will be
16
|
|
19
|
|
20
|
|
37
|
Question 12 Explanation:
At t = 0
![](https://solutionsadda.in/wp-content/uploads/2020/02/11-3.jpg)
At t = 8
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.1.jpg)
At t = 10
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.2.jpg)
At t = 11
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.3.jpg)
J7 can be finished at t = 19.
![](https://solutionsadda.in/wp-content/uploads/2020/02/11-3.jpg)
At t = 8
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.1.jpg)
At t = 10
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.2.jpg)
At t = 11
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.3.jpg)
J7 can be finished at t = 19.
Correct Answer: B
Question 12 Explanation:
At t = 0
![](https://solutionsadda.in/wp-content/uploads/2020/02/11-3.jpg)
At t = 8
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.1.jpg)
At t = 10
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.2.jpg)
At t = 11
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.3.jpg)
J7 can be finished at t = 19.
![](https://solutionsadda.in/wp-content/uploads/2020/02/11-3.jpg)
At t = 8
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.1.jpg)
At t = 10
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.2.jpg)
At t = 11
![](https://solutionsadda.in/wp-content/uploads/2020/02/11.3.jpg)
J7 can be finished at t = 19.
Subscribe
Login
0 Comments