Operating System MCQ and Answers – Real Time CPU Scheduling

These Operating System MCQ and Answers – Real Time CPU Scheduling are asked in various examinations including BCA, MCA, GATE, and other tests. The questions based on the below Operating System MCQ and Answers – Real Time CPU Scheduling test your basic knowledge of MCQs on the topic of Operating Systems and the level of comprehension and grasp that you hold.

Operating System MCQ and Answers – Real Time CPU Scheduling

1. Using EDF algorithm practically, it is impossible to achieve 100 percent utilization due to __________

a) the cost of context switching

b) interrupt handling

c) power consumption

d) all of the mentioned

Answer: a

2. T shares of time are allocated among all processes out of N shares in __________ scheduling algorithm.

a) rate monotonic

b) proportional share

c) earliest deadline first

d) none of the mentioned

Answer: b

3. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares.

A will have ______ percent of the total processor time.

a) 20

b) 15

c) 50

d) none of the mentioned

Answer: c

4. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares.

B will have ______ percent of the total processor time.

a) 20

b) 15

c) 50

d) none of the mentioned

Answer: b

5. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares.

C will have ______ percent of the total processor time.

a) 20

b) 15

c) 50

d) none of the mentioned

Answer: a

6. If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares.

If a new process D requested 30 shares, the admission controller would __________

a) allocate 30 shares to it

b) deny entry to D in the system

c) all of the mentioned

d) none of the mentioned

Answer: b

7. To schedule the processes, they are considered _________

a) infinitely long

b) periodic

c) heavy weight

d) light weight

Answer: b

8. If the period of a process is ‘p’, then what is the rate of the task?

a) p2

b) 2*p

c) 1/p

d) p

Answer: c

9. The scheduler admits a process using __________

a) two phase locking protocol

b) admission control algorithm

c) busy wait polling

d) none of the mentioned

Answer: c

10. The ____________ scheduling algorithm schedules periodic tasks using a static priority policy with preemption.

a) earliest deadline first

b) rate monotonic

c) first cum first served

d) priority

Answer: b

11. Rate monotonic scheduling assumes that the __________

a) processing time of a periodic process is same for each CPU burst

b) processing time of a periodic process is different for each CPU burst

c) periods of all processes is the same

d) none of the mentioned

Answer: a

12. In rate monotonic scheduling, a process with a shorter period is assigned __________

a) a higher priority

b) a lower priority

c) higher & lower priority

d) none of the mentioned

Answer: a

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

Answer: a

14. If a set of processes cannot be scheduled by rate monotonic scheduling algorithm, then __________

a) they can be scheduled by EDF algorithm

b) they cannot be scheduled by EDF algorithm

c) they cannot be scheduled by any other algorithm

d) none of the mentioned

Answer: c

15. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is?

a) 0.90

b) 0.74

c) 0.94

d) 0.80

Answer: c

16. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. Can the processes be scheduled without missing the deadlines?

a) Yes

b) No

c) Maybe

d) None of the mentioned

Answer: b

17. Earliest deadline first algorithm assigns priorities according to ____________

a) periods

b) deadlines

c) burst times

d) none of the mentioned

Answer: b

18. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35. The total CPU utilization is ____________

a) 0.90

b) 0.74

c) 0.94

d) 0.80

Answer: c

19. A process P1 has a period of 50 and a CPU burst of t1 = 25, P2 has a period of 80 and a CPU burst of 35., the priorities of P1 and P2 are?

a) remain the same throughout

b) keep varying from time to time

c) may or may not be change

d) none of the mentioned

Answer: b

Comments