OS MCQ
OS MCQ
OS MCQ
2. To access the services of operating system, the interface is provided by the ___________
a) System calls
b) API
c) Library
d) Assembly instructions
Answer: c) kernel is made of various modules which can not be loaded in running operating system
5. If a process fails, most operating system write the error information to a ______
a) log file
b) another running process
c) new file
d) none of the mentioned
Answer: d) Palm OS
7. In Unix, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned
Answer: a) fork
Answer: b
10. Which system call returns the process identifier of a terminated child?
a) wait
b) exit
c) fork
d) get
Answer: a
11. The address of the next instruction to be executed by the current process is provided by the
__________
a) CPU registers
b) Program counter
c) Process stack
d) Pipe
Answer: b
12. The number of processes completed per unit time is known as __________
a) Output
b) Throughput
c) Efficiency
d) Capacity
Answer: b
13. Which of the following is not the state of a process?
a) New
b) Old
c) Waiting
d) Running
Answer: b
Answer: b
Answer: d
Explanation: None.
Answer: a
Explanation: None.
Answer: a
Explanation: None.
18. What is a medium-term scheduler?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned
View Answer
Answer: c
Explanation: None.
Answer: b
20. The primary distinction between the short term scheduler and the long term scheduler is
__________
a) The length of their queues
b) The type of processes they schedule
c) The frequency of their execution
d) None of the mentioned
View Answer
Answer: c
21. 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
View Answer
Answer: b
22. If a process is executing in its critical section, then no other processes can be executing in their
critical section. This condition is called?
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
View Answer
Answer: a
Explanation: None.
Answer: c
Answer: a
Explanation: None.
Answer: c
Answer: c
Answer: d
28. The initial program that is run when the computer is powered up is called __________
a) boot program
b) bootloader
c) initializer
d) bootstrap program
View Answer
Answer: d
Answer: b
Answer: a
31. Which module gives control of the CPU to the process selected by the short-term scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned
View Answer
Answer: a
32. The processes that are residing in main memory and are ready and waiting to execute are kept on a
list called _____________
a) job queue
b) ready queue
c) execution queue
d) process queue
View Answer
Answer: b
33. The interval from the time of submission of a process to the time of completion is termed as
____________
a) waiting time
b) turnaround time
c) response time
d) throughput
View Answer
Answer: b
34. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared
with the priority of ____________
a) all process
b) currently running process
c) parent process
d) init process
View Answer
Answer: b
Explanation: None.
Answer: b
Answer: d
Answer: a
38. Which one of the following can not be scheduled by the kernel?
a) kernel level thread
b) user level thread
c) process
d) none of the mentioned
View Answer
Answer: b
Answer: c
Answer: d
Answer: b
42. With round robin scheduling algorithm in a time shared system ____________
a) using very large time slices converts it into First come First served scheduling algorithm
b) using very small time slices converts it into First come First served scheduling algorithm
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm
View Answer
Answer: a
44. The real difficulty with SJF in short term scheduling is ____________
a) it is too good an algorithm
b) knowing the length of the next CPU request
c) it is too complex to understand
d) none of the mentioned
View Answer
Answer: b
Answer: a
46. A problem encountered in multitasking when a process is perpetually denied necessary resources is
called ____________
a) deadlock
b) starvation
c) inversion
d) aging
View Answer
Answer: b
Answer: a
Answer: c
49. A deadlock can be broken by ____________
a) abort one or more processes to break the circular wait
b) abort all the process in the system
c) preempt all resources from all processes
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
50. If we preempt a resource from a process, the process cannot continue with its normal execution and
it must be ____________
a) aborted
b) rolled back
c) terminated
d) queued
View Answer
Answer: b
Answer: a
Explanation: None.
52. CPU fetches the instruction from memory according to the value of ____________
a) program counter
b) status register
c) instruction register
d) program status word
View Answer
Answer: a
Answer: c
54. Program always deals with ____________
a) logical address
b) absolute address
c) physical address
d) relative address
View Answer
Answer: a