Scribd Logo
Upload

Welcome to Scribd!

  • 1 views

    Model Imp Qns

    Uploaded by

    crescenttraders09876

    Copyright:

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

    Model Imp Qns

    Uploaded by

    crescenttraders09876
    1 views2 pages

    Original Title

    Model imp qns

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    1 views2 pages

    Model Imp Qns

    Uploaded by

    crescenttraders09876

    Copyright:

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

    Unit I

    Part A
    1. What are the three main purposes of an Operating System?
    2. What is Bootstrapping?
    3. Define a System Call.
    Part B
    1. Elaborate on the different Operating System structures and explain with a neat
    sketch.
    2. Describe the three general methods for passing parameters to the operating
    system.
    3. Write in detail about the Real-time System and Multiprocessor System.
    4. Describe the differences between Symmetric and Asymmetric Multiprocessing.
    Unit II
    Part A
    1. What are the various scheduling criteria for CPU scheduling?
    2. Write the difference between the User thread and the Kernel thread.
    3. Name the four conditions for Deadlock.
    Part B
    1. How do monitors help in the process Synchronization?
    2. Discuss in detail Readers – Writer’s problem in detail.
    3. Define Deadlock. State the condition for deadlock. Explain the steps involved in
    Deadlock recovery.
    4. Explain the banker’s algorithm for deadlock avoidance with an example.
    Part C
    1. Consider the following set of processes, with the length of the CPU burst time
    given in milliseconds.
    Process Burst Time Priority Arrival time
    a. P1 10 3 0
    b. P2 1 1 1
    c. P3 2 3 2
    d. P4 1 4 1
    e. P5 5 2 2
    Draw the Gantt chart for the execution of these processes using FCFS, pre-
    emptive and non-pre-emptive SJF, Priority, and Round Robin (time slice = 2ms).
    Find average waiting and turnaround time using each of the methods.

    2. Consider the snapshot of a system.


    i. Max Allocation Available
    ii. A B C D A B C D AB C D
    P0 2 0 0 1 4 2 1 2 3 3 2 1
    P1 3 1 2 1 5 2 5 2
    P2 2 1 0 3 2 3 1 6
    P3 1 3 1 2 1 4 2 4
    P4 1 4 3 2 3 6 6 5
    Answer the following Using Banker’s algorithm,
    (i) Illustrate that the system is in a safe state by demonstrating an order in which
    the processes may complete.
    (ii)If a request from process P1 arrives for (1,1,0,0) can the request be granted
    immediately?
    (iii)If the request from P4 arrives for (0,0,2,0) can the request be granted
    immediately?
    Unit III
    Part A
    1. Define TLB and Pre-Paging
    2. Define thrashing.
    3. Differentiate between Internal Fragmentation and External Fragmentation.
    Part B & C
    1. Explain the various Page Replacement Algorithms with suitable examples.
    2. What is thrashing? Explain the working set model in detail.
    Unit IV
    Part A
    1. Define UFD and MFD.
    2. Give the role of OS in free space management.
    3. List the various file attributes.
    Part B & C
    1. Explain the different disk scheduling algorithms with examples.
    2. Briefly discuss various Directory structures.
    3. Describe in detail about free space management with neat examples.
    4. Explain the data structures supported by the kernel I/O subsystem.

    Unit V
    Part A
    1. What is the advantage of using virtual machines?
    2. Which layer of iOS contains fundamental system services for apps?
    3. What is the memory mapping of a file in a Linux Environment?
    Part B & C
    1. Explain in detail about the Android, and iOS architecture and its components.
    2. Explain the various types of virtual machines and their implementations in
    detail.

    You might also like