You are on page 1of 1

Birla Institute of Technology & Science, Pilani

Work-Integrated Learning Programmes Division

Second Semester 2009-2010

Mid-Semester Test
(EC-1 Regular)

Course No. : BITS ZG553
Nature of Exam : Closed Book
Weightage : 40%
Duration : 2 Hours
Date of Exam : 06/02/2010 (FN)
1. Please follow all the Instructions to Candidates given on the cover page of the answer book.
2. All parts of a question should be answered consecutively. Each answer should start from a fresh page.
3. Mobile phones and computers of any kind should not be used inside the examination hall.
4. Use of any unfair means will result in severe disciplinary action.

Q.1. Answer following questions briefly and precisely:

(a) What do you understand by Real-Time in real-time systems?
(b) Which algorithms are called Greedy Algorithms? Why?
(c) Why and when job slicing is done in clock-driven scheduling?
(d) What are bandwidth reserving servers? Where are they used?
(e) Give any two misconceptions about real-time systems and explain how they
are wrong. [5 X 2 = 10]

Q.2. A system of three tasks T
(3.5,1) ; T
(4,1) and T
(5,2,7) is to be scheduled with
clock-driven cyclic executive algorithm.
(a) Is the task set schedulable? Justify your answer.
(b) What are the hyper period and possible frame size(s)?
(c) Choose the largest frame size and draw a Network Flow Graph.
(d) Draw a neat timing diagram up to 20 frames. [1 + 4 + 4 + 3 = 12]

Q.3 (a). Why a task requires sometimes more processor time to execute than its
execution time?
Q.3 (b). A system contains three periodic tasks T
, e
) = {(7,3), (12,3), (20,5). The
tasks are scheduled by using Rate Monotonic Algorithm. Using iterative
method, determine the schedulability of the tasks. [2 + 8 =10]

Q.4 (a). By drawing suitable line diagrams and notations, explain what is nested
requirement of resources and how it is represented.
Q.4 (b). Explain by suitable diagrams, how non preemptive critical section protocol is
better than preemptive critical section protocol. [4 + 4 = 8]

No. of Pages = 1
No. of Questions = 4