Scribd Logo
Upload

Welcome to Scribd!

  • Question Bank Unit-1: Explain Earlier - Deadline-First Scheduling Algorithm and How It Is Implemented in Real Time System

    Uploaded by

    Richa Yadav
    4 views1 page
    The document contains questions from 5 units about real-time databases and operating systems. Unit 1 asks about real-time databases, precedence graphs, differences between real-time and general purpose operating systems, and thread types for performance measurement. Unit 2 asks about clock-driven vs priority-driven task scheduling and the earliest deadline first algorithm. Unit 3 asks about task scheduling and timing diagrams. Unit 4 asks about bin packing problems, scheduling problems, heuristics for bin packing, and time-token protocols. Unit 5 asks about concurrency control issues for databases.

    Original Description:

    Original Title

    Question Bank1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains questions from 5 units about real-time databases and operating systems. Unit 1 asks about real-time databases, precedence graphs, differences between real-time and general purpose operating systems, and thread types for performance measurement. Unit 2 asks about clock-driven vs priority-driven task scheduling and the earliest deadline first algorithm. Unit 3 asks about task scheduling and timing diagrams. Unit 4 asks about bin packing problems, scheduling problems, heuristics for bin packing, and time-token protocols. Unit 5 asks about concurrency control issues for databases.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    4 views1 page

    Question Bank Unit-1: Explain Earlier - Deadline-First Scheduling Algorithm and How It Is Implemented in Real Time System

    Uploaded by

    Richa Yadav
    The document contains questions from 5 units about real-time databases and operating systems. Unit 1 asks about real-time databases, precedence graphs, differences between real-time and general purpose operating systems, and thread types for performance measurement. Unit 2 asks about clock-driven vs priority-driven task scheduling and the earliest deadline first algorithm. Unit 3 asks about task scheduling and timing diagrams. Unit 4 asks about bin packing problems, scheduling problems, heuristics for bin packing, and time-token protocols. Unit 5 asks about concurrency control issues for databases.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    Question Bank Unit-1

    1. 2. 3. 4. 5. 6. 7. What is real-time database? Explain the necessity of precedence graph with an example. What is the difference between RTOS and general-purpose operating systems? Explain, how a real-time database differs from a conventional database. State differences between Hard Real-time and Soft Real-time Systems. Explain different types of threads which are commonly available for performance measurement in real-time systems.

    Unit-2 1.
    Explain the difference between Clock-Driven Scheduling and Priority Driven Scheduling of periodic tasks 2. Explain EarlierDeadlineFirst (EDF) scheduling algorithm and how it is implemented in real time system.

    3. Unit-3 1. 2. Unit-4 1.
    What is Task scheduling? Explain it with a timing diagram 2. State Bin Packing Problem. 3. Show that Bin packing problem is a variation of the scheduling problem. 4. Name two simple heuristics for bin packing. If bins are of capacity 10 and 6 items have to be placed in bins, illustrate the solution with any heuristic. 5. What is Time-token protocol? Explain it in detail with a flowchart. Why do static priority task scheduling algorithms needs less run time overhead compared to the dynamic priority task scheduling algorithms?

    6. Unit-5
    Discuss the concurrency control issues for databases.

    1.

    You might also like