My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Operating System - Computer Science & Information Technology Previous Year Questions

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

28Papers
18Years
131Questions
1Topics

Operating System question pattern

Every graph below is calculated only from this selection.

Questions by year

Compare question counts across years.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 84 64.1%
Easy 40 30.5%
Hard 7 5.3%

Question type distribution

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

MCQ 70 53.4%
Numerical Answer Type (NAT) 43 32.8%
MSQ 18 13.7%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
131 Qs

Most asked topics

Top topics across the included previous year papers.

Operating System
131 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Processes, Threads and Synchronization
46 Qs
Memory Management and File Systems
43 Qs
Deadlocks and Scheduling
42 Qs

Paper coverage

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

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

Browse by subtopics

Open a focused page built from the same verified paper data.

Included previous year papers

Newest papers appear first. Search these papers or sort by year and name.

Paper nameYearPDFAttempt
Computer Science and Information Technology (CS) 20262026
4 questions in this view
2026
Computer Science and Information Technology (CS) 20262026
4 questions in this view
2026
Computer Science & Information Technology (CS) 2025 [Session 1]2025
5 questions in this view
2025
Computer Science & Information Technology (CS) 2025 [Session 2]2025
4 questions in this view
2025
Computer Science & Information Technology (CS) 2024 [Session 1]2024
5 questions in this view
2024
Computer Science & Information Technology (CS) 2024 [Session 2]2024
5 questions in this view
2024
Computer Science & Information Technology (CS) 2023 [Session 2]2023
6 questions in this view
2023
Computer Science & Information Technology (CS) 2022 [Session 2]2022
6 questions in this view
2022
Computer Science & Information Technology (CS) 2021 [Session 1]2021
5 questions in this view
2021
Computer Science & Information Technology (CS) 2021 [Session 2]2021
4 questions in this view
2021
Computer Science & Information Technology (CS) 2020 [Session 2]2020
6 questions in this view
2020
Computer Science & Information Technology (CS) 2019 [Session 2]2019
5 questions in this view
2019
Computer Science & Information Technology (CS) 2018 [Session 2]2018
5 questions in this view
2018
Computer Science & Information Technology (CS) 2017 [Session 2]2017
4 questions in this view
2017
Computer Science & Information Technology (CS) 2016 [Session 1]2016
4 questions in this view
2016
Computer Science & Information Technology (CS) 2016 [Session 2]2016
4 questions in this view
2016
Computer Science & Information Technology (CS) 2014 [Session 1]2014
5 questions in this view
2014
Computer Science & Information Technology (CS) 2014 [Session 2]2014
3 questions in this view
2014
Computer Science & Information Technology (CS) 2014 [Session 3]2014
4 questions in this view
2014
Computer Science & Information Technology (CS) 2013 [Session 1]2013
4 questions in this view
2013
Computer Science & Information Technology (CS) 2013 [Session 2]2013
1 questions in this view
2013
Computer Science & Information Technology (CS) 2013 [Session 3]2013
4 questions in this view
2013
Computer Science & Information Technology (CS) 2013 [Session 4]2013
5 questions in this view
2013
Computer Science & Information Technology (CS) 20112011
4 questions in this view
2011
Computer Science & Information Technology (CS) 20102010
5 questions in this view
2010
Computer Science & Information Technology (CS) 20092009
6 questions in this view
2009
Computer Science & Information Technology (CS) 20082008
6 questions in this view
2008
Computer Science & Information Technology (CS) 20072007
8 questions in this view
2007

Sample previous year questions

A varied preview from the papers represented in this selection, with every available option.

1
2007 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2007

Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.

Group 1Group 2
P. Gang Scheduling1. Guaranteed Scheduling
Q. Rate Monotonic Scheduling2. Real-time Scheduling
R. Fair Share Scheduling3. Thread Scheduling
Open complete paper
2
2008 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2008

The data blocks of a very large file in the Unix file system are allocated using

Open complete paper
3
2009 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2009
In which one of the following page replacement policies, Belady’s anomaly may occur ?
Open complete paper
4
2010 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2010
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned.
Method used by P1Method used by P2
while (S1 == S2);
Critical Section
S1 = S2;
while (S1 != S2);
Critical Section
S2 = not(S1);

Which one of the following statements describes the properties achieved?
Open complete paper
5
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
6
2013 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2013 [Session 2]
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?
Open complete paper