My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Deadlocks and Scheduling - Operating System - Computer Science & Information Technology Previous Year Questions

Practice Deadlocks and Scheduling - Operating System - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

25Papers
17Years
41Questions
1Topics

Deadlocks and Scheduling question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Deadlocks and Scheduling. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 27 65.9%
Easy 12 29.3%
Hard 2 4.9%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 22 53.7%
Numerical Answer Type (NAT) 13 31.7%
MSQ 6 14.6%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
41 Qs

Most asked topics

Top topics across the included previous year papers.

Operating System
41 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Deadlocks and Scheduling
41 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
3 Qs
Computer Science and Information Technology (CS) 2026
1 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
1 Qs
Computer Science & Information Technology (CS) 2010
2 Qs
Computer Science & Information Technology (CS) 2009
2 Qs
Computer Science & Information Technology (CS) 2008
1 Qs
Computer Science & Information Technology (CS) 2007
2 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620263View paper
Computer Science and Information Technology (CS) 202620261View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20251View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20252View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20241View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20231View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20222View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20211View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20212View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20202View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20192View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20183View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20172View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20161View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20161View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20141View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20142View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20131View paper
Computer Science & Information Technology (CS) 201020102View paper
Computer Science & Information Technology (CS) 200920092View paper
Computer Science & Information Technology (CS) 200820081View paper
Computer Science & Information Technology (CS) 200720072View paper

All Deadlocks and Scheduling previous year questions

Practice every matching question in batches of 20, with every available option.

1
2007 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2007

An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes:

ProcessExecution timeArrival time
P1200
P22515
P31030
P41545
What is the total waiting time for process P2?
Open complete paper
2
2007 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2007
A single processor system has three resource types X, Y, and Z, which are shared by three processes. There are 5 units of each resource type. Consider the following scenario, where the column alloc denotes the number of units of each resource type allocated to each process, and the column request denotes the number of units of each resource type requested by a process in order to complete execution. Which of these processes will finish LAST?
allocrequest
XYZXYZ
P0121103
P1201012
P2221120
Open complete paper
3
2008 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2008

Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?

Open complete paper
4
2009 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2009
Consider a system with 4 types of resources R1 (3 units), R2 (2 units), R3 (3 units), R4 (2 units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be completely satisfied. Three processes P1, P2, P3 request the resources as follows if executed independently.
Process P1:Process P2:Process P3:
t=0: requests 2 units of R2
t=1: requests 1 unit of R3
t=3: requests 2 units of R1
t=5: releases 1 unit of R2 and 1 unit of R1
t=7: releases 1 unit of R3
t=8: requests 2 units of R4
t=10: Finishes		t=0: requests 2 units of R3
t=2: requests 1 unit of R4
t=4: requests 1 unit of R1
t=6: releases 1 unit of R3
t=8: Finishes		t=0: requests 1 unit of R4
t=2: requests 2 units of R1
t=5: releases 2 units of R1
t=7: requests 1 unit of R2
t=8: requests 1 unit of R3
t=9: Finishes
Which one of the following statements is TRUE if all three processes run concurrently starting at time t = 0 ?
Open complete paper
5
2009 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2009
Consider a disk system with 100 cylinders. The requests to access the cylinders occur in following sequence :
4, 34, 10, 7, 19, 73, 2, 15, 6, 20,
Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first policy is used ?
Open complete paper
6
2010 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2010
Which of the following statements are true?
I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
Open complete paper
7
2010 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2010
A system has \(n\) resources \(R_0, R_1, ..., R_{n-1}\), and \(k\) processes \(P_0, ..., P_{k-1}\). The implementation of the resource request logic of each process \(P_i\) is as follows:
if (i % 2 == 0) {
if (i < n) request \(R_i\);
if (i+2 < n) request \(R_{i+2}\);
}
else {
if (i < n) request \(R_{n-i}\);
if (i+2 < n) request \(R_{n-i-2}\);
}
In which one of the following situations is a deadlock possible?
Open complete paper
8
2013 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2013 [Session 1]
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?
Open complete paper
9
2013 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2013 [Session 3]
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?
Open complete paper
10
2014 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2014 [Session 1]
Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder 100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135 and 145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request for cylinder 90 is serviced after servicing ______ number of requests.
Open complete paper
11
2014 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2014 [Session 1]
An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution.
AllocationMax
XYZXYZ
P0001843
P1320620
P2211333

There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state:
REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z
REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z
Which one of the following is TRUE?
Open complete paper
12
2014 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2014 [Session 1]
Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.
Process NameArrival TimeExecution Time
A06
B32
C54
D76
E103

Using the shortest remaining time first scheduling algorithm, the average process turnaround time (in msec) is ____________________.
Open complete paper
13
2014 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2014 [Session 2]
Three processes A, B and C each execute a loop of 100 iterations. In each iteration of the loop, a process performs a single computation that requires tc CPU milliseconds and then initiates a single I/O operation that lasts for tio milliseconds. It is assumed that the computer where the processes execute has sufficient number of I/O devices and the OS of the computer assigns different I/O devices to each process. Also, the scheduling overhead of the OS is negligible. The processes have the following characteristics:
Process idtctio
A100 ms500 ms
B350 ms500 ms
C200 ms500 ms
The processes A, B, and C are started at times 0, 5 and 10 milliseconds respectively, in a pure time sharing system (round robin scheduling) that uses a time slice of 50 milliseconds. The time in milliseconds at which process C would complete its first I/O operation is __________
Open complete paper
14
2014 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2014 [Session 3]
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is ______.
Open complete paper
15
2014 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2014 [Session 3]
An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds).
ProcessArrival TimeBurst Time
P1012
P224
P336
P485

The average waiting time (in milliseconds) of the processes is ______.

Question diagram

Open complete paper
16
2016 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Open complete paper
17
2017 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2017 [Session 2]
A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below.
ProcessCurrent AllocationMaximum Requirement
P137
P216
P335

Which of the following best describes current state of the system?

Question diagram

Open complete paper
18
2017 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2017 [Session 2]

Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time.

ProcessArrival TimeBurst TimePriority
P10112
P25280
P31223
P42101
P59164

The average waiting time (in milliseconds) of all the processes using preemptive priority scheduling algorithm is __________.

Open complete paper
19
2018 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2018 [Session 2]
Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of \(K\) instances. Resource instances can be requested and released only one at a time. The largest value of \(K\) that will always avoid deadlock is _____.
Open complete paper
20
2018 · Computer Science & Information Technology · Operating System · Deadlocks and Scheduling
Computer Science & Information Technology (CS) 2018 [Session 2]
In a system, there are three types of resources: \(E, F\) and \(G\). Four processes \(P_0, P_1, P_2\) and \(P_3\) execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[\(P_2, F\)] is the maximum number of instances of \(F\) that \(P_2\) would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation.
Consider a state of the system with the Allocation matrix as shown below, and in which 3 instances of \(E\) and 3 instances of \(F\) are the only resources available.
AllocationEFG
\(P_0\)101
\(P_1\)112
\(P_2\)103
\(P_3\)200

MaxEFG
\(P_0\)431
\(P_1\)214
\(P_2\)133
\(P_3\)541

From the perspective of deadlock avoidance, which one of the following is true?
Open complete paper

Showing 20 of 39 questions