Bihar SBTE Polytechnic Diploma Computer Science & Engineering 3rd Sem Dec 2019 Operating System Paper
| Sr. No. | Questions with options |
| 1 | Process synchronization can be done on
(a) hardware level (b) software level (c) both (a) & (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) Stack (c) Bootstrap Program (d) Data |
| 5 | Which number of processes completed per unit time is known as
(a) Output (b) Throughput (c) Efficiency (d) Capacity |
| 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 system (d) Synchronizing |
| 8 | Conditions must be satisfied to solve the critical section
(a) Mutual exclusion (b) Progress (c) Bounded wait (d) All 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 above |
| 12 | A page fault occurs when
(a) A page gives inconsistent data (b) A page cannot be accessed due to its absence from memory (c) A page is invisible (d) All of above |
| 13 | Which of the following page replacement algorithms suffers from Belayd’s Anomaly?
(a) Optimum 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 | The circular wait condition can be prevented by –
(a) Defining a linear ordering of resource types (b) Using thread (c) Using pipes (d) Above all |
| 16 | Which are of the following is dead lock 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 of the above |
| Data Collected By – K. Jeyanthi | |
| Published On – 21st April 2022 | |
Leave a Reply