Unit 2 - Week 0: Assignment 0

Real Time Operating System - - Unit 2 - week 0 https://onlinecourses-archive.nptel.ac.in/noc19_...
reviewer4@nptel.iitm.ac.in ▼
Courses » Real Time Operating System Announcements Course Ask a Question Progress FAQ
Unit 2 - week 0
Register for Certification
exam
Assignment 0
The due date for submitting this assignment has passed. Due on 2019-02-25, 23:59 IST.
Course outline As per our records you have not submitted this assignment.
How to access the 1) 1 point

portal
week 0
Quiz : Assignment 0
Week 1
Week 2
Week 3
Week 4
DOWNLOAD VIDEOS (a)
(b)
Text Transcript
(c)
Solution (d)
No, the answer is incorrect.

Score: 0
Accepted Answers:
(a)
2) 1 point
(a)
(b)
(c)
(d)

Score: 0
Accepted Answers:
(a)
3) 1 point
© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

A project of In association with Funded by
Powered by
1 of 4 Thursday 20 June 2019 01:44 PM

(c)
(d)

Score: 0
Accepted Answers:
(a)
4) 1 point
(a)
(b)
(c)
(d)

Score: 0
Accepted Answers:
(b)
5) 1 point
(a)
(b)
(c)
(d)

Score: 0
Accepted Answers:
(b)
6) 1 point
(a)
(b)
(c)
(d)

Score: 0

Accepted Answers:
(b)
7) 1 point
(a)
(b)
(c)
(d)

Score: 0
Accepted Answers:
(d)
8) 1 point
(a)
(b)
(c)
(d)

Score: 0
Accepted Answers:
(b)
9) 1 point
(a)
(b)
(c)
(d)

Score: 0
Accepted Answers:
(a)
10) 1 point

(a)
(b)
(c)
(d)

Score: 0
Accepted Answers:
(a)
End

Real Time Operating System - - Unit 3 - Week 1 https://onlinecourses-archive.nptel.ac.in/noc19_...
Courses » Real Time Operating System
Announcements Course Ask a Question Progress FAQ
Unit 3 - Week 1
Register for
Certification exam Assignment 1
The due date for submitting this assignment has passed.
Course As per our records you have not submitted this Due on 2019-03-13, 23:59 IST.
outline
assignment.
How to access 1) In a nuclear reactor control system, the request from a human operator for a report of 1 point
the portal various system parameters can be considered as a sporadic task.
week 0 a. True
b. False
Week 1
Lecture 1 :
Introduction Score: 0
Accepted Answers:
Lecture 2 :
Basics of Tast b. False
scheduling
2) The phase of a periodic task indicates the time of separation between the start of two 1 point
Lecture 3: consecutive instances of the task.
Cyclic
executives a. True
Lecture 4: b. False
Cyclic
Scheduler No, the answer is incorrect.
Score: 0
Lecture 5 :
Cyclic Accepted Answers:
Scheduler b. False
Week 1 Lecture
3) A cyclic scheduler is an example of an event-driven scheduler. 1 point
Material
Quiz : a. True
Assignment 1
b. False
Feedback for
Week 1 No, the answer is incorrect.
Score: 0
Week 2
Accepted Answers:
b. False
Week 3
4) The table size stored for a cyclic scheduler is usually much smaller than that stored for a 1 point

A project of In association with
Funded by

Accepted Answers:
Powered by
Solution
b. False
5) A good algorithm for scheduling of hard real-time tasks tries to complete each task in the 1 point
shortest possible time.
a. True
b. False

Score: 0
Accepted Answers:
b. False
6) Not all hard real-time systems are safety-critical in nature. 1 point
a. True
b. False

Score: 0
Accepted Answers:
a. True
7) The performance constraints on a real-time system help to ensure that the environment of 1 point
the system is well-behaved
a. True
b. False

Score: 0
Accepted Answers:
b. False
8) All soft real-time tasks do have associated time bounds 1 point
a. True
b. False

Score: 0
Accepted Answers:
a. True
9) The objective of any good real-time task scheduling algorithm is to minimize the average 1 point
response times of the tasks
a. True
b. False

Score: 0
Accepted Answers:
b. False
10)The goal of any good real-time operating system to complete every hard real-time task as 1 point
ahead of its deadline as possible
a. True
b. False


Score: 0
Accepted Answers:
b. False
Previous Page End

