OS Objective Multiple Choice
OS Objective Multiple Choice
OS Objective Multiple Choice
4. To access the services of the operating system, the interface is provided by the ___________
a) Library
b) System calls
c) Assembly instructions
d) API
7. Which one of the following errors will be handle by the operating system?
a) lack of paper in printer
b) connection failure in the network
c) power failure
d) all of the mentioned
9. If a process fails, most operating system write the error information to a ______
a) new file
b) another running process
c) log file
d) none of the mentioned
10. Which one of the following is not a real time operating system?
a) RTLinux
b) Palm OS
c) QNX
d) VxWorks
13. In a timeshare operating system, when the time slot assigned to a process is completed, the process
switches from the current state to?
a) Suspended state
b) Terminated state
c) Ready state
d) Blocked state
14. Cascading termination refers to the termination of all child processes if the parent process terminates
______
a) Normally or abnormally
b) Abnormally
c) Normally
d) None of the mentioned
15. When a process is in a “Blocked” state waiting for some I/O service. When the service is completed, it
goes to the __________
a) Terminated state
b) Suspended state
c) Running state
d) Ready state
17. The portion of the process scheduler in an operating system that dispatches processes is concerned
with ____________
a) assigning ready processes to waiting queue
b) assigning running processes to blocked queue
c) assigning ready processes to CPU
d) all of the mentioned
20. A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait
condition can never exist.
a) operating system
b) resources
c) system storage state
d) resource allocation state
6 What is the time difference between the first response and arrival time called?
a) Burst Time (BT) b) Turn Around Time (TAT)
c) Response Time (RT) d) Waiting Time (WT)
8 Which of the following page replacement algorithms suffers from the Belady’s Anomaly?
9 In the Banker’s algorithm for resource allocation, deadlock avoidance is achieved by:
a) Allocating resources based on the highest priority b) Using a global resource allocation strategy
c) Implementing the Wait-Die algorithm
d) Ensuring that the system is always in a safe state