Course Content

Other Courses

Tribhuvan university > CSIT - 2065 Syllabus > Real Time Systems > Old Questions > 2074
Syllabus Notes Old Questions Unit Wise Questions Question Bank

Real Time Systems 2074

2068 2068(II) 2069 2071 2071(II) 2072 2073 2074 2075 2078 2079
Tribhuwan University
Institute of Science and Technology
2074
Bachelor Level / Sixth Semester / Science
Computer Science and Information Technology ( CSC-354 )
( Real Time Systems )
Full Marks: 80
Pass Marks: 32
Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
The figures in the margin indicate full marks.

Group A

Attempt ant Two questions.(2 x 12 = 24)

1. How real time task are scheduled using Latest Release Time (LRT) algorithms? Explain non-optimality of EDF and LST algorithms.

12 marks view

2. What is slack stealer server? How it is different from polling server? Show that slack stealer improves the response time of a periodic jobs in deadline driven system.

12 marks view

3. What is mutual exclusion and critical section? List and explain the effects of resource allocation in real time scheduling with example.

12 marks view

Group B

Attempt any Eight questions.(8 x 7 = 56)

4. What is the difference between real time system and embedded system? Explain the sample data system with necessary block diagram.

8 marks view

5. Why validation of hard timing constraint is required? Explain the characteristics of soft real time system.

8 marks view

6. Compare and Contrast between Sporadic and Aperiodic job. At what condition the scheduling algorithms becomes optimal? Explain.

8 marks view

7. How frame overruns are handled in cyclic Scheduling? Calculate the possible valid frame size for system with tasks T1(2, 1, 3),T2(4 , 1, 6), T3(6, 2, 8) and T4(6, 2, 8).

8 marks view

8. State the optimality conditions for fixed priority algorithms. Consider a system with real time tasks T1(4, 1, 6) T2(10, 2, 20)  T3(20, 1. 30), T4(10, 5, 8) and T5(8, 1) are scheduled by using EDF algorithms. Find it feasible to schedule or not.

8 marks view

9. Differentiate between periodic and bandwidth preserving server. Explain deferrable server with example.

8 marks view

10. Define busy interval. Calculate the busy interval for task T1(2,1), T2(3,1,25) and T3(5, 0.25) over the interval (0, 12) schedule through the Rate Monotonic (RM) algorithms.

8 marks view

11. Define task assignment in end to end task model. State and explain the task assignment in multiprocessor system using simple bin packing algorithms with example.

8 marks view

12. Define real time traffic model.List and explain the different types of services discipline used in real time communication.

8 marks view

13. Write short notes on(any two):

a) Data dependency and functional parameter of job.

b) Resource Reservation Protocol

c) Pros and corns of cyclic scheduler

8 marks view