Operating System Set 12

Computer Science Engineering (CSE),

Information Technology Engineering (IT),

Bachelor of Science in Computer Science FY (BSc CS),

Bachelor of Computer Applications (BCA),

Bachelor of Science in Computer Science (BSc CS)

Practice Mode Previous Next
On This Page

This set of Operating System (OS) Multiple Choice Questions & Answers (MCQs) focuses on Operating System Set 12

Q1 | Semaphore is a/an                to solve the critical section problem.
  • hardware for a system
  • special program for a system
  • integer variable
  • none of the mentioned
Answer: integer variable
Q2 | What are the two atomic operations permissible on semaphores?
  • wait
  • stop
  • hold
  • none of the mentioned
Answer: wait
Q3 | What are Spinlocks?
  • cpu cycles wasting locks over critical sections of programs
  • locks that avoid time wastage in context switches
  • locks that work better on multiprocessor systems
  • all of the mentioned
Answer: all of the mentioned
Q4 | What is the main disadvantage of spinlocks?
  • they are not sufficient for many process
  • they require busy waiting
  • they are unreliable sometimes
  • they are too complex for programmers
Answer: they require busy waiting
Q5 | The wait operation of the semaphore basically works on the basic                system call.
  • stop()
  • block()
  • hold()
  • wait()
Answer: block()
Q6 | The signal operation of the semaphore basically works on the basic                system call.
  • continue()
  • wakeup()
  • getup()
  • start()
Answer: wakeup()
Q7 | If the semaphore value is negative
  • its magnitude is the number of processes waiting on that semaphore
  • it is invalid
  • no operation can be further performed on it until the signal operation is performed on it
  • none of the mentioned
Answer: its magnitude is the number of processes waiting on that semaphore
Q8 | The code that changes the value of the semaphore is                          
  • remainder section code
  • non – critical section code
  • critical section code
  • none of the mentioned
Answer: critical section code
Q9 | What will happen if a non-recursive mutex is locked more than once?
  • starvation
  • deadlock
  • aging
  • signaling
Answer: deadlock
Q10 | What is a semaphore?
  • is a binary mutex
  • must be accessed from only one process
  • can be accessed from multiple processes
  • none of the mentioned
Answer: can be accessed from multiple processes
Q11 | What are the two kinds of semaphores?
  • mutex & counting
  • binary & counting
  • counting & decimal
  • decimal & binary
Answer: binary & counting
Q12 | What is a mutex?
  • is a binary mutex
  • must be accessed from only one process
  • can be accessed from multiple processes
  • none of the mentioned
Answer: must be accessed from only one process
Q13 | A binary semaphore is a semaphore with integer values                          
  • 1
  • -1 c) 0.8 d) 0.5
Answer: 1
Q14 | Semaphores are mostly used to implement
  • system calls
  • ipc mechanisms
  • system protection
  • none of the mentioned
Answer: ipc mechanisms
Q15 | The bounded buffer problem is also known as                          
  • readers – writers problem
  • dining – philosophers problem
  • producer – consumer problem
  • none of the mentioned
Answer: producer – consumer problem
Q16 | In the bounded buffer problem, there are the empty and full semaphores that
  • count the number of empty and full buffers
  • count the number of empty and full memory spaces
  • count the number of empty and full queues
  • none of the mentioned
Answer: count the number of empty and full buffers
Q17 | To ensure difficulties do not arise in the readers – writers problem                are given exclusive access to the shared object.
  • readers
  • writers
  • readers and writers
  • none of the mentioned
Answer: writers
Q18 | The dining – philosophers problem will occur in case of                          
  • 5 philosophers and 5 chopsticks
  • 4 philosophers and 5 chopsticks
  • 3 philosophers and 5 chopsticks
  • 6 philosophers and 5 chopsticks
Answer: 5 philosophers and 5 chopsticks
Q19 | A deadlock free solution to the dining philosophers problem                          
  • necessarily eliminates the possibility of starvation
  • does not necessarily eliminate the possibility of starvation
  • eliminates any possibility of any kind of problem further
  • none of the mentioned
Answer: does not necessarily eliminate the possibility of starvation
Q20 | A monitor is a type of                          
  • semaphore
  • low level synchronization construct
  • high level synchronization construct
  • none of the mentioned
Answer: high level synchronization construct
Q21 | A monitor is characterized by
  • a set of programmer defined operators
  • an identifier
  • the number of variables in it
  • all of the mentioned
Answer: a set of programmer defined operators
Q22 | A procedure defined within a                   can access only those variables declared locally within the                and its formal parameters.
  • process, semaphore
  • process, monitor
  • semaphore, semaphore
  • monitor, monitor
Answer: monitor, monitor
Q23 | If no process is suspended, the signal operation                          
  • puts the system into a deadlock state
  • suspends some default process execution
  • nothing happens
  • the output is unpredictable
Answer: nothing happens
Q24 | A collection of instructions that performs a single logical function is called
  • only one process can be active at a time within the monitor
  • n number of processes can be active at a time within the monitor (n being greater than 1)
  • the queue has only one process in it at a time
  • all of the mentioned
Answer: only one process can be active at a time within the monitor
Q25 | What are the operations that can be invoked on a condition variable?
  • wait & signal
  • hold & wait
  • signal & hold
  • continue & signal
Answer: wait & signal
Previous Next