Multiple Choice Questions and Answers
Question 1 : The situation where, two or more processes are reading or writing some shared data and the result depends on who runs precisely when is called
(a) Synchronization
(b) Multitasking
(c) Race condition
(d) None of the above
Answer : (c)
Question 2 : A section of code or set of operations in which processes may be changing shared variables is known as
(a) Critical section (CS)
(b) Atom
(c) Procedure
(d) None of the above
Answer : (a)
Question 3 : DI stands for
(a) Demand Input
(b) Disable Interrupt
(c) Demand Interrupt
(d) None of the above
Answer : (b)
Question 4 : ‘Bakery Algorithm’ will provide
(a) Two-process solutions
(b) Multi-process solutions
(c) Deadlock solutions
(d) None of the above
Answer : (b)
Question 5 : Semaphores were given by
(a) Albrecht
(b) Dijkstra
(c) Peterson
(d) None of the above
Answer : (b)
Question 6 : ‘Spinlocks’ refer to
(a) Binary semaphores
(b) Counting semaphores
(c) Monitors
(d) None of the above
Answer : (a)
Question 7 : Critical region and conditional critical regions were proposed by
(a) Dijkstra
(b) Brinch-Harson
(c) Peterson
(d) None of the above
Answer : (b)
Question 8 : Critical region, conditional critical region and monitors are outgrowth of
(a) Semaphores
(b) Mutual Exclusion
(c) Synchronous communication
(d) None of the above
Answer : (a)
Question 9 : Checkpoints are also named as
(a) Syncpoints
(b) Savepoints
(c) Both a and b
(d) None of the above
Answer : (c)
Question 10 : A semaphore count of negative means that the queue contains
(a) (n+1) waiting process
(b) n waiting process
(c) (n-1) waiting process
(d) None of the above
Answer : (b)
Question 11 : To avoid race condition, the number of processes that may be simultaneously inside their critical section is
(a) 0
(b) 1
(c) 2
(d) 4
Answer : (b)
Question 12 : Solaris contains
(a) an adaptive mutex
(b) Spinlocks
(c) Dispatcher
(d) None of the above
Answer : (a)