Operating Systems Concepts MCQs with answers
21. The “unit of dispatching” is usually, referred to as, a: ___________________?
A) Process
B) Thread
C) Both A and B
D) Lightweight process
see answer
C) Both A and B
22. An “operating system” that support, single user, process and, single thread,.
A) os/2
B) Windows 2000
C) UNIX
D) MS-DOS
see answer
D) MS-DOS
23. State “true or false” in the, following:
i) Unix, support multiple, user process but, only support, one thread per, process.
ii) A java run, time environment, is an example of, a system of, one process with, multiple, threads.
A) True, False
B) True, True
C) False, True
D) False, False
see answer
A) True, False
24. ________________________ are very, effective because, a mode switch, is not required, to switch from, one thread, to another,.
A) Alterable threads
B) Application level threads
(C) Kernel-level threads
(D) User-level threads
see answer
(D) User-level threads
25._________________________ is a condition, in which there, is a set of “concurrent processes”, only one of which, is able to access, a given resource, or perform a, given function, at any time,.
(A) Deadlock
(B) Starvation
(C) Mutual Exclusion
(D) Busy Waiting
see answer
(C) Mutual Exclusion
26. ___________________________ Techniques, can be used, to resolve conflicts, such, as competition, for resources, and, to ”synchronize processes” so that they, can cooperate.
(A) Deadlock
(B) Starvation
(C) Mutual Exclusion
(D) Busy Waiting
see answer
(C) Mutual Exclusion
27. _________________ Can’ be defined as the’ permanent blocking’ of a set of’ processed that ‘either complete’ for system’ resources or ‘communicate with’ each other’.
(A) Starvation
(B) Mutual exclusion
(C) Deadlock
(D) Permanent lock
see answer
(C) Deadlock
28. The conditions, of policy must be, present for, a deadlock, to be possible,.
i) No preemption
ii) Circular wait
iii) Mutual exclusion
iv) Hold and wait
A) i, ii and iv only
B) All i, i, iii and iv
C) i, ii and ii orly
D) ii, ii and iv only
see answer
B) All i, i, iii and iv
29. A “direct method” of deadlock, prevention is, to prevent, the occurrence, of ______________________.
(A) Circular waits
(B) No preemption
(C) Mutual exclusion
(D) Hold and wait
see answer
(A) Circular waits
30. State true, of false. With paging, each process, is divided into, relatively small, fixed-size, pages.
A) False, True
B) False, False
C) True, False
(D) True, True
see answer
(D) True, True