H

M
Sl. Part-I
od BL CO PO & PSO
No Short Answer Type Questions
ule
1 What is real time system? 1

2 Define sensor and activator. 1

3 What is signal conditioning unit? State the different types of 1

conditioning carried out on raw signal.

4 Define fail safe state and safety critical system with examples. 1

5 State the different types of events in real time system. 1

6 Define performance constraints and behavioral constraints with 1

example.

7 Define delay, duration, and deadline constraints with example. 1

8 Discuss the different types of deadline constraints with example. 1

9 Explain why hardware fault tolerance is easier to achieve as compare 1

tom software fault tolerance.

10 Explain why safety and reliability are not independent issues in safety 1
critical hard real time system.
11 Define relative deadline and absolute deadline. 2
12 Define proficient scheduler, optimal scheduler, pre-emptive scheduler. 2
13 State the difference between cyclic and table-driven scheduler. 2
14 What is context switching overhead? 2
15 Define self-suspension and self-suspension with context switching 2
overhead.
16 Differentiate between clock driven and even driven scheduling. 2
17 State the constraints required to select appropriate frame size. 2
18 Is EDF a dynamic priority scheduling algorithm? 2
19 State the schedulability test for RMA. 2
20 Define valid schedule and feasible schedule and utilization. 2
21 Define task precedence and task instance. 2
22 How task jitters are handled. 2
23 Define priority inversion with example. 3
24 Define unbounded priority inversion with example. 3
25 State the resource grant rule of PCP protocol. 3
26 How deadlock is avoided in PCP? 3

27 How is unbounded priority inversion avoided in PCP? 3

28 How is chain blocking avoided in PCP? 3

29 Define multiprocessor task allocation. 3

30 What is fault tolerant scheduling in task? 3

31 What is clock synchronization? 3

32 Assume that the drift rate between any two clocks is restricted to 3
 ρ=5*10-6. Suppose we want to implement a synchronize set 6
distributed clocks using the central synchronization scheme, so that the
max. drift between any two clocks is restricted to €=1msec at any time.
Determine the period with which the clock needs to be resynchronized.
33 Let a distributed real time system have 10 clocks and it is required 3
restrict their max. drift to €= 1msec. let the max, drift of the clocks per
unit time (ρ) be 5*10-6. Determine the required synchronization
interval.
34 Define time services. 4
35 What are the difficulties in providing high resolution timer? 4
36 State the expression to recompute the priority of the task at the end of 4
the jth time slice by UNIX.
37 Briefly explain insufficient device driver support. 4
38 Briefly explain lack of real time file services. 4
39 State the differences between conventional database and real time data 4
base
40 State the ACID properties of concurrency control protocol. 4
41 What is temporal consistency? 4
42 What are the real time database application issues. 4
43 Define consistency constraints. 4
44 What is routing? State the primary goals of QoS routing. 5

45 What is resource reservation? 5

46 Define packet switch network. 5
47 Explain bandwidth and blocking probability. 5
48 What is soft real time and hard real time communication in LAN? 5

49 Explain calendar based protocol. 5

50 State the types of services provided by IntServ. 5
51 Prove that the minimum time required to complete tramission of a 5
frame using IEEE 802.5 protocol is max (F,Θ), where F is the frame
transmission time & Θ is the propagation time.
52 Prove that a higher priority packet might undergo inversion for atmost 5
2* max (F,Θ) time units.
M
Sl.
Focus short questions od BL CO PO & PSO
No
ule
1 Briefly discuss the basic model of real time system with block diagram. 1
2 State the characteristics of real time system. 1
3 How to achieve high reliability 1
4 State the methods to achieve hardware fault tolerance. 1
5 Differentiate between hard and soft real time task. 1
6 Define periodic, sporadic, and aperiodic task with example. 2
7 Define table driven scheduling. Explain schedule table and major cycle. 2
consider the following three task-(e1=5ms, p1=20ms), (e2=20ms,
p2=100ms), (e3=30ms, p3=250ms). Find the major cycle of given set of
tasks.
8 State the necessary and sufficient condition for EDF schedulability. 2
Also State the shortcomings of EDF algorithm.
9 State context switching overhead. 2
Check whether the following set of periodic real time tasks is scdulable
under RMA on a uniprocessor
 Task Execution Period (in
time (in ms) ms)

