adplus-dvertising

Welcome to the Real Time Systems MCQs Page

Dive deep into the fascinating world of Real Time Systems with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Real Time Systems, a crucial aspect of Operating System. In this section, you will encounter a diverse range of MCQs that cover various aspects of Real Time Systems, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Operating System.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Real Time Systems. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Operating System.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Real Time Systems. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Real Time Systems MCQs | Page 5 of 7

Q41.
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 :
Discuss
Answer: (b).deny entry to D in the system
Q42.
To schedule the processes, they are considered _________
Discuss
Answer: (b).periodic
Q43.
If the period of a process is ‘p’, then the rate of the task is :
Discuss
Answer: (c).1/p
Discuss
Answer: (c).busy wait polling
Q45.
The ____________ scheduling algorithm schedules periodic tasks using a static priority policy with preemption.
Discuss
Answer: (b).rate monotonic
Discuss
Answer: (a).processing time of a periodic process is same for each CPU burst
Q47.
In rate monotonic scheduling, a process with a shorter period is assigned :
Discuss
Answer: (a).a higher priority
Q48.
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 ?
Discuss
Answer: (a).yes
Discuss
Answer: (c).they cannot be scheduled by any other algorithm
Q50.
Can the processes in the previous question be scheduled without missing the deadlines ?
Discuss
Answer: (b).No
Page 5 of 7

Suggested Topics

Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!