Q.1
A counting semaphore was initialized toThen 6 P (wait) operations and(signal) operations were completed on this semaphore. The resulting value of the semaphore is
  • . 4
  • . 6
  • . 9
  • . 8
Q.2
A critical section is a program segment                         .
  • . where shared resources are accessed
  • . single thread of execution
  • . improves concurrency in multi-core system
  • . lower resource consumption
Q.3
A semaphore is a shared integer variable                     .
  • . lightweight process
  • . that cannot drop below zero
  • . program counter
  • . stack space
Q.4
Processes to solve the critical section problem.
  • . one
  • . two
  • . three
  • . four
Q.5
Spinlocks are intended to provide                   only.
  • . mutual exclusion
  • . bounded waiting
  • . aging
  • . progress
Q.6
To avoid deadlock
  • . there must be a fixed number of resources to allocate
  • . resource allocation must be done only once
  • . all deadlocked processes must be aborted
  • . inversion technique can be used
Q.7
All deadlocks involve conflicting needs for
  • . resources
  • . users
  • . computers
  • . programs
Q.8
Which one of the following statements describes the properties achieved?
  • . mutual exclusion but not progress
  • . progress but not mutual exclusion
  • . neither mutual exclusion nor progress
  • . both mutual exclusion and progress
Q.9
A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
  • . data consistency
  • . race condition
  • . aging
  • . starvation
Q.10
Producer consumer problem can be solved using
  • . semaphores
  • . event counters
  • . monitors
  • . all of the above
0 h : 0 m : 1 s