NATIONAL INSTITUTE OF TECHNOLOGY, KURUKSHETRA

THEORY EXAMINATION
Question Paper
Programme: B.Tech. 7Th Sem Course code: CSOE41
Subject: Operating System Maximum Marks: 50
Number of Questions to be Attempted: 5 Time Allowed: 2hours
Total No. of Questions: 5 Total No. of Pages: 2
Note: There is internal choice in Question no. 1 and 3.

1 (a) What are various objectives and functions of Operating System. 5

(b) Describe the differences among Short-term, Medium-term, and 5

Long-term scheduling with suitable diagram.

OR
Consider the following set of processes, with the length of the CPU 10
burst given in milliseconds: Process Burst Time Priority

The processes are assumed to have arrived in the order P1, P2, P3, P4,
P5, all at time 0.
a. Draw four Gantt charts that illustrate the execution of these processes
using the following scheduling algorithms: FCFS, SJF, and RR
(quantum = 2).
b. What is the turnaround time of each process for each of the
scheduling algorithms in part a?
c. What is the waiting time of each process for each of these scheduling
algorithms?
d. Which of the algorithms results in the minimum average waiting time
(over all processes)

2 (a) What is the important feature of critical section? State the Readers 6
Writers problem and give solution using semaphore.

(b) Explain necessary condition of deadlock. 4

3 (a) Explain about First fit, best fit, and Worst fit. The jobs and memory 6
requirement as given follows
 Job 1 90k
Job 2 20k
Job 3 50k
Job 4 200k
and the free space memory allocation blocks be 50K, 100K, 90K, 200K,
50K. Explain which job will go to which free memory block using first
fit, best fit, and worst fit.

(b) Differentiate External Fragmentation with Internal Fragmentation

with example. 4
OR
(a) Explain difference between Paging and Segmentation? 4

(b) Consider reference string 1,2,3,4,1,2,5,1,2,3,4,5 and find number of

page faults using FIFO, LRU, Optimal page replacement algorithm. 6
frame size =3
4 (a) Write down different Directory Structure in detail with their 6
advantage and disadvantage.

(b) Explain Layered Architecture in relation to file management. 4

5 (a) Name the different file allocation methods. Explain the linked 5
allocation of file implementation with merits and demerits.

(b) Explain different methods used to solve the problem of security at 5

the operating system level.