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

Answer: (a).Kernel thread

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

Answer: (b).Asynchronous

523. 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

Answer: (a).Deferred

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

Answer: (c).Starvation

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

Answer: (a).Aging

526. 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

Answer: (d).Round-robin scheduling

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

Answer: (a).Load balancing

528. 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

Answer: (b).kernels

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

Answer: (b).pipe

530. 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

Answer: (a).0 and 1