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.

23Papers
13Years
102Questions
1Topics

Operating System question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Operating System. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 66 64.7%
Easy 30 29.4%
Hard 6 5.9%

Question type distribution

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

MCQ 43 42.2%
Numerical Answer Type (NAT) 43 42.2%
MSQ 16 15.7%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
102 Qs

Most asked topics

Top topics across the included previous year papers.

Operating System
102 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Processes, Threads and Synchronization
35 Qs
Deadlocks and Scheduling
34 Qs
Memory Management and File Systems
33 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

Browse by subtopics

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

Processes, Threads and Synchronization

Explore previous-paper coverage, trends and focused practice for Processes, Threads and Synchronization.

35 questions21 papers13 years

Deadlocks and Scheduling

Explore previous-paper coverage, trends and focused practice for Deadlocks and Scheduling.

34 questions21 papers13 years

Memory Management and File Systems

Explore previous-paper coverage, trends and focused practice for Memory Management and File Systems.

33 questions20 papers13 years

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) 202620264View paper
Computer Science and Information Technology (CS) 202620264View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20255View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20254View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20245View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20245View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20236View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20226View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20215View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20214View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20206View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20195View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20185View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20174View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20164View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20164View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20145View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20144View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20134View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20134View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20135View paper

Sample previous year questions

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

1
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
2
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
3
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
4
2013 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2013 [Session 4]
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
5
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
6
2014 · Computer Science & Information Technology · Operating System · Memory Management and File Systems
Computer Science & Information Technology (CS) 2014 [Session 2]
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a \(100 \times 10^6\) bytes disk on which the file system is stored and data block size is \(10^3\) bytes, the maximum size of a file that can be stored on this disk in units of \(10^6\) bytes is ____________.
Open complete paper