CACS251 Operating System

Operating System TU Board 2023 question paper

10 questionsSit this paper (timed)

Tribhuvan University

Bachelor of Computer Application

Semester 4 · TU Board 2023

Course Title: Operating System (CACS251)

Full Marks: 60Pass Marks: 24Time: 3 hours

Candidates are required to answer the question in their own words as far as possible.

Group A

    Group B

    Attempt any SIX question.(6 × 5 = 30)

    1. 2.

      Define Operating System? Explain objectives of Operating System.

      5
    2. 3.

      How can we solve producer-consumer problem using semaphore?

      5
    3. 4.

      What do you mean by Preemptable and Non-Preemptable resources? Describe the necessary conditions for deadlock.

      5
    4. 5.

      Given memory partitions of 200k, 600k, 300k, 400k, and 700k (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 315k, 527k, 202k, and 548k (in order)? Which algorithm makes the most efficient use of memory?

      5
    5. 6.

      What is meant by system threat? Explain different types of program threats.

      5
    6. 7.

      Explain methods of communication in a distributed system.

      5
    7. 8.

      Write short notes on (Any Two): a) Access Control Matrix b) Process States c) Kernel

      5

    Group C

    Attempt any TWO questions(2 × 10 = 20)

    1. 9.

      The processes are assumed to have arrived in the order p1, p2, p3, p4, p5 all at time 0. Draw a Gantt chart illustrating their execution and calculate average waiting time and turnaround time for the process given below using: a) First Come First Serve b) Shortest Remaining Time Next c) Priority Scheduling d) Round Robin (quantum = 2)ProcessesBrust Time (sec)PriorityP122P211P384P442P553

      10
    2. 10.

      What is Disk Access Time and Disk Response Time? Suppose that a disk has 200 cylinders, numbered (0-199). The drive is currently serving a request at cylinder 43/and previous request was at cylinder 25. The queue of pending request, in FIFO order is: 55, 58, 39, 18, 90, 160, 150, 38, 184. Starting from the current head position, what is total distance (in cylinders) that the disk arm moves to satisfy all pending request for each of following disk scheduling algorithms? a) FCFS b) SSTF c) C-SCAN d) LOOK

      10
    3. 11.

      Differentiate between internal and external fragmentation? Explain briefly with examples and procedure to remove the types of fragmentation.

      10

    — The End —