The following is NOT a classical problem of synchronization?

(A) Reader writer problem
(B) Bounded buffer problem
(C) Dining philosopher problem
(D) Counting semaphore problem

Related Posts 👇

  • Scheduling is done so as to?

    (A) Keep the waiting time the same
    (B) Increase the waiting time
    (C) Decrease the waiting time
    (D) None of the above

  • CPU scheduling is the basis of?

    (A) Larger memory sized systems
    (B) Multiprogramming operating systems
    (C) Multiprocessor systems
    (D) None of the above

  • In priority scheduling algorithm?

    (A) CPU is allocated to the process with lowest priority
    (B) CPU is allocated to the process with highest priority
    (C) Both of the above
    (D) None of the above

  • Time quantum is defined in?

    (A) Priority queue scheduling algorithm
    (B) Round Robin scheduling algorithm
    (C) Shortest job first scheduling algorithm
    (D) None of the above

Leave a Reply

Your email address will not be published.