Unit 4 - Week 2
Register for
outline
assignment.
How to access 1) Cyclic schedulers do not require storing a precomputed schedule unlike table-driven 1 point
the portal schedulers.
week 0 a. True
b. False
Week 1
Week 2 Score: 0
Lecture 6: Accepted Answers:

Exercises on b. False
Frame size
Selection 2) The upper bound on achievable utilization improves as the number of tasks in the system 1 point
being developed increases when RMA is used for scheduling a set of hard real-time periodic tasks.
Lecture 7 :
Event-driven
schedulers a. True
Lecture 8 : b. False
Rate Monotonic
Algorithm
Score: 0
Lecture 9 :
Accepted Answers:
RMA Task
Schedulability b. False
Lecture 10 : 3) For a non-preemptive operating system, RMA is an optimal static priority scheduling 1 point
Rate Monotonic algorithm for a set of periodic real-time tasks.
Analysis
Week 2 Lecture
a. True
Material b. False
Quiz :
Assignment 2
Score: 0
Feedback for
Accepted Answers:
Week 2
b. False
Week 3
Funded by

Score: 0 Powered by
Text Transcript
Accepted Answers:
Solution a. True
5) While scheduling a set of hard real-time periodic tasks using a cyclic scheduler, if more 1 point
than one frame satisfies all the constraints on frame size then the largest of these frame sizes should
be chosen.
a. True
b. False

Score: 0
Accepted Answers:
a. True
6) EDF possesses good transient overload handing capability. 1 point
a. True
b. False

Score: 0
Accepted Answers:
b. False
7) Data dependencies determine the precedence ordering among a set of tasks. 1 point
a. True
b. False

Score: 0
Accepted Answers:
b. False
8) Scheduling decisions are made only at the arrival and completion of tasks in a 1 point
non-preemptive event-driven task scheduler
a. True
b. False

Score: 0
Accepted Answers:
a. True
9) For uniprocessor systems, determining an optimal schedule for a set of independent 1 point
periodic hard real-time tasks without any resource-sharing constraints under static priority conditions is
an NP-complete problem
a. True
b. False

Score: 0
Accepted Answers:
b. False
10)A set of periodic real-time tasks scheduled on a uniprocessor system using RMA 1 point
scheduling show similar completion time jitter

a. True
b. False

Score: 0
Accepted Answers:
a. True
Previous Page End

Unit 5 - Week 3
Register for
outline
assignment.
How to access 1) Suppose a task needs three non-preemptable shared resources CR1, CR2, and CR3 1 point
the portal during its computation. Under HLP (Highest Locker Protocol), once the task acquires one of its
required resources, it is guaranteed not to block for acquiring the other required resources.
week 0
a. True
Week 1
b. False
Week 2 No, the answer is incorrect.
Score: 0
Week 3
Accepted Answers:
Lecture 11 : a. True
RMA
Generalizations 2) RMA (Rate Monotonic Algorithm) is optimal for scheduling access of several hard real-time 1 point
periodic tasks to a certain shared critical resource.
Lecture 12 :
Further RMA
Generalizations
a. True
b. False
Lecture 13 :
Resource
Sharing among
Real-Time
Score: 0
Tasks Accepted Answers:
Lecture 14 :
b. False
Solution to
3) DMA (Deadline Monotonic Algorithm) may produce a feasible schedule even when RMA 1 point
Priority
Inversion fails to produce a feasible schedule.
Problem
a. True
Lecture 15 :
Highest Locker b. False
Protocol
Week 3 Lecture Score: 0
Material
Accepted Answers:
Quiz : a. True
Assignment 3
4)©If 2014 NPTEL
traditional - Privacysharing
resource & Terms - Honor Code
mechanisms - FAQs
such -
as semaphores and monitors are used for 1 point
Feedback for
A project of sharing the access of several real-time tasks to a single
In association with critical resource, neither unbounded priority
Week 3
inversions, nor deadlocks can occur.
Week 4
a. True
Funded by
DOWNLOAD b. False

VIDEOS No, the answer is incorrect.

Powered by
Score: 0
Text Transcript
Accepted Answers:
b. False
Solution
5) Assume that T1, T2, T3, and T4 are four periodic real-time tasks that are arranged in 1 point
decreasing order of their priority. That is T1 is the highest priority task and T4 is the lowest priority task.
The tasks share three non-preemptable resources for time durations as shown in the following
diagram. The maximum time duration for which T1 would undergo priority inversion, given that the
priority inheritance protocol (PIP) is used for controlling sharing of the resources among the
a. True
b. False

