1.practice Questions and Solutions Set-1

Ravindrababu Ravula www.ravindrababuravula.
com Ravindrababu Ravula
OS PRACTICE SET - 1
(Processes - States, PCB, Schedulers, Threads and System calls, CPU scheduling - FCFS,
SJFS, priority scheduling, Round robin, multi level queue scheduling, multilevel feedback queue
scheduling)
[Updated : 11/Sep/2020]
1) Consider the process information for set of processes, assuming the context switch
delay to be 0, calculate the average waiting time, average turn around, average
response time and throughput, using first come first serve scheduling algorithm.
Process Arrival time Burst time
P1 0 5
P2 2 3
P3 6 2
P4 7 3
Solution : Average Turnaround Time = 5.25, Average Waiting Time = 2.00, Average
Response Time = 2.00, Throughput = 0.31 process/unit time.
P1 1 5
P2 2 3
P3 3 8
P4 7 3
Response Time = 5.00, Throughput = 0.2 process/unit time
Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

P1 0 5
P2 7 3
P3 8 8
P4 9 3
P1 0 5
P2 7 3
P3 8 8
P1 0 5
P2 7 8
P3 8 8

delay to be 0, calculate the average waiting time and average waiting time using
Shortest Job first scheduling algorithm.
P1 0 5
P2 2 3
P3 6 2
P4 7 3
delay to be 0, calculate the average waiting time and average waiting time using using
P1 1 5
P2 2 3
P3 3 8
P4 7 3
P1 0 5

P2 7 3
P3 8 8
P4 9 3
P1 0 5
P2 7 3
P3 8 8
response time and throughput, using Non preemptive Priority scheduling algorithm.
(Higher number implies higher priority)
Process Arrival time Burst time Priority
P1 0 5 1
P2 2 3 2
P3 6 2 3
P4 7 3 4

P1 1 5 1
P2 2 3 3
P3 3 8 5
P4 7 3 2
P1 0 5 2
P2 7 3 1
P3 8 8 4
P4 9 3 0

P1 0 5 1
P2 7 3 2
P3 8 8 0
P1 0 5 3
P2 7 6 1
P3 7 8 0
response time and throughput, using preemptive Priority scheduling algorithm. (Higher
number implies higher priority)
P1 0 5 1
P2 2 3 2
P3 6 2 3
P4 7 3 4

response time and throughput, using preemptive Priority scheduling algorithm.(Higher
P1 1 5 1
P2 2 3 3
P3 3 8 5
P4 7 3 2
P1 0 5 2
P2 7 3 1
P3 8 8 4
P4 9 3 0

P1 0 5 1
P2 7 3 2
P3 8 8 0
response time and throughput, using preemptive Priority scheduling algorithm. (Higher
P1 0 5 3
P2 7 6 1
P3 7 8 0
response time and throughput, using SRTF scheduling algorithm.
P1 0 5

P2 2 3
P3 6 2
P4 7 3
Solution : Average Turnaround Time = 5.25 Average Waiting Time = 2.00 Average
Response Time = 2.00 Throughput = 0.31 process/unit time
P1 1 5
P2 2 3
P3 3 8
P4 7 3
P1 0 5
P2 7 3
P3 8 8
P4 9 3

P1 0 5
P2 7 3
P3 8 8
P1 0 5
P2 7 8
P3 8 8
response time and throughput, using RR scheduling algorithm, time quantum=2.

P1 0 5
P2 2 3
P3 6 2
P4 7 3
P1 1 5
P2 2 3
P3 3 8
P4 7 3
P1 0 5
P2 7 3
P3 8 8

P4 9 3
P1 0 5
P2 7 3
P3 8 8
P1 0 5
P2 7 8
P3 8 8
delay to be 0, calculate the average waiting time, and average turn around, using HRRN
scheduling algorithm.

P1 0 5
P2 2 3
P3 6 2
P4 7 3
Solution : Average waiting time: 2.000000, Average Turn Around time: 5.250000
P1 0 5
P2 7 3
P3 8 8
P4 9 3
Solution : Average waiting time:1.5, Average Turn Around time:6.25
P1 0 5
P2 7 3
P3 8 8
Solution : Average Turnaround Time = 6.00, Average Waiting Time = 0.67

P1 0 5
P2 7 8
P3 8 8
Solution : Average Turnaround Time = 9.33, Average Waiting Time = 2.33

36) Which of the following is used to obtain OS services:
(a) Hardware (b) System calls

(c) Both A & B (d) None of the above
Solution: Option (b)
37) If we disable interrupts, it is not possible to
(a) invoke system calls (b) preempt process from CPU

(c) indicate compilation of I/O (d) All of the above
Solution: Option (d)
38) Which is the service not provided by an OS
(a) File system manipulation (b) Memory management

(c) Process scheduling (d) None of the above
39) Process control block does not contain
(a) Process ID (b) User identification number

(c) Registers (d) None of the above

40) Which of the process transitions is invalid?
(a) Run📫Ready (b) Suspend wait 📫 Suspend ready

(c) Wait/Block📫Run (d) None of the above
Solution: Option (c)
41) In which of the following case CPU utilization will be higher?
(a) If all the processes are I/O bound

(b) Is all the processes are equally CPU bound and I/O bound
(c) If all the processes are CPU bound
(d) Both (B) and (C)
42) The process in which of the following states will be in secondary memory?
(a) New, Ready, Wait/Block

(b) New, Wait/Block, Suspend wait, Suspend ready
(c) wait/Block, Suspend wait, Suspend ready
(d) New, Suspend wait, Suspend ready
43) Degree of multiprogramming is controlled by
(a) Long term schedule (b) Short term schedule

(c) Medium term schedule (d) Depends on number of CPU’s
Solution: Option (a)
44) Which of the following affects the performance of the CPU?
(a) LTS (b) STS

(c) MTS (d) All of the above
45) Which technique was introduced because a single job could not keep both the CPU and I/O
devices busy?
(a) Time- sharing (b) Spooling

(c) Preemptive scheduling (d) Multiprogramming
46) Consider a system with ‘M’ CPU processors and ‘N’ processes then how many processes can
be present in ready, running and blocked state at minimum
(a) 1,0,0 (b) 0,1,1

(c) 1,1,0 (d) 0,0,0
47) Consider a system with ‘M’ CPU processors and ‘N’ processes then how many processes can
be present in ready, running and blocked state at maximum
(a) N, M, N (b) N, M, M
(c) M, N, M (d) N, N+M, M
49) Turnaround time TAT of a process P is
(a) CTi – Ati where CTi is Completion time and ATi is Arrival time
(b) BTi + WTi where BTi is Burst time and WTi is Waiting time
(c) None of the above
(d) Both (a) and (b)
50) What are the typical elements of a process image?

(a) User data

(b) System Stack

(c) Process control Block
(d) All of the above
Solution : Option (d)
51) What is the output of the following code :
int main()
{
fork();
printf("Hello world!");
return 0;
}
Solution : Hello world! Hello world!
52) The number of child processes are created using the following code :
int main()
{
fork();
fork();
fork();
return 0;
}
Solution : 7
53) The possible value of x are :
int main()
{
int x = 1;
if (fork() == 0)
printf("Child has x = %d\n", ++x);
else
printf("Parent has x = %d\n", --x);
}
Solution : 0,2
54) Which one of the following is not shared by threads?

A. program counter
B. stack
C. both (A) and (B)
D. none of the mentioned
Solution : C
55) Differentiate between User level and Kernel level threads.
Solution :
Factors User Level Threads Kernel Level Threads
Implementation implemented by users kernel threads are implemented by

OS.
OS Support OS doesn’t recognize user level Kernel threads are recognized by OS

threads
Implementation Implementation of User threads Implementation of Kernel thread is

Complexity is easy. complicated.
Context switch Context switch time is less. Context switch time is more.
Hardware Context switch requires no Hardware support is needed.

Support for hardware support
Context switch
If one user level thread perform If one kernel thread perform blocking
Impact of IO blocking operation then entire operation then another thread can
calls process will be blocked. continue execution.
56) Does FCFS suffers from Convoy Effect?
(a) Yes (b) No

(c) Not defined (d) None

57) What is the drawback of SJF Algorithm?
(a) SJF has minimum Avg. TAT and Avg. WT.

(b) It is practically not possible to predict Burst time
100% accurately before even executing the process.
(c) SJF does not have any Convoy Effect
(d) None of the above
58) Consider the processes and Burst times as shown below which follows SJF scheduling
algorithm:
Processes AT BT
P1 0 4
P2 0 2
P3 1 5
P4 1 3
What is the average Response time?
(a) 3.75 ms (b) 3.5 ms

(c) 0.35 ms (d) 1.35 ms
59) Which of the following algorithms gives minimum average Response time?
(a) FCFS (b) SJF

(c) Round Robin (d) Priority
60) When a process is using CPU and if an interrupt occurs, the process will be moved to:
(a) Wait Queue (b) Ready Queue

(c) Job Queue (d) None of the above

61) The main function of dispatcher is:
(a) swapping a process to disk

(b) assigning ready process to the CPU
(c) suspending some of the processes when CPU load is high
(d) bring processes from the disk to main memory
62) In real time Operating System, which of the following is the most suitable scheduling
scheme?
(a) Round Robbin (b) FCFS