T1 20 100
T2 30 150
T3 90 200

Assume that context switching overhead doesnot exceed 1 ms and is

to be taken into account in schedulability computations.
10. Briefly explain self suspension . 2
Consider the following set of periodic real time tasks :-

Task Execution Period (in

time (in ms) ms)

T1 10 50
T2 25 150
T3 50 200
Assume that the self suspension times of T1, T2 and T3 are 3ms, 3 ms
and 5 ms respectively. Determine whether the task would meet their
respective deadlines , if scheduled using RMA.
11. State the necessary and sufficient condition for RMA schedulability. 2
Also State the shortcomings of RMA algorithm.
12. Define unbounded priority inversion with example and timing diagram. 3
Is it possible to overcome unbounded priority inversion.
13. Briefly explain priority inheritance protocol with diagram. state the 3
shortcomings of the protocol .
14. State the various resource sharing protocols and compare between 3
them.
15. Determine a feasible schedule for the real-time tasks of a task set 3
{T1,T2,……T5} for which the precedence relations have been shown
below for the use with a table-driven scheduler. The execution times
of the tasks T1,T2,….. T5 are: 7, 10, 5, 6, 2 and the corresponding
deadlines are 40, 50, 25, 20, 8, respectively.

16. State and explain two popular dynamic real time task allocation 3
algorithms.
17. Briefly explain centralized clock synchronization. 3
18 Prove that with a distributed system n clocks are single byzantine clock 3
can make two arbitrary clocks in a system to differ by 3€/n in time
value, where € represents the max. permissible drift between clocks.
19 Explain the activities that are carried out when a clock interrupt 4
occurs.
20. Explain timers and its types. 4
21. State the difference between windows NT and UNIX. 4
22. State the important features of windows NT. 4
23. Explain 2PL-HP concurrency control protocol.

24. Briefly explain temporal data and performance matrices. 4

25 Let a relative consistency set R be{ temp, pressure } and lat Rrvi be 2. 4
a. Are temp. ={347oc, 5msec, 95msec} and pressure={50bar,
10msec,97msec} are relatively consistent ?
b. Are temp. ={347oc, 5msec, 95msec} and pressure={50bar,
10msec,92msec} are relatively consistent?
26 Explain concurrency control in real time data base. 4

27 State speculative concurrency control. compare various concurrency 4

control protocol with diagram.

28 State the important categories of traffic categorization. 5

29 Briefly explain real time communication in LAN. 5

30 State the various LAN architectures. 5
31 What do you mean by routing algorithms? 5
32 What is multicast routing? 5
33 Briefly explain integrated services of QoS model. 55
34 Explain IEEE 802.5 protocol.
M
Sl.
Long Questions od BL CO PO & PSO
No
ule
1 State the applications of real time system. 1
2 State the method to achieve software fault tolerance. 1
3 Explain soft real time, hard real time, firm real time, and non-real time 1
task.
4 Construct the EFSM model of a telephone system whose (partial) 1
behaviour is described below After lifting the receiver handset, the dial
tone should appear within 20 sec. If a dial tone cannot be given within
20 sec, then an idle tone is produced. After the dial tone appears, the
first digit should to be dialed within 10 sec and the subsequent five
digits within 5 sec of each other. If the dialing of any of the digits is
delayed, then an idle tone is produced. The idle tone continues until
the receiver handset is replaced.
5 A cyclic scheduler is to be used to run the following set of periodic 2
tasks on a uniprocessor T 1 =( e1 =,1,p1 =4), T2 = (e2 = 1, p2 = 5) T3 =
(e3 = 1, p3= 20) , T4 = (e4= 2, p4 = 20).Select an appropriate frame
size.
6 Consider the following set of three independent real time periodic 2
tasks:

Task Start Execution Period Deadline

time(in ms) time (in ms) (in ms) (in ms)
 T1 20 25 150 140
