Scribd Logo
Upload

Welcome to Scribd!

  • 89 views

    Operating System Question Bank

    Uploaded by

    Dhanshree Gaikwad
    This document contains questions about operating system concepts including: CPU and I/O burst cycles, deadlock characteristics, multilevel queue scheduling, process swapping, scheduling criteria, directory structures, bitmap free space management, process commands like bg and kill, contiguous file allocation, calculating average waiting time using Round Robin scheduling, page replacement algorithms like FIFO and LRU, comparing bitmap and linked list free space techniques, system calls for device management, interprocess communication advantages, memory management techniques like compaction and swapping, and file allocation methods.

    Copyright:

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

    Operating System Question Bank

    Uploaded by

    Dhanshree Gaikwad
    89 views1 page
    This document contains questions about operating system concepts including: CPU and I/O burst cycles, deadlock characteristics, multilevel queue scheduling, process swapping, scheduling criteria, directory structures, bitmap free space management, process commands like bg and kill, contiguous file allocation, calculating average waiting time using Round Robin scheduling, page replacement algorithms like FIFO and LRU, comparing bitmap and linked list free space techniques, system calls for device management, interprocess communication advantages, memory management techniques like compaction and swapping, and file allocation methods.

    Original Description:

    This a operating system question bank

    Original Title

    Operating system Question bank

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains questions about operating system concepts including: CPU and I/O burst cycles, deadlock characteristics, multilevel queue scheduling, process swapping, scheduling criteria, directory structures, bitmap free space management, process commands like bg and kill, contiguous file allocation, calculating average waiting time using Round Robin scheduling, page replacement algorithms like FIFO and LRU, comparing bitmap and linked list free space techniques, system calls for device management, interprocess communication advantages, memory management techniques like compaction and swapping, and file allocation methods.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    89 views1 page

    Operating System Question Bank

    Uploaded by

    Dhanshree Gaikwad
    This document contains questions about operating system concepts including: CPU and I/O burst cycles, deadlock characteristics, multilevel queue scheduling, process swapping, scheduling criteria, directory structures, bitmap free space management, process commands like bg and kill, contiguous file allocation, calculating average waiting time using Round Robin scheduling, page replacement algorithms like FIFO and LRU, comparing bitmap and linked list free space techniques, system calls for device management, interprocess communication advantages, memory management techniques like compaction and swapping, and file allocation methods.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 1

    OS QB UT II

    1. Describe CPU burst cycle and I/O burst cycle.


    2. What is deadlock? Give characteristics of deadlock.
    3. Describe Multilevel queue scheduling with labelled diagram.
    4. Define the term swapping.
    5. Explain different process scheduling criteria.
    6. List the directory structures.
    7. With suitable example describe how to use bit map method for free space management.
    8. State the syntax and use of following process related commands :
    a. i.bg ii.kill
    9. Describe working of contiguous file allocation method.
    a. Calculate average waiting time with Round Robin for following processes in memory.
    (Time Slice = 4ms)

    Process Burst
    time
    P1 3
    P2 5
    P3 7
    P4 4
    10. Given a page reference reference string(arrival) with four page frames, calculate the page
    faults with FIFO and LRU page replacement algorithms respectively : 12, 3, 4, 5, 1, 2, 5, 1,
    2, 3, 4, 5, 1,6,7,8,7,8,9,7,8,9,5,4,4,5,4,2.
    11. Compare between bitmap and linked list free space management techniques.(any six points)
    12. Write any four system calls related to device management.
    13. Describe different scheduling criteria.

    14. State what interprocess communication is and explain its advantages.


    15. Explain following terms with respect to Memory management :
    I. Compaction
    II. Swapping.
    16. Enlist different file allocation methods and explain any two.

    You might also like