Memory Management 1-15

1.       The term ‘page traffic’ describes                

 (A) number of pages in memory at a given instant.              

 (B) number of papers required to be brought in at a given page request.               

(C)   the movement of pages in and out of memory.              

 (D)  number of pages of executing programs loaded in memory.                   

Ans: (C) 

2.       Which of the following is not related to disk scheduling ?

1) transfer time 

2) waiting time 

3) seek time 

4) rotational latency 

Answer:1

3.       Which of the following is not related to the disk access

1) Wait Time 

2) Transfer Time

3) seek time

4) Latency Time 

Answer:2

4.       Belady’s Anomaly is present in _________

 1) LIFO 

  2)FIFO

  3) FCFS

   4)SJF

Answer:2

5.       If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queues of I/O blocks requests are 98,37,14,124,65,67. 

1) 310  

2) 324  

3) 315 

4) 321

Ans:- (4)

6.       Which of the following is not a disk scheduling algorithm? 

1) SCAN

2) Elevator / LOOK 

3) FCFS

4) Working set

Ans: 4

7.       A disc queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67 If the head is presently at 53rd cylinder, what will be the total number of cylinders traversed if we are using SCAN disc scheduling algorithm.

1) 152  

2) 252  

3) 352  

4) 462

Answer: 2

8.       A disc queue with requests for I/O to blocks on cylinders. 98, 183, 37, 122, 14, 124, 65, 67 If the head is presently at 53rd cylinder, what will be the total number of cylinders traversed if we are using C-SCAN disc scheduling algorithm.

1) 182 

2) 282 

3) 382 

4) 482

Answer: 3

9.        A disc queue with requests for I/O to blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67 If the head is presently at 53rd cylinder, what will be the total number of cylinders traversed if we are using C-LOOK disc scheduling algorithm.

1) 155  

2) 255  

3) 355  

4) 455

Answer: 3

10.    In which disc scheduling algorithm the head traverses to the extreme end cylinders.

1) FCFS 

2) SSTF 

3) SCAN 

4) C-LOOK

Answer: 3

11.    In which disc scheduling algorithm the head traverses to the nearest available cylinder.

1) FCFS 

2) SSTF 

3) SCAN 

4) C-LOOK

Answer: 2

12.    In which disc scheduling algorithm  the head traverses to the first cylinder encountered in the given order.

1) FCFS

2) SSTF

3) SCAN

4) C-LOOK

Answer: 1

13.    In which disc scheduling algorithm the head traverses till one end then returns directly to the other end before encountering any other cylinder.

 1) FCFS 

 2) SSTF 

 3) C-SCAN

 4) C-LOOK

 Answer: 3

14.    C-SCAN is also known as ________

1) Circular scan

 2) Cylindrical scan 

3) Constant scan 

4) None

Answer: 1

15.   A disc queue with requests for I/O to blocks on cylinders  98, 183, 37, 122, 14, 124, 65, 67 If the head is presently at 53rd cylinder, what will be the total number of cylinders traversed if we are using FCFS disc scheduling algorithm.

1) 340 

2) 440 

3) 540 

4) 640

Answer: 4

Next Page