Question Answer Logo

Question Answer

operating system summer 2022

(Download Original Question Paper)

322456(22)

B. E. (Fourth Semester) Examination

APR-MAY2022

(New Scheme)

(CSE Branch)

OPERATING SYSTEM

Time Allowed: Three hours

Maximum Marks: 80

Minimum Pass Marks: 28

Note: Attempt all questions. Part (a) of each question is compulsory and carries 2 marks. Attempt any two parts from (b), (c) and (d) which carry 7 marks each.

click on question to view answer...
  1. Q.1
    (a)

    Define Time Sharing Operating System.

    2
  2. Q.1
    (b)

    Explain the following in brief:

    (i) Operating system services

    (ii) Batch operating system

    (ii) Multiprogrammed operating system

    7
  3. Q.1
    (b)

    What are the system components of an operating system? Explain them in brief.

    7
  4. Q.1
    (d)

    Explain the layered architecture of operating system.

    7
  5. Q.2
    (a)

    What is' Process? Draw the state transition diagram of a process state.

    2
  6. Q.2
    (b)

    What is Critical Section Problem? Give the solution for critical section problem.

    7
  7. Q.2
    (c)

    Explain Priority and Round Robin scheduling algorithm in detail. Implement these algorithm and find the average waiting time: (Time quantum = 4 𝜇s).


      P1: Burst = 10, Priority = 3

    P2: Burst = 1, Priority = 1

    P3: Burst = 2, Priority = 4

    P4: Burst = 1, Priority = 5

    P5: Burst = 5, Priority = 2

    7
  8. Q.2
    (d)

    What is Concurrency Control? Explain with clanical problem.

    7
  9. Q.3
    (a)

    List the four necessary conditions for the occurance of deadlock. Explain in short.

    2
  10. Q.3
    (b)

    What are the different methods for handling dead- lock? Explain deadlock prevention in detail.

    7
  11. Q.3
    (c)

    Consider a system with 5 processes P0 through P4 and three resource types A, B and C. The following snapshot of the system has been taken 


    		 Allocation Max Available

    		A B C A B C A B C
    P0 0 1 0 7 5 3 3 3 2
    P1 2 0 0 3 2 2


    P2 3 0 2 9 0 2


    P3 2 1 1 2 2 2


    P4 0 0 2 4 3 3


    1. Find the need matrix.
    2. Is the system safe? Explain.
    7
  12. Q.3
    (d)

    Explain deadlock detection and recovery in detail

    7
  13. Q.4
    (a)

    What is Trashing?

    2
  14. Q.4
    (b)

    Describe segmentation and its implementation.

    7
  15. Q.4
    (c)

    Explain the concept of demand paging with example.

    7
  16. Q.4
    (d)

    Explain the following in brief:

    (i) Cache memory

    (ii) Virtual memory

    7
  17. Q.5
    (a)

    What is Buffering?

    2
  18. Q.5
    (b)

    What is input/output buffering? Explain with their types

    7
  19. Q.5
    (c)

    Explain file organisation and its access mechanism.

    7
  20. Q.5
    (d)

    Write short notes on:

    (i) File sharing

    (ii) File directories

    7