Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 41 views

    Os ND06

    Uploaded by

    kevinbtech
    This document contains questions for an Operating Systems exam. It covers topics like: 1) The main purposes of an operating system and advantages of multiprogramming. 2) Issues in inter-process communication and memory management techniques. 3) CPU scheduling algorithms like FCFS, round robin, priority scheduling and shortest job first. 4) The banker's algorithm for avoiding deadlocks. 5) Paging, segmentation, internal and external fragmentation. 6) File allocation methods and disk scheduling.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Os ND06

    Uploaded by

    kevinbtech
    41 views3 pages
    This document contains questions for an Operating Systems exam. It covers topics like: 1) The main purposes of an operating system and advantages of multiprogramming. 2) Issues in inter-process communication and memory management techniques. 3) CPU scheduling algorithms like FCFS, round robin, priority scheduling and shortest job first. 4) The banker's algorithm for avoiding deadlocks. 5) Paging, segmentation, internal and external fragmentation. 6) File allocation methods and disk scheduling.

    Original Title

    OS_ND06

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains questions for an Operating Systems exam. It covers topics like: 1) The main purposes of an operating system and advantages of multiprogramming. 2) Issues in inter-process communication and memory management techniques. 3) CPU scheduling algorithms like FCFS, round robin, priority scheduling and shortest job first. 4) The banker's algorithm for avoiding deadlocks. 5) Paging, segmentation, internal and external fragmentation. 6) File allocation methods and disk scheduling.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    41 views3 pages

    Os ND06

    Uploaded by

    kevinbtech
    This document contains questions for an Operating Systems exam. It covers topics like: 1) The main purposes of an operating system and advantages of multiprogramming. 2) Issues in inter-process communication and memory management techniques. 3) CPU scheduling algorithms like FCFS, round robin, priority scheduling and shortest job first. 4) The banker's algorithm for avoiding deadlocks. 5) Paging, segmentation, internal and external fragmentation. 6) File allocation methods and disk scheduling.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    T 8L2L

    CEMBER2006.
    B.E./B.Tech.DEGREEEXAMINATION.NOVEMBER/DE

    Fourth Semester

    Computer Scienceand Engineering

    CS 1252- OPERA,TINGSYSTEMS

    (Common to B.E. (Part-Time) Third SemesterR 2005)

    (Regulation 2004)

    Time : Three hours Maximum: 100 marks

    m
    Answer ALL questions.

    co
    PARTA-(10 x2=20 marks)
    N.
    1. What are the main purposes of an Operating System?
    va

    2. What is the main advantage of multiprogramming?


    na
    aa

    3. What is the main difficulty that a programmer must overcome in writing an


    operating system for a real-time environment?
    M

    4. What are the main advantagesof the microkernel approach to system design?
    w.
    ww

    5. Explain the difference between Logical address and Physical address space.

    6. What are the necessarvconditions for the occurrenceof a deadlock?

    7. What are the advantages of having an inverted page table?

    8. What are the major activities of an operating system in regard to process


    management?

    9. What advantage is there in having different time-quantum sizes on different


    Ievels of a multilevel queueing system?

    10. Why are segmentation and pagrng sometimescombinedinto one scheme?


    PARTB-(5x16=80marks)

    11. (a) (i) f)iscuss briefly the various issues involved in implementing Inter
    ProcessCommunication (IPC) in messagepassing system. (8)
    (ii) Explain the free space management using Bit Vector and Linked
    list methods. (8)

    Or

    (b) (i) Explain how hardware protection can be achieved. 0)

    (ii) Explain long term, medium term and short term scheduler. (6)

    (iii) What is a real time system? (3)

    12. (a) Assume the following workload in a system. All jobs arrive at time 0 in
    the order given
    Job Burst time (ms) Priority

    m
    A82

    co
    841
    c54
    D22
    N.
    E13
    va
    (i) Draw a Gantt chart illustrating the execution of these job
    using FCFS,RR (quantmn= 4), non preemptivepriority (a smaller
    na

    priority number implies a higher priority) and SJF CPU


    scheduling. (8)
    aa

    (ii) Calculate the average waiting time and average turnaround time
    M

    for each of the above scheduling algorithm. (8)


    w.

    Or
    ww

    (b) Discuss the critical section problem, solving the Dining philosophers'
    problem using semaphores.

    13. (a) Consider the following snapshot of a system. Execute Banker's algorithm
    to answer the following.
    Allocation Max Available
    AI]CD ABCI) ABCI)
    Po20L2 20t2 242r
    Pr1000 2750
    Pz 13 5 4 2 3 5 6
    PsO632 0752
    P+0 0I4 0756

    2 T 81 21
    (i) Is the system in a safe state? Ifthe system is safe, show how all the
    processcould complete their execution successfully.If the system is
    unsafe, show how deadlockmight occur. Explain. (6)

    (ii) If a request from processPr arrives (L, 4, 2,0) can the request be
    granted? (10)

    Or

    (b) Explain the difference between External Fragmentation and Internal


    Fragmentation? How to solve the fragmentation problem using paging?
    (6 + 10)

    14. (a) Consider the following page reference string :


    2 , 3 , 4 , 5 , 3 , 2 , 6 , 7 , 3 , 2 , 3 , 4 , 1 , 7, L , 4 , 3 , 2 , 3 , 4 , 7
    Calculate the number of page faults would occur for the following page
    replacement algorithm with frame size of 3 and 5. (16)
    (i) LRU (ii) FIFO (iii) Optimal.

    m
    Or

    co
    (b) Briefly explain the Disk Management and Swap-Spacemanagement.
    N.(8+8)
    va
    15. (a) Explain the various file allocation methods and discuss advantages and
    disadvantagesin those schemes. (16)
    na

    Or
    aa

    (b) Explain the different disk scheduling algorithms with neat diagrams. (16)
    M
    w.
    ww

    T 81 21

    You might also like