Rajasthan Technical University 2010 B.Tech Computer Science and Engineering Vll Sem.(Main) ,- Computer Science REAL TIME SYSTEMS - Question Paper
Saturday, 25 May 2013 12:35Web
B.Tech. Vll Sem.(Main) Examination, December - 2010
Computer Science
REAL TIME SYSTEMS
(Common for 7CS6.3 AND 7IT6.2)
Time: three Hours Total Marks: 80
Min. Passing Marks: 24
Instructions to Candidates :
Attempt overall 5 ques. selecting any 1 ques. from every unit. All ques. carry equal marks. (Schematic diagrams must be shown whenever necessary. Any data you feel missing may suitably be presumed and said clearly. Units of volumes used/calculated must be said clearly.)
UNIT - I
Q.1.(a) elaborate the different timing constraints of a job? discuss every with example. (8)
(b) discuss complex control-flow calculations. (8)
OR
Q.1.(a) elaborate real time multimedia applications? discuss (8)
(b) elaborate soft Real Time Systems? How it differs from Hard Real Time Systems? (8)
UNIT -II
Q.2.(a) What is Optimal Schedule? define scheduling hierarchy in brief. (8)
(b) discuss weighted Round Robin approach to Real Time Scheduling. (8)
OR
Q.2.(a) discuss general structure of Cyclic Scheduler. (8)
(b) define Scheduling Sporadic Jobs. (8)
UNIT - III
Q.3.(a) What do you mean by pre-emptivity of the job? How is it various from pre-emptivity of resources? (8)
(b) discuss effective release time and deadlines. (8)
OR
(b) A system contains 9 non-preemptable jobs named Ji for i=1,2,....9. their execution times are 3,2,2,2,4,4,4,4 and nine respectively. Their release times are equal to 0, and deadlines are 12. J1 is the immediate predecessor of J9 and J4 is the immediate predecessor of J5, J6, J7and J8. There is no other precedence constraints. For all the jobs Ji has higher priority than Jk if i
(ii) Can the jobs meet their deadlines if they are scheduled on 3 processors? discuss. (3)
(iii) Can the jobs meet their deadlines if they were if we make them preemptable and schedule them preemptively. discuss Your ans. (3)
UNIT - IV
Q.4. Explain:
(a) Multiprocessor Priority-Ceiling Protocol(MPCP). (8)
(b) Distance Constraint Monotonic (DCM) Algorithm. (8)
OR
Q.4. discuss any Two:- (8X2=16)
(a) Greedy Synchronization Protocol.
(b) replaced Phase Modification Protocol.
(c) Flexible Applications.
UNIT - V
Q.5. discuss in detail Model of Real Time Communications. (16)
OR
Q.5. discuss :
(i) Weighted Fair-Queueing Discipline. (8)
(ii) problems in Resource Reservation. (8)
| Earning: Approval pending. |
