Question Bank

1.     Write short note on early operating system. List the differences between multiprogramming and Time-sharing systems.

2.      Explain the architecture of an operating system.

3.      List out the various process states and briefly explain with a state diagram.

4.      What do you mean by processor scheduling? Explain the various levels of scheduling.

5.      Explain the methods of dead lock prevention and avoidance.

6.      Write briefly on fragmentation and swapping.

7.     Why disk scheduling is necessary? Explain the different seek optimization techniques.

8.      Describe the different mechanisms used to protect a file.

9.      Explain the design principles of Unix.

10.  Write a short note on Unix file system.

11.  Write short notes on Demand Page Memory management.

12.  What is segmentation? State it usages.

13.  Explain the concepts involved in maintaining the file system security.

14.  Write short notes on double - buffering.

15.  List the various merits of treating directories and devices as file in Unix.

16.  Write short notes on I/O systems on Unix.

17.  Explain the various functions of an operating system from a system programmer's view.

18.  What is semaphore? Explain the application of semaphore.

19.  Compare preemptive and non-preemptive algorithm.

20.  Explain the Banker's algorithm for dead -lock avoidance.

21.  Explain any four page replacement algorithms.

22.  State about virtual memory concept.

23.  Describe the various disk scheduling algorithms.

24. Give an overview of the various protection and access control mechanisms implemented in a file system.

25. Discuss the file protection mechanisms incorporated in a Unix file system.

26.  List the calls in Unix for process management and write the function of each.

27.  How does multi programming help in achieving improved utilization of a computer system?

28.  With necessary diagram explain the term "process" from the operating system point of view.

29.  Briefly explain the four major functions of an operating system.

30.  Give the main feature of the following types of OS outlining their limitations and strengths: Interactive Time sharing OS, Real Time OS.

31.  Consider the following set of processes, with the length of CPU-burst time given in millisecond. Process Burst time Priority

p1 10 3

p2 1 1

p3 2 3

p4 1 4

p5 5 2

The processes are assumed to have arrived in order p1,p2,p3,p4,p5 all at time 0.

(i)                 Draw Gantt chats illustrating the execution of these processes using FCFS, SJF, a non-preemptive priority ( a smaller priority number implies a higher priority) and RR (quantum=1) scheduling

(ii)               (ii) What is the turnaround time of each process for each of the scheduling algorithms in part (i)?

32.  What two advantages do threads have over multiple processes?

33.  What major disadvantage do they have? Suggest one application that would benefit from the use of threads, and one that would not.

34.  Define the requirement of the correct solution. How semaphores are used to solve dining philosopher’s problem.

35.  An operating system contains three resource classes, namely R1, R2 and R3. The number of resource units in these classes is 7,7 and 10 respectively. The current resource allocation state is as shown below :

Process Allocated Resources Maximum Requirement

R1 R2 R3 R1 R2 R3

P1 2 2 3 3 6 8

P2 2 0 3 4 3 3

P3 1 2 4 3 4 4


(i) Is the current allocation state safe?[Marks 4]

(ii)Would the following requests be granted in the current state?

(1) Process P1 requests(1, 1, 0) [Marks 4]

(2) Process P3 requests(0, 1, 0) [Marks 4]

(3) Process P2 requests(0, 1, 0) [Marks 4]

36.  Explain some of the most common techniques for structuring the page table.

37.  Explain the principles of segmentation with examples.

38.  Consider the following page reference string :

1,2,7,8,3,4,2,1,4,2,5,6. How many page faults would occur for the following page replacement algorithms, assuming an allocation of 3 frames?

                                                              i.       (i) LRU

                                                            ii.      (ii) FIFO

                                                          iii.      (iii) Optimal.

39.  Explain the concept of demand paging.

40.  How does the system detect trashing? Once it detects trashing what the system do to eliminate this problem?

41.  Describe the salient features of the file system of UNIX.

42.  Explain UNIX buffer cache mechanism.

43.  Explain different disk scheduling Techniques.

44.  Explain different directory implementation methods.

45.   Write an algorithm for implementing Dining philosopher problem using semaphores. Also describe the problems and the algorithm in detail.

46.  What is the time stamping scheme of distributed system for mutual exclusion? Explain the functioning of the scheme through a diagram.

47.  Discuss various machine level implementation of mutual exclusion in general. Also discuss suitability and efficiency of these algorithms.

48.  Explain the advantages and disadvantages of segmented and paged implementation of virtual memory. Explain through a diagram, the principles of address translation in combined segmentation and paging. What is the drawback of this translation scheme?

49.  Describe Belady's anomalous behavior of FIFO.

50.  What is thrashing? What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what are the techniques to prevent it?

51.  Discuss the difference between preemptive and non-preemptive scheduling.

52.  Discuss scheduling and inter-processor communication suitable for hypercube multiprocessor operating system.

53.  What is RPC (Remote Procedure Call)? What is the major issue in implementing the RPC? Describe them briefly.

54.  Describe the functioning of DES. What are its advantages and disadvantages?

55.  Describe deadlock detection and recovery algorithm for centralized operating system.

Contact: Tushar B Kute (

Tushar B Kute,
Sep 21, 2012, 7:40 PM
Tushar B Kute,
Sep 21, 2012, 7:40 PM
Tushar B Kute,
May 26, 2011, 2:56 AM