Operating System

7 Years Question
Assignment

Quote of the day: “ The greatest amount of wasted time is the time not getting
started ”

1. What is scheduling ? Define preemptive and non-preemptive scheduling

with the help of an example.
2. Explain FCFS.
3. Define the term
4. Describe the term :

i. Scheduling queues

ii. Scheduler

iii. Context switch.

5. Define following terms :
 Dead line
 Response time
 Throughput
 Turnaround time
6. Explain Round robin algorithm with suitable example.
7. Explain any four operations which can be performed on file.
8. Describe four conditions for dead locking.
9. Describe types of scheduler used in scheduling.

P.T.O.
10. Compare paging and segmentation.
11. What are the different file allocation method ? Explain any one in detail
with example.
12. What is partitioning ? Explain concept of variable memory
partitioning withexample.
13. Consider the following page reference string – 1, 2, 3, 4, 5, 3, 4, 1, 6,
7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5. How many page faults occur for FIFO
replacement algorithm assuming 3 frames ?

14. State and describe different memory management technique

15. Describe Shortest Remaining Time (SRTN) algorithm with the help of
example.
16. Describe the sequential file access method.
17. Explain LRU page replacement algorithm by taking suitable example.
18. Explain static and dynamic memory partioning with advantages and
drawback.
19. With suitable diagram explain contiguous allocation method.
20. Write steps for Banker’s algorithm to avoid deadlock. Also give one
example.
21. Explain concept of page replacement with suitable diagram
22. Explain multilevel queue scheduling with example.
23. Explain two level directory structure with the help of diagram.
24. List different types of files. Explain basic operations on file.

25. Describe working of sequential and direct access methods.

26. Describe concept of virtual memory with suitable example.

27. State and explain criteria in CPU scheduling.

28. Write in short on basic memory management.
P.T.O.
29. Describe following terms
1. Scheduling queues 2) Schedular
3) Thread 4) Multithreading.

30. Describe optimal page replacement algorithm with example.

31. Define swapping ? When it is used ?
32. Explain the concept of variable memory partitioning with example.
33. Explain Bit map free-space management technique.
34. Write use of following system calls.

i. fork( )

ii. exec( )

iii. abort( )

iv. end( )

35. Consider the following set of processes, with the length of

the CPU burst given in milliseconds.

Process Burst Priority

Time
P1 10 3

P2 1 1

P3 2 3

P4 1 4

P5 5 2

Find out average waiting time by using

1. nonpreemptive priority
P.T.O.
 2. Round-Robin (RR) (quantum = 1)
36. The job are scheduled for execution as follows solve the problem
using:

i. SJF

ii. FCFS
also find average waiting time using Gantt chart.

Process Arrival Burst

time

P1 0 8

P2 1 4

P3 2 9

P4 3 5

37. Give difference between

External fragmentation and
Internal fragmentation (four
points)

38. Consider the following four jobs.

Job Burst
Time
J1 8
J2 5

P.T.O.
 J3 5
J4 13

Find average waiting time for

(i) FCFS

(ii) SJF
39. Describe indexed allocation method with advantage and
disadvantage.
40. Explain single level directory structure.
41. Calculate average locating time for SJF (Shortest Job
First)and round robin (RR) algorithm for following table.

Process Burst time

P1 10

P2 04

P3 09

P4 06

(Time slice 4 m sec).

42. Explain context switch with help of diagram.

43.Explain following terms with respect to Memory management :

 Compaction
 Swapping

P.T.O.
 44. Given a page reference reference string(arrival) with four page
frames, calculate the page faults with FIFO and LRU page
replacement algorithms respectively : 12, 3, 4, 5, 1, 2, 5, 1, 2, 3, 4, 5,
1,6,7,8,7,8,9,7,8,9,5,4,4,5,4,2.

45. Solve given problem by Using FCFS to calculate average waiting

time and turnaround time.
Proce Arrival Burst
ss time time
P1 0 7
P2 1 4
P3 2 9
P4 3 6
P5 4 8
46. Compare between bitmap and linked list free space management
techniques.(any six points)
47. Construct and explain directory structure of a file system in terms of
single level, two level and tree structure.

48. Differentiate between Long term scheduler and Short term scheduler
w.r.t. following points:
i) Selection of job

ii) Frequency of execution

iii) Speed

iv) Accessing which part of system.

P.T.O.
MSBTE NEXT ICON COURSE YOUTUBE CHANNEL – UR ENGINEERING FRIEND