Score: 0
Accepted Answers:
b. False
6) Unless a suitable resource-sharing protocol is used, even the lowest priority real-time task 1 point
in a system may suffer unbounded priority inversions.
a. True
b. False

Score: 0
Accepted Answers:
b. False
7) Scheduling the access of a set of periodic hard real-time tasks to a set of non-preemptable 1 point
resources using PIP (Priority Inheritance Protocol) results in unbounded priority inversions for at least
some of the tasks
a. True
b. False

Score: 0
Accepted Answers:
b. False
8) In a typical implementation of HLP (Highest Locker Protocol), for each critical resource a 1 point
separate queue is maintained for the waiting tasks
a. True
b. False

Score: 0
Accepted Answers:
b. False
9) When HLP (Highest Locker Protocol) is used for sharing critical resources among a set of 1 point
periodic hard real-time tasks, deadlocks among the concerned tasks on account of resource sharing
cannot occur
a. True
b. False

Score: 0
Accepted Answers:
a. True
10)If a real-time system has two sporadic tasks that require computation times of 10 units and 1 point
20 units and have deadlines of 800 units and 500 units, then a polling server to handle these sporadic
tasks should have a computation time of 20units and period of 250 units
a. True
b. False

Score: 0
Accepted Answers:
a. True
Previous Page End

16/05/2018 Real Time Operating System - - Unit 2 - Week 1
Announcements Course Ask a Question Progress Mentor
Unit 2 - Week 1
Course
outline Assignment 1
How to access
the portal Submitted assignment
Week 1 1) Which one of the following is an important characteristic of a hard 1 point

real-time task and distinguishes hard real-time tasks from soft and firm real-
Lecture 1 : time tasks?
Introduction
The result produced by a task is discarded if produced after deadline
Lecture 2 :
Basics of Tast Application fails if the task produces result after its deadline
scheduling The utility of the result produced by a task decreases with time if the
Lecture 3: result is produced after the deadline
Cyclic The earlier is the result produced by a task, the higher is its utility.
executives
Lecture 4:
Score: 0
Cyclic
Scheduler Accepted Answers:
Application fails if the task produces result after its deadline
Lecture 5 :
Cyclic 2) Which one of the following is an important characteristic of a soft real- 1 point
Scheduler
time task and distinguishes it from hard and firm real-time tasks?
Week 1 Lecture
Material The result produced by the task is discarded if produced after deadline
Application fails if the task produces result after its deadline
Quiz :
Assignment 1 The utility of the result produced by a task decreases with time if the
result is produced after the deadline
Assignment-1
Solutions The utility of the result is independent of the time at which it is
produced.
Week 2
Week 3 Score: 0
Accepted Answers:
Week 4 The utility of the result produced by a task decreases with time if the result is
produced after the deadline
DOWNLOAD
VIDEOS 3) Which one of the following is an important characteristic of a firm 1 point
real-time task that distinguishes it from soft and hard real-time tasks?
The result produced by the task is discarded if produced after deadline

Application fails if the task produces a result after its deadline
Utility of the result produced by a task decreases with time if the result
is produced after the deadline
The earlier is the result produced by a task, the higher is its utility.
Score: 0
Accepted Answers:
https://onlinecourses.nptel.ac.in/noc18_cs12/unit?unit=5&assessment=36 1/3
The result produced by the task is discarded if produced after deadline
4) Which one of the following tasks can be considered to be a hard real- 1 point
time task?
Issue a book using a library management system

Withdraw cash from a bank ATM
Planning of the next step by a robot
Saving an opened file by a word processor

Score: 0
Accepted Answers:
Planning of the next step by a robot
5) Which one of the following is an important objective of a real-time 1 point
operating system?
Maximization of throughput

Guaranteeing fairness in task executions
Minimization of the response time of tasks
Production of the result of a task within a certain stipulated time period
Score: 0
Accepted Answers:
Production of the result of a task within a certain stipulated time period
6) Which one of the following is a satisfactory definition of the response 1 point
time of a job?
The time between a job becoming ready and the job completing
The time between a job starting to execute and the job completing
The time between a job becoming ready and the job being taken up for
execution
The total time a job waits before becoming ready
Score: 0
Accepted Answers:
The time between a job becoming ready and the job completing
7) Given that two tasks have different phases, which one of the 1 point
following can be inferred?
They have different periods

