PPSC PAST PAPER LECTURER COMPUTER SCIENCE (BS-17) (MALE & FEMALE) -2017

(11) . 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:

  1. LRU

  2. LFU

  3. FIFO

  4. None of these

(12) . Users are _______ that their processes are running on a paged system.

  1. Aware

  2. Unaware

  3. informed

  4. None of these

(13) . The aim of creating page replacement algorithms is to.

  1. Replace pages faster

  2. increase the page fault rate

  3. Decrease the page fault rate

  4. To allocate multiple pages to processes

(14) . A FIFO replacement algorithm associates with each page the _____

  1. Time it was brought into memory

  2. Size of the page in memory

  3. Page after and before it

  4. All of these

(15) . Optimal page - replacement algorilhm is:

  1. Replace the page that has not been used for a long lime

  2. Replace the page that has been used for a long time

  3. Replace the page that will not be used for a long time

  4. None of these

(16) . The optimal page replacement algorithm is difficult to implement because

  1. It requires a lot of information

  2. It requires future knowledge of the reference string

  3. It is too complex

  4. It is extremely expensive

(17) . LRU page - replacement algorithm associates with each page the _______

  1. Time it was brought into memory

  2. The time of that pages last use

  3. Page after and before it

  4. All of these

(18) . For 3 page frames. the following is the reference string: 7 0 1 20 3 0 4 2 3 0 3 2.1 2 0 1 7 0 1; How many page faults does the LRU page replacement algorithm produce?

  1. 10

  2. 15

  3. 11

  4. 12

(19) . CPU fetches the instruction from memory according to the value of

  1. Program counter

  2. Status register

  3. instruction register

  4. Program status word

(20) . A memory buffer used to accommodate a speed differential is called;

  1. Slack point

  2. Cache

  3. Accumulator

  4. Disk buffer