Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    12.operating Systems MODEL QP

    Uploaded by

    Sathvik Reddy

    Copyright:

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

    12.operating Systems MODEL QP

    Uploaded by

    Sathvik Reddy
    11 views3 pages

    Original Title

    12.Operating Systems MODEL QP

    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
    11 views3 pages

    12.operating Systems MODEL QP

    Uploaded by

    Sathvik Reddy

    Copyright:

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

    Code No.

    : 22CSC15N

    CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (Autonomous)


    B.E. (CSE) V Sem MODEL QUESTION PAPER
    OPERATING SYSTEM
    Time: 3 Hours Max Marks:
    75
    Note: Answer all questions from Part-A at one place in the same order
    Answer any five questions from Part -B

    Part - A (25 Marks)


    M CO BT
    1 Differentiate between Multiprogramming and Time-Sharing (2) CO1 BT3
    System.
    2 List the main goals of Operating System. (3) CO1 BT1
    3 What is a scheduler? List various types of schedulers. (3) CO2 BT1
    4 Explain how message passing and shared memory differ as IPC (2) CO2 BT2
    mechanisms in Linux.
    5 Distinguish between internal and external fragmentation. (2) CO3 BT3
    6 What is thrashing? List the reasons of thrashing. (3) CO3 BT2
    7 Explain the differences between a process and a thread. (3) CO4 BT2
    8 What is deadlock? Under what circumstances a deadlock may (2) CO4 BT2
    arise in an operating system
    9 What are the design principles of Linux? (2) CO5 BT1
    10 Write the differences between Virus and Worms. (3) CO5 BT2

    Part - B (50 Marks)


    11 (a) Analyze the key differences between a Real-Time Operating (5) CO1 BT4
    System (RTOS) and a desktop OS in terms of response time
    and priority handling.
    (b) Explain how a microkernel architecture might enhance (5) CO1 BT3
    system security compared to a monolithic architecture.
    12 (a) Consider following set of processes, with the length of the (5) CO2 BT3
    CPU-burst time given in milliseconds
    Proces Burst
    Priority
    s Time
    P1 10 3
    P2 1 1
    P3 2 3
    P4 1 4
    P5 5 2
    Find the average turn-around time for the following
    scheduling algorithms.
    1. FCFS 2. SJF 3. RR (quantum = 2)
    (b) Illustrate about process control block with neat diagram (5) CO2 BT2
    13. (a) Given memory partitions of 100 KB, 500 KB, 200 KB, 300 (5) CO3 BT3
    KB, and 600 KB (in order), how would each of first-fit,
    best-fit, and worst-fit algorithms place processes of 212 KB,
    417 KB, 112 KB, and 426 KB (in order)? Inspect which
    algorithm makes the most efficient use of memory. Explain
    in detail about producer-consumer classical IPC problem
    (b) Consider the following page-reference string: (5) CO3 BT3
    1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
    Make use of the mentioned page replacement algorithms to
    find the number of page faults and assume four frames.
    Remember all frame are initially empty, so your first unique
    pages will all cost one fault each.
    Replacement Algorithms:
    1. LRU replacement 2. FIFO replacement

    14 (a) Consider the following snapshot of the system. (5) CO4 BT3
    Allocation Max Available
    Processes
    ABCD ABCD ABCD
    P0 0012 0012 1520
    P1 1000 1750
    P2 1354 2356
    P3 0632 0652
    P4 0014 0656
    Determine whether the system is in safe state of not. If a
    request from process P1 arrives for (0, 4, 2, 0), assess
    whether the request be granted immediately or not?

    (b) Explain the solution to reader writer’s problem with the help (5) CO4 BT3
    of semaphores.
    15 (a) Illustrate the types of threats in Operating System. (5) CO5 BT2
    (b) Explain the different File allocation methods with their (5) CO5 BT2
    advantages and disadvantages.
    16. (a) Explain in detail about different operating system services (5) CO1 BT2
    (b) Consider a disk drive with 5000 cylinders, numbered 0 to (5) CO3 BT3
    4999. The drive is currently serving a request at cylinder
    143, and the previous request was at cylinder 125. The
    queue of pending requests, in FIFO order is
    86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130
    Make use of the disk scheduling concept to find the total
    distance that the disk arm moves to satisfy all the pending
    requests for each of the following disk-scheduling
    algorithms.
    1. FCFS
    2. SSTF

    17 (a) Analyze the role of exception handling in Remote Procedure (4) CO2 BT4
    Calls (RPC) and explain how it ensures reliability in
    distributed systems.
    (b) Illustrate OS level memory protection. (3) CO4 BT2
    (c) What is Race Condition? Explain with an example. (3) CO4 BT2
    ******

    You might also like