Explore topic-wise MCQs in Operating System.

This section includes 67 Mcqs, each offering curated multiple-choice questions to sharpen your Operating System knowledge and support exam preparation. Choose a topic below to get started.

51.

In addressing, a many to one relationship is useful for

A. Client Interaction
B. Client/Server Interaction
C. Server Interaction
D. None
Answer» C. Server Interaction
52.

Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned.Method used by P1 :while(S1==S2);Critical sectionS1 = S2; Method used by P2 :while(S1!=S2);Critical sectionS2 = not(S1);Which of the following statements describes properties achieved ?

A. Mutual exclusion but not progress
B. Progress but not mutual exclusion
C. Neither mutual exclusion nor progress
D. Both mutual exclusion and progress
Answer» E.
53.

The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0.Process P0while(true){wait(S0);print '0';release(S1);release(S2);} Process P1wait(S1);release(S0); Process P2wait(S2);release(S0);How many times will P0 print ‘0’ ?

A. At least twice
B. Exactly twice
C. Exactly thrice
D. Exactly once
Answer» B. Exactly twice
54.

................. is the ability of multiple process to co-ordinate their activities by exchange of information.

A. Synchronization
B. Mutual Exclusion
C. Dead lock
D. Starvation
Answer» B. Mutual Exclusion
55.

What is said to happen when the result of computation depends on the speed of the processes involved?

A. A deadlock
B. A time lock
C. Cycle stealing
D. Race condition
Answer» E.
56.

Which is the device that should get the highest priority in assigning the interrupts?

A. Floppy disk
B. Hard disk
C. CPU temperature sensor
D. Keyboard
Answer» D. Keyboard
57.

In message a set of concurrent processes share a

A. Letter
B. Text
C. Mailbox
D. None
Answer» D. None
58.

The section of code which accesses shared variables is called as __________.

A. Critical section
B. Block v
C. Procedure
D. Semaphore
Answer» B. Block v
59.

The degree of multi-programming is :

A. the number of processes executed per unit time
B. the number of processes in the ready queue
C. the number of processes in the I/O queue
D. the number of processes in memory
Answer» E.
60.

_________ page replacement algorithm suffers from Belady's anamoly.

A. LRU
B. MRU
C. FIFO
D. LIFO
Answer» D. LIFO
61.

A binary semaphore

A. has the values one or zero
B. is essential to binary computers
C. is used only for synchronization
D. is used only for mutual exclusion
Answer» B. is essential to binary computers
62.

Semaphore can be used for solving __________.

A. Wait & signal
B. Deadlock
C. Synchronization
D. Priority
Answer» D. Priority
63.

Mutual exclusion

A. if one process is in a critical region others are excluded
B. prevents deadlock
C. requires semaphores to implement
D. is found only in the Windows NT operating system
Answer» B. prevents deadlock
64.

Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n) ____.

A. Shared Memory Segments
B. Entry Section
C. Race condition
D. Process Synchronization
Answer» D. Process Synchronization
65.

Inter process communication can be done through __________.

A. Mails
B. Messages
C. System calls
D. Traps
Answer» C. System calls
66.

TO_ENABLE_A_PROCESS_TO_WAIT_WITHIN_THE_MONITOR,?$

A. a condition variable must be declared as condition
B. condition variables must be used as boolean objects
C. semaphore must be used
D. all of the mentioned
Answer» B. condition variables must be used as boolean objects
67.

A monitor is a module that encapsulate?

A. shared data structures
B. procedures that operate on shared data structure
C. synchronization between concurrent procedure invocation
D. all of the mentioned
Answer» E.