Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    22516

    Uploaded by

    nihalpatil0021

    Copyright:

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

    22516

    Uploaded by

    nihalpatil0021
    9 views3 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    9 views3 pages

    22516

    Uploaded by

    nihalpatil0021

    Copyright:

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

    22516

    23242
    3 Hours / 70 Marks Seat No.

    Instructions – (1) All Questions are Compulsory.


    (2) Answer each next main Question on a new page.
    (3) Illustrate your answers with neat sketches wherever
    necessary.
    (4) Figures to the right indicate full marks.
    (5) Assume suitable data, if necessary.
    (6) Use of Non-programmable Electronic Pocket
    Calculator is permissible.
    (7) Mobile Phone, Pager and any other Electronic
    Communication devices are not permissible in
    Examination Hall.

    Marks

    1. Attempt any FIVE of the following: 10


    a) List different types of operating system.
    b) State any four services provided by an operating system.
    c) Draw process state diagram.
    d) State two features of non-preemptive scheduling.
    e) Define following terms:
    i) Memory compaction
    ii) Fragmentation
    f) Write syntax of PWD command and explain its use with the help
    of suitable example.
    g) List any four file operations.

    P.T.O.
    22516 [2]
    Marks
    2. Attempt any THREE of the following: 12
    a) Explain Resource management of an operating system.
    b) Explain different components of operating system.
    c) Describe message passing system of interprocess communication
    (IPC).
    d) What is CPU Scheduler? Explain the preemptive and
    nonpreemptive type of scheduling.

    3. Attempt any THREE of the following: 12


    a) Define Process. Draw a Process Control Block and explain the
    information in PCB.
    b) Define deadlock. State the conditions necessary for deadlock.
    c) Explain the following terms with respect to memory management:
    i) Dynamic relocation
    ii) Swapping
    d) With suitable diagram, explain how contiguous file allocation is
    performed?

    4. Attempt any THREE of the following: 12


    a) Compare between Time sharing operating system and
    multiprogramming operative system.
    b) Explain any four types of system call.
    c) Describe how context switch is executed by operating system.
    d) Compare Short Job First (SJF) and Shortest Remaining Time
    (SRTN) scheduling algorithm (any four points).
    e) Describe variable partitioning with the help of suitable example.
    22516 [3]
    Marks
    5. Attempt any TWO of the following: 12
    a) Explain the use of following OS tools:
    i) Device Manager
    ii) Task Scheduler
    b) Explain user level thread and Kernel level thread with its
    advantages and disadvantages.
    c) Consider the string:
    0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 6, 7 with frame size 3 and
    4, calculate page fault in both the cases using FIFO algorithm.

    6. Attempt any TWO of the following: 12


    a) What is the average turnaround time for the following process
    using :
    i) FCFS scheduling algorithm
    ii) SJF non-preemptive scheduling algorithm
    iii) Round Robin Scheduling algorithm.

    Process Arrival time Burst time

    P1 0 8

    P2 1 4

    P3 2 1

    b) Explain bit map vector and linked list free space management
    techniques with its advantages and disadvantages.
    c) Explain with diagram single level directory structure and two level
    directory structure with its advantages and disadvantages.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy