MCSCS105-2 Real Time Systems M.Tech Model Question Paper : mgu.ac.in

Name of the College : Mahatma Gandhi University
Department : Computer Science and Engineering
Subject Code/Name : MCSCS 105-2/REAL TIME SYSTEMS
Sem : I
Website : mgu.ac.in
Document Type : Model Question Paper

Download Model/Sample Question Paper :
I : https://www.pdfquestion.in/uploads/mgu.ac.in/5014-1-MCSCS%20105-2%20Real%20Time%20Systems%20set1.doc
II : https://www.pdfquestion.in/uploads/mgu.ac.in/5014-2-MCSCS%20105-2%20Real%20Time%20Systems%20set2.doc

Real Time Systems Question Paper :

M.TECH. DEGREE EXAMINATION :
Branch: Computer Science and Engineering
Specialization : Computer Science and Engineering

Related : MGU MCSCS105-1 BioComputing M.Tech Model Question Paper : www.pdfquestion.in/5013.html

Model Question Paper – I :
First Semester :
MCSCS 105-2 : REAL TIME SYSTEMS (Elective I)
(Regular – 2013 Admission onwards)
Time: 3hrs
Maximum:100 marks
Answer all questions :
1. a) Write notes on hard and soft timing constraints?(8)
b) Explain about temporal parameters of real time work load? (8)
c) Describe about the periodic tasks model? (9)
or

2. a) Explain about Hard and soft real time systems? (9)
b) Discuss about various dependencies among jobs? (10)
c) Explain various functional parameters that affect the access control of resources? (7)

3. a) Discuss about priority driven scheduling with an example? (8)
b) Describe the challenges in validating timing constraints in priority driven
systems? (10)
c) Discuss about static timer driven scheduler? (7)
or

4. a) Explain the general structure of cyclic schedulers?(8)
b) Discuss how to improve the average response time of a periodic jobs?(9)
c ) explain weighted round robin scheduling?(8)

5. a) Explain rate monotonic and deadline monotonic algorithms with examples?(10)
b) Discuss the schedulable utilizations of EDF algorithms?(10)
c) Explain the static assumptions on priority driven scheduling of periodic tasks?(5)
or

6. a) Explain the well known dynamic algorithms for priority driven scheduling of periodic tasks with examples?(15)
b) Discuss the optimality test for EDF algorithm in priority driven scheduling of periodic tasks?(10)

7. a) Discuss about the assumptions and approached used in scheduling a periodic and
Sporadic jobs in priority driven systems? (10)
b) Explain basic priority ceiling protocol? (15)
8. a) Explain about deferrable servers?(15)
b) Explain about basic priority inheritance protocol? (10)

MCSCS 105-2
REAL TIME SYSTEMS : (Elective I)
(Regular – 2013 Admission onwards)
Time: 3hrs
Maximum:100 marks
Answer all questions :
1. a) Explain about hard and soft real time systems?(9)
b) Explain about the scheduling hierarchy? (9)
c) Write notes on precedence constraints and data dependency? (7)
or

2. a) Discuss about various dependencies among jobs? (8)
b) Write notes on
i) Hard and soft timing constraints ii) periodic task model (10)
c) Explain functional parameters that affects the access control of resources?(7)

3. a) Discuss the optimality of the EDF and LST algorithm?(8)
b) Explain about the scheduling of sporadic jobs? (9)
c) Write notes on
i) Clock driven scheduling ii) Weighted round robin scheduling(8)
or

4. a) Explain off line and online scheduling? (9)
b) Discuss about the structure of cyclic schedulers? (8)
c) Discuss about
i) Slack stealing ii) Average response time (8)

5. a)Explain fixed priority and dynamic priority algorithms with examples?(15)
b) Write notes on the following
i) Critical instants ii) Time demand analysis (10)
or

6. a) Discuss about the optimality of the RM and DM algorithms? (7)
b) Explain about the schedulability test for fixed priority tasks with arbitrary response
Times? (10)
c) Explain the following
i) Schedulability test for EDF algorithm ii) Static assumptions (8)

7. a) Discuss about sporadic server in fixed priority systems?(10)
b) Explain about basic priority inheritance protocol? (8)
c) Write about non preemptive critical sections? (7)
or

8. a) Explain about (9)
i) Constant utilization server algorithm ii) Preemptive weighted fair queuing algorithm?
b) Explain about preemption ceiling protocol? (8)
c) Describe about stack based priority ceiling protocol? (8)

Syllabus :
Module 1 :
Introduction : Hard Versus Soft Real time Systems: Jobs and Processors –Real times, Deadlines and Timing constraints – Hard and Soft timing constraints – Hard Real time systems – Soft Real time systems

A reference model of Real time systems : Processors and resources – Temporal parameters of Real time workload – Periodic task model –Precedence constraints and data dependency – Other types of dependencies – Functional Parameters – Resource Parameters of Jobs and Parameters of resources – Scheduling hierarchy.

Module 2 :
Commonly used approaches to Real time scheduling : Clock driven approach – Weighted round robin approach – Priority Driven approach – Dynamic versus Static systems –Effective Release times and Deadlines – Optimality of EDF and LST – Challenges in validating timing constraints in Priority driven systems – Offline versus Online scheduling

Clock driven scheduling : Notations and assumptions – Static Timer driven scheduler –General structure of Cyclic schedules – Cyclic executives – Improving average response time of Aperiodic jobs – Scheduling Sporadic jobs .