Operating System MCQ-3

1. Process synchronization can be done on-

(A) Hardware level
(B) Software level
(C) Both (a) and (b)
(D) None

2. Which of the following do not belong to queues for processes?

(A) Job Queue
(B) PCB Queue
(C) Device Queue
(D) Ready Queue

3. In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :

(A) Blocked State
(B) Ready State
(C) Suspended State
(D) Terminated State

4. A process control block (PCB) does not contain which of the following

(A) Code
(B) State
(C) Bootstrap Program
(D) Data

5. ______ is an example of an operating system that support single user process and single thread.

(A) Unix
(B) MS-DOS
(C) OS/2
(D) Windows 2000

6. Which of the following is not the state of a process ?

(A) New
(B) Old
(C) Waiting
(D) Running

7. The segment of code in which the process may charge common variable, update, tables write into file is known as –

(A) Program
(B) Critical Section
(C) Non-critical Section
(D) Synchronizing

8. Conditions must be satisfied to solve the critical section.

(A) Mutual Exclusion
(B) Prograss
(C) Bounded wait
(D) All of the above

9. The request and release of resources are-

(A) Command line statements
(B) Interrupts
(C) System calls
(D) Special Program

10. For sharable resources, mutual exclusion-

(A) is required
(B) is not required
(C) May be or may not be required
(D) None of the above

11. Virtual memory is normally implemented by –

(A) Demand paging
(B) Buses
(C) Virtualization
(D) All of the above

12. A page fault occurs when

(A) A page gives inconsistant data
(B) A page cannot be accessed due to its absence from memory
(C) A page is invisible
(D) All of the above

13. Which of the following page replacement algorithms suffers from Belayd’s Anomaly?

(A) Otimum Replacement
(B) LRU
(C) FIFO
(D) Both (a) and (c)

14. A process refers to 5 pages ABCDE in order ABCDABEABCDE. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is :

(A) 8
(B) 10
(C) 9
(D) 7

15. ______ refers to the ability of an operating system to support multiple threads of execution with a single process.

(A) Multithreading
(B) Multiprocessing
(C) Multiexecuting
(D) Bi-threading

16. Which are of the following is deadlock avoidance algorithm?

(A) Banker’s algorithm
(B) Round-robin algorithm
(C) Elevator algorithm
(D) Karn’s algorithm

17. To differentiate the many network services a system supports ______ are used.

(A) Variables
(B) Sockets
(C) Ports
(D) Services names

18. RPC provides a(an) ______ on the client side, a separate one for each remote procedure.

(A) Stub
(B) Identifier
(C) Name
(D) Process identifier

19. The full form of RMI :

(A) Remote Method Invocation
(B) Remote Method Installation
(C) Remote Memory Installation
(D) Remote Memory Invocation

20. A solution to the problem of external fragmentation is :

(A) Large memory size
(B) Compaction
(C) Smaller memory size
(D) None