IMP Question Bank

1.What is Operating System? List types of Operating System & Explain Time
sharing Operating System.

2.With the help of process state diagram explain different states of process.

3. Write & explain necessary condition for deadlock to occur.

4.Explain SRTN (Shortest Remain Time Next) scheduling in detail. OR (b) Explain
SJF (Shortest Job First) scheduling in detail.

5. Explain Operating System services.

6.Explain virtual memory in detail.

7. What is fragmentation. Explain in brief.

8.Explain mutual exclusion in detail.

9.Explain memory relocation & protection with suitable example.

10.Explain File operations in detail.

11. Explain page memory management in detail.

12 Explain directory structure of Operating System.

13. Explain following command with example. (i) cmp (ii) grep (iii) sort

14. Write following Shell scripts. (i) To find maximum out of three numbers (ii)
To check whether the given number is ODD or EVEN.

15.(a) Explain following command with example. (i) cat (ii) diff (iii)
head

16.Define OS.

17.Define OS and given its goal.

18.Explain components of computer system.

 IMP Question Bank
19. List out services of operating system from user point of view.

20.List out services of operating system from system point of view.

21.list out types of OS.

22.explain and list different types of os.

23.write a short note on multiprogramming OS.

24.write a short note on Time sharing OS.

25.write a short note on Real time OS.

26.write a short note on multiprocess OS.

27.List out attributes of file.

28. Show memory hierarchy in memory management.

29.Explain mutual exclusion

30. Explain fixed size partitioning in memory management.

31. Explain round robin algorithm with example.

32. Explain preemptive and non-preemptive scheduling with example

33. Describe external fragmentation.

34. Describe swapping of memory management.

35. List out disk space allocation methods. Explain any one.

36.Explain in brief: Linux directory structure.

37. Explain multiprogramming with dynamic partition

38. Explain Logical structure of a disk.

39. Explain address translation in paging.

 IMP Question Bank
40. Explain deadlock with example and diagram.

41.Define process ,program.

42.explain process life cycle.

43.Explain process control block.

44.write short note :context switch.

45.define dedlock.

46. Explain Fragmentation.

47. Write down advantages and disadvantages of Segmentation.

48. Explain types of Schedulers.

49. Explain Memory management with dynamic partition.

50.Explain physical structure of a Disk.

51. Explain various File operations.

52. Explain FCFS scheduling algorithm. Draw the Gantt chart and find average
waiting time for FCFS and SJF algorithms.

53. Explain Memory relocation and protection in detail.

54. What is swapping?.

55. Explain round robin processing scheduling algorithm with suitable example.

56. Explain segmentation memory management technique.

57. List out types of OS and Explain each and every types of OS.

58. Explain types of Scheduler. Or Explain long term, medium term and short term
Schedulers.

59.Explain types of Scheduling Algorithm and Explain all type in detail. Or

 IMP Question Bank
List out all Scheduling algorithm .Explain any two in detail.

60.Explain FCFS process Scheduling algorithm with example.

61.Explain RR process Scheduling algorithm with example.

62.Explain SJF process Scheduling algorithm with example.

63.Explain process Synchronization in detail.

64.Define Critical Section.

65.Explain Mutual exclusion in details.

66.What is deadlock?Explain.

67. Differentiate:Logical addresses v/s physical addresses.

68. Define memory management(memory manager) unit. Explain functionalities

of memory management unit.

69.Write a short note on: Memory Allocation.

70.Write a short note on: Single process monitor.

71.Write a short note on: Multiprogramming with Fixed partitions. Or

Multiprogramming with Static partitions.

72.Write a short note on: Multiprogramming with Dynamic partitions.

73.What is fragmentation? Explain in brief. Or Define fragmentation with its

types.

74. Explain Contiguous memory allocation with Advantage and Disadvantage.

75. Explain Non-Contiguous memory allocation with Advantage and Disadvantage.

76.Write a short note on: paging.

77.Explain different page Replacement Algorithms in OS.

 IMP Question Bank
78.Write a short note on: Segmentation.

79.write a short note on: Swapping.

80.Explain Virtual Memory.

81.Expalin page Replacement Algorithms in FIFO and LRU with example.

82.Explain physical structure of a disk.

83.Explain logical structure of a disk.

84.what is file.

85 .List out file attributes.

86.Explain file operations in details.

87.Explain file Structures.

88.Write a short note on file types.

89.Explain Directory structure of OS.

90.Explain Disk space allocation methods.

91.Explain File Safety (Reliability and protection).

92.Explain Disk Structure.

93.Explian Disk Scheduling Algorithm – SCAN, CSCAN.

94.Write a short mote on: features of Linux .

95.Explain linux architecture.

96.Explain Linux file system.

97.Explain directory structure used by linux.

98.Write a short note on:shell.

 IMP Question Bank
99. Explain following unix command: 1) PWD 2) ls 3) cp

100. Write a shell script to find maximum number from given three numbers.

101. Write a shell script to sum of 1 to 10 using while loop.

102. Explain Characteristics of Linux operating system.

103. Write a shell script to find factorial of a given number.

104. Explain file operations in detail.

105.Explain various directory related commands in linux.

106.Explain various file related commands in linux.

107.Explain various general purpose commands in linux.

108.Discuss filter commands in linux with example.

109. Calculate average waiting time and average turnaround time for FCFS
algorithm with gantt chart for following data.

Process Arrival Time Time required for

completion
P0 0 6
P1 1 4
P2 3 2
P3 5 1
 IMP Question Bank
110. Calculate average waiting time and average turnaround time for SJF
algorithm with gantt chart for following data.

Process Arrival Time Time required for

completion
P0 0 6
P1 1 4
P2 3 2
P3 5 1

111. Calculate Average waiting time and average turnaround time for Round
Robin algorithm with gantt chart for following data. (Time Quantum = 2)

Process Arrival Time Time Required for

Completion
P0 0 5
P1 1 3
P2 3 2
P3 5 1

112.Consider page reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7 with 3 page

frames. Find the number of page faults using page replacement FIFO and LRU
Algorithm.
IMP Question Bank