They have different execution times
Some of the instances of the two tasks may arrive exactly at the same
time
They have different deadlines
Score: 0
Accepted Answers:
Some of the instances of the two tasks may arrive exactly at the same time
8) For a periodic real-time task, which one of the following is true? 1 point
The absolute deadline changes for different task instances, but the
relative deadline is fixed
The relative deadline changes for different task instances, but the
absolute deadline is fixed
Both the relative deadline for different task instances, as well as the
absolute deadline are fixed
Both the relative deadline as well as the absolute deadline change for
different task instances
Score: 0
Accepted Answers:
The absolute deadline changes for different task instances, but the relative
deadline is fixed
9) Which one of the following is not true of a cyclic scheduler? 1 point
Computationally efficient
Takes very little memory space
Tolerant to changing execution times and periods of tasks
Can be used to schedule tasks with widely varying periods
Score: 0
Accepted Answers:
Tolerant to changing execution times and periods of tasks
10)Suppose a cyclic scheduler is used to schedule a set of periodic real-time tasks {Ti}. The 1 point
execution time, period, and deadline of a task Ti is given by <ei,Pi,di>. If the frame size chosen is F,
then which one of the following must be false?
F>max({ei})
F divides the major cycle
F –(gcd(F,Pi)/2) < di/2 for every task Ti
2×F – gcd(F,Pi) > di for every task Ti

Score: 0
Accepted Answers:
2×F – gcd(F,Pi) > di for every task Ti
Previous Page End

Funded by
Powered by
Announcements Course Ask a Question Progress Mentor
Unit 4 - Week 3
Course
outline Assignment 3
How to access
the portal Submitted assignment
Week 1 1) Consider a certain application in which two periodic real-time tasks 1 point
are to be run on a uniprocessor using a rate monotonic scheduler. What should
Week 2 be the maximum processor utilization due to the two tasks, if it is required that
the two tasks should run without missing any deadlines?
Week 3
0.88
Lecture 11 : 0.82
RMA
0.76
Generalizations
0.73
Lecture 12 :
Further RMA No, the answer is incorrect.
Generalizations Score: 0
Lecture 13 : Accepted Answers:
Resource 0.82
Sharing among
Real-Time 2) Suppose a single periodic real-time task is to be run on a uniprocessor 1 point
Tasks using a rate monotonic scheduler. For the task to run without missing any
Lecture 14 : deadlines, what should be the maximum processor utilization due the task?
Solution to
Priority 1
Inversion 0.88
Problem
0.82
Lecture 15 : 0.76
Highest Locker
Protocol No, the answer is incorrect.
Feedback for
Score: 0
Week 3 Accepted Answers:
Quiz :
1
Assignment 3
3) Consider a periodic task set whose characteristics are shown in the 1 point
Week 3 Lecture following table. Would this task set be schedulable on a uniprocessor under
Material rate monotonic scheduling based on the Liu-Layland criterion for determining
Assignment-3
schedulability?
Solutions Task Set (All data in milliseconds)
Week 4 Task Execution Time Period Deadline
Task1 20 100 100

DOWNLOAD
VIDEOS Task2 25 150 150
Task3 40 400 400
Not likely to be schedulable but no guarantee can be given
Likely to be schedulable but no guarantee can be given

Guaranteed to be schedulable
Guaranteed to be unschedulable
Score: 0
Accepted Answers:
Guaranteed to be schedulable
4) 4. Consider a set of three periodic real-time tasks that are to be run 1 point
on a uniprocessor using a rate monotonic scheduler. The task characteristics
are given in the following table. What would be the worst case completion time
for Task1?
Task Set (All data in milliseconds)
Task Phase Execution Time Period Deadline
Task1 200 20 100 100
Task2 150 25 150 150
Task3 100 20 50 50
20 milliseconds
40 milliseconds
60 milliseconds
70 milliseconds
Score: 0
Accepted Answers:
60 milliseconds
5) Consider an application in which a set of periodic real-time tasks 1 point
share a set of non-preemptable resources and are scheduled using a rate
monotonic scheduler. Which one of the following problems cannot be
completely prevented even when choice can be made from any of the
available resource sharing protocols?
Deadlock
Chain blocking
Priority inversion
Unbounded priority inversion
Score: 0
Accepted Answers:
Priority inversion
6) Which one of the following is the closest definition of a critical 1 point
section?
A piece of code in which a shared non-preemptable resource is

