Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    Rtos QP MM

    Uploaded by

    neetika gupta
    This document is a mid-semester test for a course on real-time operating systems. It contains 6 multiple choice and short answer questions about real-time scheduling algorithms and concepts. The test instructions specify it is closed book, 90 minutes long, and worth 30% of the student's grade. The questions cover topics like scheduling approaches for multimedia frames, periodic task scheduling using rate monotonic and earliest deadline first algorithms, and computing frame sizes and task hyperperiods.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd

    Rtos QP MM

    Uploaded by

    neetika gupta
    24 views2 pages
    This document is a mid-semester test for a course on real-time operating systems. It contains 6 multiple choice and short answer questions about real-time scheduling algorithms and concepts. The test instructions specify it is closed book, 90 minutes long, and worth 30% of the student's grade. The questions cover topics like scheduling approaches for multimedia frames, periodic task scheduling using rate monotonic and earliest deadline first algorithms, and computing frame sizes and task hyperperiods.

    Original Title

    RTOS_QP_MM

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is a mid-semester test for a course on real-time operating systems. It contains 6 multiple choice and short answer questions about real-time scheduling algorithms and concepts. The test instructions specify it is closed book, 90 minutes long, and worth 30% of the student's grade. The questions cover topics like scheduling approaches for multimedia frames, periodic task scheduling using rate monotonic and earliest deadline first algorithms, and computing frame sizes and task hyperperiods.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    24 views2 pages

    Rtos QP MM

    Uploaded by

    neetika gupta
    This document is a mid-semester test for a course on real-time operating systems. It contains 6 multiple choice and short answer questions about real-time scheduling algorithms and concepts. The test instructions specify it is closed book, 90 minutes long, and worth 30% of the student's grade. The questions cover topics like scheduling approaches for multimedia frames, periodic task scheduling using rate monotonic and earliest deadline first algorithms, and computing frame sizes and task hyperperiods.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 2

    Birla Institute of Technology & Science, Pilani

    Work Integrated Learning Programmes Division


    M.S. Software Engineering at Wipro Technologies (WASE)
    Second Semester 2013 - 2014 (March 2014 to September 2014)
    Mid-Semester Test (Make-up)

    Course Number : SEWP ZG524


    Course Title : REAL TIME OPERATING SYSTEMS
    Type of Exam : Closed Book
    Weightage : 30 % No. of Pages : 2
    No. of Questions : 6
    Duration : 90 minutes
    Date of Exam : WEDNESDAY, 09-07-2014 Session: FN : 09:00-10:30

    Note:
    1. Please read and follow all the instructions given on the cover page of the answer script.
    2. Start each answer from a fresh page. All parts of a question should be answered consecutively.
    3. Please answer the questions in the order in which they appear in the question paper.

    Q1. Choose the most appropriate option: (Answer should be a/b/c/d only) [5x1Mark=5 Marks]
    i. Choose the odd one out:
    a. Radar system b. Weapons firing control system
    c. Navigation system d. Divert-and-altitude-control system
    ii. The instance of time at which the job becomes eligible for execution.
    a. release time b. start time c. execution time d. end time

    iii. Identify the simplest of bandwidth-preserving servers.


    a. deferred server b. deferrable server c. delayed server d. post server

    iv. The round robin approach is commonly used for scheduling ____________ applications.
    a. clock driven b. time shared c. cyclic scheduling d. priority driven
    v. ______________ protocol, is a set of rules that govern (1) when and under what conditions
    each request for resource is granted and (2) how jobs requiring resources are scheduled?
    a. resource granting protocol b. priority protocol
    c. priority – inheritance protocol d. resource access-control protocol

    Q2. Assume that you are handling a multimedia application. You need to schedule frames on the
    fly. Suppose there are about 1000 frames arriving in 15 minutes. Which laxity based approach
    would schedule the frames effectively? Which scheduling strategy would schedule the frames?
    Justify your answer by listing out the constraints that have to be considered. [5 Marks]

    Page 1 of 2
    Q3. A system contains the following periodic tasks: T1 = (5, 1), T2 = (7, 1, 9), T3 = (10, 3), and
    T4 = (35, 7).
    a. If the first frame size constraint is ignored, what are the possible frame sizes? [2 Marks]
    b. Use the largest frame size you have found in part (a), draw the network-flow graph of the
    system.[3 Marks]

    Q4. a. What is the makespan (maximum flow) and utilization of the following set of 5 tasks
    T(e,d): T1(1,5),T2(4,13),T3(2,15), T4(2,22) and T5(2,21) [2 Marks]
    b. Compute the hyperperiod of the following set of 3 tasks T(e,p):T1(4,5), T2(3,10) and
    T3(7,15). [3 Marks]

    Q5. Consider the following task set T(e,p) of 3 tasks T1(4,2), T2(5,8) and T3(4,14). Which
    scheduling algorithm would feasibly schedule tasks? Justify your answer. Draw the Gantt chart
    and schedule the tasks feasibly. [5 Marks]

    Q6. Which of the following systems of periodic tasks are schedulable by the rate-monotonic
    algorithm? By the earliest-deadline-first algorithm? Explain your answer. [5 Marks]
    (a) T = {(8, 3), (9, 3), (15, 3)}
    (b) T = {(8, 4), (12, 4), (20, 4)}
    (c) T = {(8, 4), (10, 2), (12, 3)}

    *************************

    Page 2 of 2

    You might also like