Follow Us :

PREVIOUS YEAR SOLVED PAPERS - August 2016 Paper 2

Avatto > > UGC NET COMPUTER SCIENCE > > PREVIOUS YEAR SOLVED PAPERS > > August 2016 Paper 2

36. Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows :
process A holds R and wants T
process B holds nothing but wants T
process C holds nothing but wants S
process D holds U and wants S & T
process E holds T and wants V
process F holds W and wants S
process G holds V and wants U
Is the system deadlocked ? If yes, ______ processes are deadlocked.

  • Option : C
  • Explanation :
    System is in Deadlock due to process D,E,G
    So option C
    Aug2016 cs
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


37. Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, _____ number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1

  • Option : A
  • Explanation :

    So, option (A) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


38. Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur ?

  • Option : B
  • Explanation : To avoid deadlock 'm' >= peak demands(P1 + P2 + P3) i.e. m >= peak demands(2 + 5 + 7) m >= peak demands(14) So, option (B) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


39. Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in _____ order to minimize average response time if 3 < x < 5.

  • Option : B
  • Explanation :
    We will solve it by minimizing the avg Waiting Time and Take x = 4 BT = Burst or Execution time CT = completion time P = Process AWT = Average Waiting Time AT = Arrival time WT = Waiting time
    We get minimum average waiting time from the sequence given in option (B)
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


40. Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then _____ context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted).

  • Option : A
  • Explanation :

    There are 3 context switch. So. option (A) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


Related Quiz.
August 2016 Paper 2