T2 60 10 60 40
T3 40 20 200 120
T4 25 10 80 25

Determine whether the following set of periodic tasks is schedulable

on a uniprocessor using DMA(Deadline Monotonic Alogrithm). Show
all the intermediate steps in your computation.
7. Consider the following set of three independent real time periodic 2
tasks:

Task Execution Period Deadline

time (in ms (in ms) (in ms)

T1 25 150 100
T2 10 50 30
T3 50 200 150

Determine whether the following set of periodic tasks is schedulable

on a uniprocessor using EDF(Earliest Deadline First).Show all the
intermediate steps in your computation with the timing diagram.
8. Briefly explain foreground-background scheduler. 2
Consider a real time system in which tasks are scheduled using
foreground- background scheduling. There is only one periodic
foreground task Tf:( Øf =0,Pf =50 ms, Ef =100 ms, Df =100 ms) and the
background task be TB=(EB=1000 ms). Compute the completion time
for backgroung task.
9. Briefly explain self suspension . 2
Consider the following set of periodic real time tasks :-

Task Execution Period (in

time (in ms) ms)

T1 25 150
T2 10 50
T3 50 200
Assume that the self-suspension times of T1, T2 and T3 are 10ms, 20
ms and 15 ms respectively. Determine whether the task would meet
their respective deadlines , if scheduled using RMA. The context
switching overhead of 1 ms should be considered in your result. You
can assume that each task undergoes self-suspension only once
during each of its execution.
10. Consider the following set of three independent real time periodic 2
tasks:

Task Execution Period Deadline

time (in ms) (in ms) (in ms)

T1 20 100 100
T2 30 150 150
T3 90 200 200

Determine whether the following set of periodic tasks is

 schedulable on a uniprocessor using RMA(Rate Monotonic Algorithm)
by using Liu and Leyland’s criterion and Lehoczky’s test..Show all the
intermediate steps in your computation with the timing diagram.
11. State and explain highest locker protocol.state the sortcomings of the 3
above protocol.
12. Prove that – 3
“when HLP is used for resource sharing, once atask gets a resource
required by it , it is not blocked any further.” State the corollary of the
above theorm.
13. State and explain priory ceiling protocol. 3
14. What are the different types of priority inversions under PCP. 3
15. State and discuss the following multiprocessor task allocation 3
algorithms
a. Utilization balancing algorithms.
b. Next-fit algorithm for RMA.
c. Bin-packing algorithm for EDF.
16. Explain distributed clock synchronization. 3
17. A system has four tasks. T1, T 2,T3, T4. These tasks need two 3
resources CR1 and CR2, Assume that the priorities of the four tasks are
as follows: pri(T1)=10. (T2)=7 pri (T3) =5, (T4)=2 The four tasks
T1,T2,T 3and T4 have been arranged in decreasing order of their
priorities. That is,pri(T1)> pri (T2) >… >pri(T4) The exact resource
requirements of these tasks and the duration for which the tasks need
the two resources have been shown in Fig. given below. Compute the
different types of inversions that each task might have to undergo in the
worst case

18 Let us consider a system with a set of periodic real-time tasks T... T6. 3
The resource and computing requirements of these tasks have been
shown in Fig. given below. Assume that the tasks T... T6 have been
arranged in decreasing order of their priorities. Compute the different
types of inversions that a task might have to undergo
19 State the applications of real time data base. 4
20 State the features of real time operating system. 4
21 4
Briefly exp;ain the short comings of traditional unix operating systems.
22 State the short commings of windows Nt. 4
23 State the characteristics of temporal data. 4
24 Briefly explain 2PL concurrency control protocol. 4
25 Briefly explain priority ceiling protocol for real time database. 4
26 State the optimistic concurrency control protocol. 4
27 Give some examples of applications requiring real time 5
communication.
28 State the various quality of service(QoS) parameters. 5
29 State the techniques used for soft real time communication in a LAN. 5
30 State the techniques used for hard real time communication in a LAN. 5
31 Discuss the various global priority arbritation based protocol. 5
32 Briefly explain resourse reservation protocol. 5
33 Briefly explain various QoS models. 5