Algorithms & Data Structures — Test 1
Page 1 of 2
Question 1
In priority scheduling algorithm ……?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017
Question 2
In the priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017
Question 3
In multilevel feedback scheduling algorithm?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017
Question 4
A process refers to 5 pages A, B, C, D, E in the order A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with Internal store of 3 frames is?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017
Question 5
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed and then the page replacement algorithm used is?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017
Question 6
The aim of creating page replacement algorithms is to?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017
Question 7
A FIFO replacement algorithm associates with each page the?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017
Question 8
Optimal page …….. replacement algorithm?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017
Question 9
The optimal page-replacement algorithm is difficult to implement, because?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017
Question 10
LRU page – replacement algorithm associates with each page the …….?
PPSC - Lecturer Computer Science IT - Higher Education Department Punjab - 2017