Operating System Interview Questions

Q16. Long term scheduler are also known as
(a) CPU scheduler
(b) Job scheduler
(c) Device scheduler
(d) Event scheduler

Q17. When a process terminates then all its children must also be terminated. This phenomenon is called
(a) Progressive termination
(b) Recursive termination
(c) Cascading termination
(d) Followup termination

Q18. The many-to-one model maps many user-level threads to one
(a) Kernel thread
(b) User thread
(c) Memory thread
(d) Batch thread

Q19. The approach in which one thread immediately terminates the target thread is known as ___________ cancellation
(a) Deferred
(b) Asynchronous
(c) Synchronous
(d) Multithread

Q20. The target thread periodically checks whether it should terminate, allowing it an opportunity to terminate itself in an orderly fashion is ___________ cancellation
(a) Deferred
(b) Random
(c) Synchronous
(d) Multithread

Q21. The target thread periodically checks whether it should terminate, allowing it an opportunity to terminate itself in an orderly fashion is ___________ cancellation
(a) Deferred
(b) Random
(c) Synchronous
(d) Multithread

Q22. Which one is a major problem with priority scheduling algorithm
(a) Restriction
(b) Timing
(c) Starvation
(d) Differentiation

Q23. A solution to the problem of starvation of low-priority processes is
(a) Aging
(b) Deadlock
(c) Scheduling
(d) Priority

Q24. Which one scheduling algorithm is designed especially for time sharing systems
(a) First-come, first-served scheduling
(b) Shortest Remaining time
(c) Preemptive priority Scheduling
(d) Round-robin scheduling

Q25. Push migration and pull migration are two types of ________ approach
(a) Load balancing
(b) Processor Affinity
(c) Symmetric Multithreading
(d) Synchronous Multithreading

Q26. Two general approaches are used to handle critical sections in operating systems which are preemptive and nonpreemptive ________
(a) user
(b) kernels
(c) pipes
(d) memory

Q27. A _______ is a technique for passing information from one program process to another
(a) job
(b) pipe
(c) user
(d) network

Q28. The value of a binary semaphore can range between
(a) 0 and 1
(b) -1 and 1
(c) 1 and 2
(d) 0 and 2

Q29. Binary semaphores are also known as
(a) Simple locks
(b) Boolean locks
(c) Mutex locks
(d) Simplex lock

Q30. A collection of instructions (or operations) that performs a single logical function is called a
(a) Job
(b) Events
(c) Transaction
(d) Schedule

___________________________________________________________________________