(c) Random (d) Priority
63) Round Robin scheduling is more suitable when:
(a) Minimum Context switches are needed.

(b) More interaction is needed by the tasks.
(c) High priority processes needs to be completed first.
(d) None of the above
64) Which is a Non-Preemptive Scheduling algorithm?
(a) Round Robin (b) Priority base

(c) Shortest Job Next (d) Shortest Remaining Time first
65) In Round Robin Scheduling Algorithm if Time Quantum is very small it results in:

(a) Maximum Average Waiting Time (b) Minimum Average Waiting Time
(c) More number of Context Switches (d) None of the above
66) In Round Robin if the Time Quantum is very large then it will behave as:
(a) FCFS (b) SJF

(c) Priority (d) None
67) Which of the following information is not part of Process Control Block?
(1) Process State

(2) Process Page table
(3) List of Open files
(4) Stack Pointer
(a) Only 3 (b) 3 & 4

(c) 2 and 4 (d) None
68) Given n-processes (P1, P2,…..Pn) and bti is the actual burst time of P i and bt1, bt2,…., btn are
the burst times of a processes P 1, P2,…Pn. What is the predicted burst time for process P i using
Simple Average?
n+1
1
(a) Tn+1 = n ∑ bti
i=1
1 n
(b) Tn+1 = + n ∑ bti
n
i=1
n
1
(c) Tn+1 = n ∑ bti
i=1
1
(d) Tn+1 = n
∑ bti
2n
i=1
Solution: Option(c)

69) Consider the actual Burst time of the processes are 2, 5, 3, 9, 6 respectively. What is the
predicted Burst time of the next process using simple average?
(a) 25 (b) 5
(c) 10 (d) 15
70) What is the predicted burst time for process Pi where tn is the actual burst of previous process
and Tn is the predicted burst time of the previous process.
(a) Tn+1 = ∝T n + (1 − ∝) 0≤ ∝ ≤1
tn−1
0≤ ∝ ≤1
(b) Tn+1 = ∝tn + (1 − ∝) T n
(c) Tn+1 = ∝tn + (1 − ∝) T n 0< ∝ <1
(d) N one of the above
71) If 𝛼=0.4 and T1=10. Consider the actual burst times of t1, t2, t3 are 5, 7, 2 respectively. What
is the predicted burst time of t4 using Exponential Average method?
(a) 3.36 (b) 4.3

(c) 5.36 (d) 6.66
72) Consider the processes P1, P2, P3, P4 whose arrival times are 1, 5, 9, 10 and burst times are 4,
3, 5, 2 respectively. If the processes follow FCFS, what is the CPU idle time?
(a) 14/16 (b) 12/16

(c) 1/4 (d) 1/8

73) When two or more processes trying to execute a set of instructions and if the output depends
on the order of execution of the process, this is termed as:
(a) Critical section (b) Race condition

(c) Synchronization (d) None

1.practice Questions and Solutions Set-1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

1.practice Questions and Solutions Set-1

Uploaded by

Copyright:

Available Formats

Ravindrababu Ravula www.ravindrababuravula.

com Ravindrababu Ravula

Process Arrival time Burst time

Process Arrival time Burst time

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time

Process Arrival time Burst time

Process Arrival time Burst time

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time

Process Arrival time Burst time

Process Arrival time Burst time

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time

Process Arrival time Burst time Priority

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time Priority

Process Arrival time Burst time Priority

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time Priority

Process Arrival time Burst time Priority

Process Arrival time Burst time Priority

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time Priority

Process Arrival time Burst time Priority

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time Priority

Process Arrival time Burst time Priority

Process Arrival time Burst time

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time

Process Arrival time Burst time

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time

Process Arrival time Burst time

Process Arrival time Burst time

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time

Process Arrival time Burst time

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time

Process Arrival time Burst time

Process Arrival time Burst time

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time

Solution : Average waiting time:1.5, Average Turn Around time:6.25

Process Arrival time Burst time

Solution : Average Turnaround Time = 6.00, Average Waiting Time = 0.67

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Process Arrival time Burst time

Solution : Average Turnaround Time = 9.33, Average Waiting Time = 2.33

(a) Hardware (b) System calls

Solution: Option (b)

37) If we disable interrupts, it is not possible to

(a) invoke system calls (b) preempt process from CPU

Solution: Option (d)

38) Which is the service not provided by an OS

(a) File system manipulation (b) Memory management

Solution: Option (d)

39) Process control block does not contain

(a) Process ID (b) User identification number

Ravindrababu Ravula www.ravindrababuravula.com Ravindrababu Ravula

Solution: Option (d)