Top 550+ Solved Operating System (OS) MCQ Questions Answer
Q. Which of the following are TRUE for direct communication?
a. a communication link can be associated with n number of process(n = max. number of processes supported by system)
b. a communication link can be associated with exactly two processes
c. exactly n/2 links exist between each pair of processes(n = max. number of processes supported by system)
d. exactly two link exists between each pair of processes
Q. In indirect communication between
a. there is another process r to handle and pass on the messages between p and q
b. there is another machine between the two processes to help communication
c. there is a mailbox to help communication between p and q
d. none of the mentioned
Q. In the non blocking send
a. the sending process keeps sending until the message is received
b. the sending process sends the message and resumes operation
c. the sending process keeps sending until it receives a message
d. none of the mentioned
Q. In the Zero capacity queue
a. the queue can store at least one message
b. the sender blocks until the receiver receives the message
c. the sender keeps sending and the messages don’t wait in the queue
d. none of the mentioned
Q. The Zero Capacity queue
a. is referred to as a message system with buffering
b. is referred to as a message system with no buffering
c. is referred to as a link
d. none of the mentioned
Q. Concurrent access to shared data may result in
a. data consistency
b. data insecurity
c. data inconsistency
d. none of the mentioned
Q. 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
a. data consistency
b. race condition
c. aging
d. starvation
Q. The segment of code in which the process may change common variables, update tables, write into files is known as
a. program
b. critical section
c. non – critical section
d. synchronizing
Q. Which of the following conditions must be satisfied to solve the critical section problem?
a. mutual exclusion
b. progress
c. bounded waiting
d. all of the mentioned
Q. Mutual exclusion implies that
a. if a process is executing in its critical section, then no other process must be executing in their critical sections
b. if a process is executing in its critical section, then other processes must be executing in their critical sections
c. if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
d. none of the mentioned
Q. Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
a. after a process has made a request to enter its critical section and before the request is granted
b. when another process is in its critical section
c. before a process has made a request to enter its critical section
d. none of the mentioned
Q. A minimum of variable(s) is/are required to be shared between processes to solve the critical section problem.
a. one
b. two
c. three
d. four
Q. In the bakery algorithm to solve the critical section problem
a. each process is put into a queue and picked up in an ordered manner
b. each process receives a number (may or may not be unique) and the one with the lowest number is served next
c. each process gets a unique number and the one with the highest number is served next
d. each process gets a unique number and the one with the lowest number is served next
Q. TestAndSet instruction is executed
a. after a particular process
b. periodically
c. atomically
d. none of the mentioned