[6 Marks] Q 2(a) Describe two types of real time scheduling algorithms and explain their merits and de-merits EE515 - Real-Time Digital Signal Processing (DSP) Semester 1 Examinations 2016/2017 Page 2 of 5 Q 2(b) Given 3 tasks with a task set of T1 = [1, 4], T2 = [2, 5], T3 = [2, 7], show with aid of diagrams how each task would be sequenced when each of the real time scheduling algorithms (as in Q2 (a)) are applied on them. Hint: Ti = (ci, pi) (computation time, period]. Use shading/colours to represent the different tasks. [8 Marks] Q 2(c) Describe the classification of tasks and list their properties. Use an example to highlight each of the classes [7 Marks] Q 2(d) Consider an eleven point moving average described by the difference equation; [12 Marks] 10 yln] = i2*tn k] kwo Derive the frequency response of the discrete-time filter and also calculate the equivalent analogue frequency response of the system for f,=1000 1-at (Hint: use the formula for the sum of geometric series E a* =) 1-a [6 Marks] Q 2(a) Describe two types of real time scheduling algorithms and explain their merits and de-merits EE515 - Real-Time Digital Signal Processing (DSP) Semester 1 Examinations 2016/2017 Page 2 of 5 Q 2(b) Given 3 tasks with a task set of T1 = [1, 4], T2 = [2, 5], T3 = [2, 7], show with aid of diagrams how each task would be sequenced when each of the real time scheduling algorithms (as in Q2 (a)) are applied on them. Hint: Ti = (ci, pi) (computation time, period]. Use shading/colours to represent the different tasks. [8 Marks] Q 2(c) Describe the classification of tasks and list their properties. Use an example to highlight each of the classes [7 Marks] Q 2(d) Consider an eleven point moving average described by the difference equation; [12 Marks] 10 yln] = i2*tn k] kwo Derive the frequency response of the discrete-time filter and also calculate the equivalent analogue frequency response of the system for f,=1000 1-at (Hint: use the formula for the sum of geometric series E a* =) 1-a