Os MCQ Unit1 Updated
Os MCQ Unit1 Updated
Os MCQ Unit1 Updated
answers:
3. Which state does a process enter when it is waiting for an I/O operation to
complete?
A) Ready
B) Waiting
C) Running
D) Terminated
Answer: B) Waiting
10. In Round Robin scheduling, if the time quantum is too small, the algorithm
will:
A) Act like First-Come, First-Served
B) Cause high context switching overhead
C) Cause low CPU utilization
D) Minimize response time
Answer: B) Cause high context switching overhead
17. Which of the following IPC methods allows two processes to send messages
to each other?
A) Shared Memory
B) Message Passing
C) Paging
D) Swapping
Answer: B) Message Passing
1. Which of the following multithreading model maps many user threads to one
kernel thread?
A) Many-to-One
B) One-to-One
C) Many-to-Many
D) Two-Level Model
Answer: A) Many-to-One
2. In the One-to-One multithreading model, how are user threads mapped to
kernel threads?
A) One user thread maps to many kernel threads
B) One user thread maps to one kernel thread
C) Many user threads map to one kernel thread
D) Many user threads map to many kernel threads
Answer: B) One user thread maps to one kernel thread
10. In thread scheduling, what is the main difference between user-level and
kernel-level threads?
A) User-level threads are managed by the OS
B) Kernel-level threads have higher priority
C) User-level threads are managed without OS intervention
D) Kernel-level threads are slower to create and manage
13. The model in which one user-level thread is mapped to many kernel level
threads is called ________.
A) Many to One model B) One to Many model
C) Many to Many model D) One to One model
Answer: B)
14. Which scheduling algorithm assigns a fixed time slice to each process?
A) First-Come, First-Served B) Shortest Job First
C) Round Robin D) Priority Scheduling
Answer: C)