Operating System
CPU Scheduling
Q.

There are two processes P1 and P2, whose periods are 50 and 100 respectively. P1 is assigned higher priority than P2. The processing times are t1 = 20 for P1 and t2 = 35 for P2. Is it possible to schedule these tasks so that each meets its deadline using Rate monotonic scheduling?
A.  yes B.  no C.  maybe D.  none of the mentioned
Similar Questions
1. Which module gives control of the CPU to the process selected by the short-term scheduler?
A.  dispatcher B.  interrupt C.  scheduler D.  none of the mentioned
2. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called _____________
A.  job queue B.  ready queue C.  execution queue D.  process queue
3. The interval from the time of submission of a process to the time of completion is termed as ____________
A.  waiting time B.  turnaround time C.  response time D.  throughput
4. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
A.  

first-come, first-served scheduling

 B.  shortest job scheduling C.  priority scheduling D.  none of the mentioned
5. In priority scheduling algorithm ____________
A.  CPU is allocated to the process with highest priority B.  CPU is allocated to the process with lowest priority C.  Equal priority processes can not be scheduled D.  None of the mentioned
6. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
A.  all process B.  currently running process C.  parent process D.  init process
7. Which algorithm is defined in Time quantum?
A.  shortest job scheduling algorithm B.  round robin scheduling algorithm C.  priority scheduling algorithm D.  multilevel queue scheduling algorithm
8. Process are classified into different groups in ____________
A.  shortest job scheduling algorithm B.  round robin scheduling algorithm C.  priority scheduling algorithm D.  multilevel queue scheduling algorithm
9. In multilevel feedback scheduling algorithm ____________
A.  a process can move to a different classified ready queue B.  classification of ready queue is permanent C.  processes are not classified into groups D.  none of the mentioned
10. Which one of the following can not be scheduled by the kernel?
A.  kernel level thread B.  user level thread C.  process D.  none of the mentioned
OPERATING SYSTEM TOPICS