SVNCE

CS- GATE-2015-MODEL QUESTION-OPERATING SYSTEMS

DEPT: OF CSE

Q 1 - 15 Carry 1 Mark Each

1. Interval between the time of submission and completion of the job is called;
A. waiting time
B. turnaround time
C. throughput
D. response time
2. A deadlock in an operating system is
A. desirable process
B. undesirable process
C. definite waiting process
D. all of the above
3. Three concurrent processes X, Y, and Z execute three different code segments that access and
update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b
and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P
operation on semaphores c, d, and a before entering the respective code segments. After
completing the execution of its code segment, each process invokes the V operation (i.e., signal)
on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of
the following represents a deadlock free order of invoking the P operations by the processes?
A. X :P (a )P (b)P (c) Y :P (b )P (c)P (d) Z :P (c )P (d)P (a)
B. X :P (b )P (a)P (c) Y :P (b )P (c)P (d) Z :P (a )P (c)P (d)
C. X :P (b )P (a)P (c) Y :P (c )P (b)P (d) Z :P (a )P (c)P (d)
D. X :P (a )P (b)P (c) Y :P (c )P (b)P (d) Z :P (c )P (d)P (a)
4. A scheduling algorithm assigns priority proportional to the waiting time of a process. Every
process starts with priority zero(the lowest priority). The scheduler re-evaluates the process
priorities every T time units and decides the next process to schedule. Which one of the following
is TRUE if the processes have no I/O operations and all arrive at time zero?
A. This algorithm is equivalent to the first-come-first-serve algorithm.
B. This algorithm is equivalent to the round-robin algorithm.
C. This algorithm is equivalent to the shortest-job-first algorithm.
D. This algorithm is equivalent to the shortest-remaining-time-first algorithm
5. A process execute the code
fork();
fork();
fork();
The total number of child processes created is:
A. 3
B. 4
C. 7
D. 8
SVNCE:

An Institute that will make your future bright

Page 1

SVNCE

CS- GATE-2015-MODEL QUESTION-OPERATING SYSTEMS

DEPT: OF CSE

6. Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on demand paged virtual

memory system running on a computer system that has main memory size of 3 page frames
which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page fault under
corresponding page replacement policy. Then
A. OPTIMAL < LRU < FIFO
B. OPTIMAL < FIFO < LRU
C. OPTIMAL = LRU
D. OPTIMAL = FIFO
7. In order to allow only one process to enter its critical section, binary semaphore are initialized to:
A. 0
B. 1
C. 2
D. 3
8. The memory allocation scheme subject to external fragmentation is;
A. segmentation
B. swapping
C. paging
D. fixed contiguous partition
9. Average processes size is s bytes . Each page entry requires e bytes. The optimum page size is
given by;
A.

(se)

B.

(2se)

C. s
D. e
10. Consider the following performance table for FCFS scheduling. For this , the throughput will be;
A. 0.184
B. 0.192
C. 0.269
D. 0.238
11. The address sequence generated by tracing a particular program executing in a pure demand
paging system with 100 records per page, with 1 free main memory frame is recorded as follows:
0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370. What is the
number of page faults?
A. 13
B. 8
C. 7
D. 10
12. Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given
below:
Process Arrival
CPU time Priority
number time(ms) needed(ms)
P1
0
10
5
P2
0
5
2
P3
2
3
1
SVNCE:

An Institute that will make your future bright

Page 2

SVNCE

CS- GATE-2015-MODEL QUESTION-OPERATING SYSTEMS

DEPT: OF CSE

P4
5
20
4
P5
10
2
3
If the CPU scheduling policy is FCFS, the average waiting time will be:
A. 12.8 ms
B. 8 ms
C. 16 ms
D. 20 ms
13. Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given
below:
Process Arrival
CPU time Priority
number time(ms) needed(ms)
P1
0
10
5
P2
0
5
2
P3
2
3
1
P4
5
20
4
P5
10
2
3
If the CPU scheduling policy is SJF, the average waiting time (without preemption) will be:
A. 12.8 ms
B. 6.8 ms
C. 17 ms
D. 7.2 ms
14. Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given
below
Process Arrival
CPU time Priority
number time(ms) needed(ms)
P1
0
10
5
P2
0
5
2
P3
2
3
1
P4
5
20
4
P5
10
2
3
If the CPU scheduling policy is SJF, the average waiting time (with preemption) will be

A. 8 ms
B. 14 ms
C. 5.6 ms
D. 7 ms
15. Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given
below
Process Arrival
CPU time Priority
number time(ms) needed(ms)
P1
0
10
5
P2
0
5
2
P3
2
3
1
P4
5
20
4
P5
10
2
3
SVNCE:

An Institute that will make your future bright

Page 3

SVNCE

CS- GATE-2015-MODEL QUESTION-OPERATING SYSTEMS

DEPT: OF CSE

If the CPU scheduling policy is priority scheduling without preemption, the average waiting time
will be:
A. 12.8 ms
B. 11.8 ms
C. 10.8 ms
D. 11 .0 ms

Q 15 30 Carry Two Mark Each

16. Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given
below
Process Arrival
CPU time Priority
number time(ms) needed(ms)
P1
0
10
5
P2
0
5
2
P3
2
3
1
P4
5
20
4
P5
10
2
3
If the CPU scheduling policy is priority scheduling with preemption, the average waiting time
will be
A. 19 ms
B. 7.6 ms
C. 8 ms
D. 9.0 ms
17. Given, references to the following pages by a program: 0, 1, 4, 2, 0, 2, 6, 5, 1, 2, 3, 2, 1, 2, 6, 2, 1,
3, 6, 2. Number of page faults will occur , if the program has 3 page frames available to it and
uses FIFO replacement:
A. 7
B. 8
C. 13
D. none
18. Given, references to the following pages by a program: 0, 1, 4, 2, 0, 2, 6, 5, 1, 2, 3, 2, 1, 2, 6, 2, 1,
3, 6, 2. Number of page faults will occur , if the program has 3 page frames available to it and
uses LRU replacement
A. 14
B. 12
C. 10
D. none
19. Given, references to the following pages by a program: 0, 1, 4, 2, 0, 2, 6, 5, 1, 2, 3, 2, 1, 2, 6, 2, 1,
3, 6, 2. Number of page faults will occur , if the program has 3 page frames available to it and
uses Optimal page replacement
A. 7
B. 9
C. 11
D. none
SVNCE:

An Institute that will make your future bright

Page 4

SVNCE

CS- GATE-2015-MODEL QUESTION-OPERATING SYSTEMS

DEPT: OF CSE

20. On a disk with 1000 cylinders, number 0 to 999, compute the number of tracks the disk arms
must move to satisfy the entire request in the disk queue. Assume the last request serviced was at
track 345 and the head is moving towards 0. The queue in FIFO order contain request for the
following tracks 123, 874, 692, 475, 105, 376. Perform the computation for the FIFO scheduling
algorithms:
A. 1013
B. 1713
C. 2013
D. none
21. On a disk with 1000 cylinders, number 0 to 999, compute the number of tracks the disk arms
must move to satisfy the entire request in the disk queue. Assume the last request serviced was at
track 345 and the head is moving towards 0. The queue in FIFO order contain request for the
following tracks 123, 874, 692, 475, 105, 376. Perform the computation for the SSTF scheduling
algorithms:
A. 1198
B. 1298
C. 1398
D. none
22. On a disk with 1000 cylinders, number 0 to 999, compute the number of tracks the disk arms
must move to satisfy the entire request in the disk queue. Assume the last request serviced was at
track 345 and the head is moving towards 0. The queue in FIFO order contain request for the
following tracks 123, 874, 692, 475, 105, 376. Perform the computation for the SCAN
scheduling algorithms:
A. 1219
B. 1119
C. 1019
D. none
23. On a disk with 1000 cylinders, number 0 to 999, compute the number of tracks the disk arms
must move to satisfy the entire request in the disk queue. Assume the last request serviced was at
track 345 and the head is moving towards 0. The queue in FIFO order contain request for the
following tracks 123, 874, 692, 475, 105, 376. Perform the computation for the C-SCAN
scheduling algorithms:
A. 1967
B. 1567
C. 1267
D. none
24. On a disk with 1000 cylinders, number 0 to 999, compute the number of tracks the disk arms
must move to satisfy the entire request in the disk queue. Assume the last request serviced was at
track 345 and the head is moving towards 0. The queue in FIFO order contain request for the
following tracks 123, 874, 692, 475, 105, 376. Perform the computation for the LOOK
scheduling algorithms:
A. 809
B. 1009
C. 909
SVNCE:

An Institute that will make your future bright

Page 5

SVNCE

25.

26.

27.

28.

29.

30.

CS- GATE-2015-MODEL QUESTION-OPERATING SYSTEMS

DEPT: OF CSE

D. none
On a disk with 1000 cylinders, number 0 to 999, compute the number of tracks the disk arms
must move to satisfy the entire request in the disk queue. Assume the last request serviced was at
track 345 and the head is moving towards 0. The queue in FIFO order contain request for the
following tracks 123, 874, 692, 475, 105, 376. Perform the computation for the C-LOOK
scheduling algorithms:
A. 1107
B. 1507
C. 1207
D. none
A semaphore count of negative n means(S = -n) that the queue contains. waiting
processes:
A. n+1
B. n
C. n-1
D. 0
Consider a logical address space of 8 pages of 1024 words mapped to a memory of 32 frames.
How many bits are there in the logical address space:
A. 13
B. 15
C. 14
D. 12
Consider a logical address space of 8 pages of 1024 words mapped to a memory of 32 frames.
How many bits are there in the physical address space:
A. 16
B. 14
C. 15
D. 12
A single processor system has 3 resource type X,Y and Z, which is shared by 3 processes. There
are 5 units of each resource type. Which of the following process will finish last?
Alloc
Request
Avail
X Y Z
X Y Z
X Y Z
P0
1 2 1
1 0 3
0 1 2
P1
2 0 1
0 1 2
P2
2 2 1
1 2 0
A. P0
B. P1
C. P2
D. System is in deadlocked state
At a particular time of computation , the value of counting semaphore is 7. Then 20 P operations
and X V operations are completed on this semaphore. If the final value of semaphore is 5, value
of X will be:
A. 15
B. 22
C. 13

SVNCE:

An Institute that will make your future bright

Page 6

SVNCE

CS- GATE-2015-MODEL QUESTION-OPERATING SYSTEMS

DEPT: OF CSE

D. 18

ANSWERS
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

SVNCE:

B
B
B
B
C
B
B
A
B
B
B
A
B
C
C

An Institute that will make your future bright

16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

B
C
A
B
C
B
A
A
B
B
A
A
C
C
D

Page 7