accessed by a task
Any non-preemptable resource
Any shared non-preemptable resource
A piece of code in which a shared serially-preemptable resource is
accessed by a task
Score: 0
Accepted Answers:
A piece of code in which a shared non-preemptable resource is accessed by a
task
7) Consider an application in which a set of periodic real-time tasks 1 point
share a set of non-preeemptable resources and are scheduled using a rate
monotonic scheduler incorporating the basic priority inheritance protocol.
Which one of the following problems cannot occur in this situation?
Deadlock
Chain blocking
Priority inversion
Score: 0
Accepted Answers:
8) Assume that four periodic real-time tasks T1, T2, T3, and T4 share three non- 1 point
preemptable resources R1, R2, and R3 as shown in the following diagram. The
time for which each task needs a resource is annotated on the arrow connecting the task
to the corresponding resource. The tasks are arranged in decreasing order of their
priorities, with T1 being the highest priority task and T4 the lowest priority task. The tasks
are scheduled using a rate monotonic scheduler incorporating the basic priority
inheritance protocol. Which tasks would undergo direct blocking?
T1, T2, and T4

T1 and T2
T2 and T4
T2 only
Score: 0
Accepted Answers:
T1 and T2
9) Assume that four periodic real-time tasks T1, T2, T3, and T4 share three non- 1 point
are scheduled using a rate monotonic scheduler incorporating the basic priority
inheritance protocol. What is the maximum duration for which the Task T2 would undergo
direct blocking?
5 units
2 units
10 units
It does not undergo any direct inversion
Score: 0
Accepted Answers:
10 units
10)Assume that four periodic real-time tasks T1, T2, T3, and T4 share three non- 1 point
are scheduled using a rate monotonic scheduler with the basic priority inheritance
protocol. The task T3 would undergo inheritance blocking due to which tasks?
T1
T2
T4
Both T2 and T4
Score: 0
Accepted Answers:
T4
Previous Page End

Funded by
Powered by

Unit 2 - Week 0: Assignment 0

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Unit 2 - Week 0: Assignment 0

Uploaded by

Copyright:

Available Formats

Real Time Operating System - - Unit 2 - week 0 https://onlinecourses-archive.nptel.ac.in/noc19_...

How to access the 1) 1 point

DOWNLOAD VIDEOS (a)

No, the answer is incorrect.

No, the answer is incorrect.

© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

1 of 4 Thursday 20 June 2019 01:44 PM

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

2 of 4 Thursday 20 June 2019 01:44 PM

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

3 of 4 Thursday 20 June 2019 01:44 PM

No, the answer is incorrect.

4 of 4 Thursday 20 June 2019 01:44 PM

Courses » Real Time Operating System

Announcements Course Ask a Question Progress FAQ

© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

1 of 3 Thursday 20 June 2019 01:45 PM

No, the answer is incorrect.

6) Not all hard real-time systems are safety-critical in nature. 1 point

No, the answer is incorrect.

No, the answer is incorrect.

8) All soft real-time tasks do have associated time bounds 1 point

No, the answer is incorrect.

No, the answer is incorrect.

2 of 3 Thursday 20 June 2019 01:45 PM

No, the answer is incorrect.

Previous Page End

3 of 3 Thursday 20 June 2019 01:45 PM

Courses » Real Time Operating System

Announcements Course Ask a Question Progress FAQ

Lecture 6: Accepted Answers:

1 of 3 Thursday 20 June 2019 01:45 PM

No, the answer is incorrect.

6) EDF possesses good transient overload handing capability. 1 point

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

2 of 3 Thursday 20 June 2019 01:45 PM

No, the answer is incorrect.

Previous Page End

3 of 3 Thursday 20 June 2019 01:45 PM

Courses » Real Time Operating System

Announcements Course Ask a Question Progress FAQ

1 of 3 Thursday 20 June 2019 01:46 PM

VIDEOS No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

2 of 3 Thursday 20 June 2019 01:46 PM

No, the answer is incorrect.

No, the answer is incorrect.

Previous Page End

3 of 3 Thursday 20 June 2019 01:46 PM

Courses » Real Time Operating System

Announcements Course Ask a Question Progress Mentor

Week 1 1) Which one of the following is an important characteristic of a hard 1 point