Operating System MCQs with Answers Set 2

operating system mcqs nts

Operating system MCQs with answers Set 2. Every computer job competitive exam test includes operating system MCQ questions. So every candidate must prepare operating system objective questions before appearing in the exam. This OS MCQ set includes MCQs related to OS topics such as process, process control block, scheduling algorithms such as SJF, FCFS, Round-Robin and process states such as ready queue, waiting queue, I/O states etc..

Operating System MCQs with Answers Set 2

1. System programs such as compilers are designed so that they are _____?
A). Serially usable
B). Re-enterable
C). Non reusable
D). Recursive
View Answer
Correct: B


2. A process is put into wait state when _____?
A). It requests for a service that OS is not ready to perform
B). Waiting for a process to provide some input
C). It requests for a resources that is busy
D). All of these
View Answer
Correct: D


3. A scheduler that selects a swapped out process and puts it into the ready queue is known as ____?
A). Short level scheduler
B). Medium level scheduler
C). Long level scheduler
D). None of these
View Answer
Correct: B


4. When does a context switch occur _____?
A). When an error occurs in a running program
B). When a process makes a system call
C). When an external interrupt occurs
D). All of these
View Answer
Correct: D


5. Which one of the following statements is not true?
A). kernel is made of various modules which can not be loaded in running operating system
B). kernel remains in the memory during the entire computer session
C). kernel is the first part of operating system to load into memory during booting
D). kernel is the program that constitutes the central core of the operating system
View Answer
Correct: A


6. A process that has many short CPU bursts is called a _____?
A). I/O and CPU burst cycle
B). CPU bound process
C). I/O bound process
D). None of the above
View Answer
Correct: C


7. An operating system module that performs context switching is called _____?
A). Context switcher
B). Dispatcher
C). CPU scheduler
D). None of these
View Answer
Correct: B


8. A program is _____?
A). An active entity
B). Passive entity
C). Another name for process
D). All of these
View Answer
Correct: A


9. A process control block should contain _____?
A). Process ID
B). A list of all open files
C). Location to store register value
D). All of these
View Answer
Correct: D


10. If a process fails, most operating system write the error information to a _____?
A). Another running process
B). New file
C). Log file
D). None of the above
View Answer
Correct: C


11. The _____ of a process contains temporary data such as function parameters, return addresses, and local variables.
A). Program Counter
B). Stack
C). Text Section
D). Data Section
View Answer
Correct: B


12. The following are valid process states _____?
A). Terminating, Waiting, Threshing
B). Next, Running, Halting
C). Running, Blocked, Waiting
D). None of these
View Answer
Correct: C


13. The list of processes waiting for a particular I/O device is called _____?
A). Ready queue
B). Standby queue
C). Interrupt queue
D). Device queue
View Answer
Correct: D


14. Long-term scheduling is performed _____?
A). Typically on submitted jobs
B). When processes must be moved from waiting to ready state
C). On processes in the ready queue
D). All of these
View Answer
Correct: A


15. Which facility dynamically adds probes to a running system, both in user processes and in the kernel?
A). DLocate
B). DMap
C). DAdd
D). DTrace
View Answer
Correct: D


16. Medium term scheduling is performed _____?
A). When processes must be moved from waiting to ready state
B). Typically on submitted jobs
C). On processes in the ready queue
D). None of these
View Answer
Correct: A


17. _____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.
A). SJF
B). FCFS
C). Round Robin
D). Multilevel queue
View Answer
Correct: A


18. Assume there are 4 processes in the system running or ready to run. If round robin scheduling algorithm with a time quantum of 15 ms is used, then a waiting process will not wait more than ______?
A). 15 ms
B). 34 ms
C). 45 ms
D). 60 ms
View Answer
Correct: C


19. In which of the following scheduling algorithms, starvation is possible?
A). First come first serve
B). Multi-level queue scheduling
C). Round robin
D). All of these
View Answer
Correct: B


20. In operating system, each process has its own _____?
A). Open files
B). Address space and global variables
C). Pending alarms, signals and signal handlers
D). All of these
View Answer
Correct: D


21. The SJF algorithm executes first the job _____?
A). That last entered the queue
B). With the least processor needs
C). That first entered the queue
D). That has been in the queue the longest
View Answer
Correct: B


22. The _____ scheduling algorithm is designed especially for time sharing systems.
A). FCFS
B). SJF
C). Round Robin
D). Multilevel queue
View Answer
Correct: C


23. Which of the following scheduling algorithms must be non-preemptive?
A). FCFS
B). Priority algorithm
C). Round Robin
D). SJF
View Answer
Correct: A


24. _____ takes a particular predetermined workload and defines the performance of each method for that workload.
A). Aging
B). Queueing model
C). Deterministic modeling
D). Real-time scheduling
View Answer
Correct: C


25. What is the ready state of a process?
A). When process is scheduled to run after some execution
B). When process is using the CPU
C). When process is unable to run until some task has been completed
D). None of the above
View Answer
Correct: A


Read also>->>Operating System MCQs Set 1

Post a Comment

0 Comments