What is an operating system? Discuss developments leading to Modern Operating Systems.
Operating Systems Question Papers - SPPU University
Access and download Operating Systems question papers from Savitribai Phule Pune University (SPPU). Our collection includes INSEM (Internal Semester) and ENDSEM (End Semester) exam papers.
Available Operating Systems Papers
We offer 4 question papers for Operating Systems, covering various exam patterns and years. All papers are in PDF format for easy viewing and download.
INSEM Papers for Operating Systems
Prepare for mid-term evaluations with Operating Systems INSEM papers, aligned with the SPPU exam pattern and syllabus.
ENDSEM Papers for Operating Systems
Access Operating Systems ENDSEM papers covering the entire syllabus, essential for final exam preparation.
Online PDF Viewer Features
Our question-paper viewer enables you to:
- View papers in single or split-screen mode.
- Compare multiple papers simultaneously.
- Use fullscreen mode for better readability.
- Filter by exam type (INSEM/ENDSEM).
- Download papers for offline study.
About SPPU Question Papers Hub
SPPU Question Papers Hub is focused entirely on SPPU previous year papers, with cleaner discovery by branch, semester, and subject.
Study Materials for Operating Systems
Operating Systems is a key subject in the SPPU curriculum. Our question paper collection helps students understand exam patterns, practice effectively, and improve academic performance.
Relevant Keywords & Topics
Explore Operating Systems resources including SPPU question papers from Savitribai Phule Pune University. Find INSEM and ENDSEM papers for effective examination preparation. Our platform offers academic resources, a PDF viewer for online study, university question papers, and materials for semester examinations.
Operating Systems
Single
Single
Split (2)
Split (3)
Grid (4)
Download Operating Systems Papers
INSEM Papers
Download all INSEM question papers as ZIP
ENDSEM Papers
Download all ENDSEM question papers as ZIP
All Papers
Download all question papers (INSEM + ENDSEM) as ZIP
Operating Systems Questions
Pre-rendered question cards from available structured metadata.
2025 May Jun ENDSEM
2026 Mar INSEM
2025 Mar INSEM
2025 May Jun ENDSEM
2025 Nov Dec ENDSEM
INSEM
2026 Mar INSEM
10 Questions
Q1
15 Marks
Q1
·
b
·
5 Marks
Explain the significance of the following shell commands: echo, cut, touch.
Q1
·
c
·
5 Marks
Describe the evolution of the Operating System.
Q2
15 Marks
Q2
·
a
·
5 Marks
Describe with the help of a neat diagram the concept of Time-shared Systems.
Q2
·
b
·
5 Marks
Write a shell script that calculates the sum of integers from 1 to N.
Q2
·
c
·
5 Marks
What is a virtual machine? Explain the concept of virtualization.
Q3
15 Marks
Q3
·
a
·
7 Marks
With the help of a neat, explain in detail process state transition diagram with 5 states.
Q3
·
b
·
8 Marks
Consider the Set of Processes with Arrival Time, Burst Time & Priority. Process Arrival Time Burst Time P1 2 2 P2 0 7 P3 6 3 P4 9 8 Find Average Turnaround Time & Average Waiting Time for SJF (Preemptive) & Round Robin (Time Quantum = 2) scheduling algorithms with the help of Gantt chart
Q4
15 Marks
Q4
·
a
·
7 Marks
Discuss Process Creation. How new task assigned is the child process? Determine the number of child processes if the parent process executes 4 consecutive forks () commands.
Q4
·
b
·
8 Marks
Discuss with the help of neat diagrams different thread models.
| Subject Name | Operating Systems |
|---|---|
| Semester | IV |
| Pattern Year | 2019 |
| Subject Code | 218552 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | Apr-26/SE/Insem-281 |
| Academic Year | S.E. |
| Branch Name | AIML |
| Exam Type | INSEM |
| Exam Session | 2026 Mar INSEM |
| Watermark | ['CEGP013091', '152.58.30.154 10/03/2026 14:03:51'] |
INSEM
2025 Mar INSEM
10 Questions
Q1
15 Marks
Q1
·
a
·
5 Marks
Describe the differences between a monolithic kernel and a microkernel.
Q1
·
b
·
5 Marks
What is an operating system? List and explain services provided by the operating system.
Q1
·
c
·
5 Marks
Give the significance of following shell commands with an example: Is, uniq, tail, touch, grep.
Q2
15 Marks
Q2
·
a
·
5 Marks
What are the OS Design Considerations for multiprocessor and multicore architecture?
Q2
·
b
·
5 Marks
Describe with the help of a neat diagram the concept of simple batch systems.
Q2
·
c
·
5 Marks
Write a function in a shell script that calculates the factorial of a given number.
Q3
15 Marks
Q3
·
a
·
7 Marks
What do you mean by threads? Explain the benefits of threads.
Q3
·
b
·
8 Marks
With the help of neat, explain in detail process state transition diagram with two suspend states.
Q4
15 Marks
Q4
·
a
·
7 Marks
Discuss with the help of neat diagram circumstances under which CPU-scheduling decisions may take place.
Q4
·
b
·
8 Marks
Consider the Set of Processes with Arrival Time, Burst Time & Priority. Process Arrival Time, Burst Time, Priority. P1, 2, 4, 3. P2, 4, 3, 2. P3, 6, 2, 5. P4, 8, 8, 1. P5, 0, 5, 4. Find Average Turnaround Time & Average Waiting Time for Priority (Preemptive) & SJF (Non-Preemptive) scheduling algorithms with the help of Gantt chart.
| Subject Name | Operating Systems |
|---|---|
| Semester | IV |
| Pattern Year | 2019 |
| Subject Code | 218552 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6409]-241 |
| Academic Year | S.E. |
| Branch Name | AI & ML |
| Exam Type | INSEM |
| Exam Session | 2025 Mar INSEM |
| Watermark | ['CEGP013091', '49.248.216.237 11/03/2025 14:29:39 static-237'] |
ENDSEM
2025 May Jun ENDSEM
18 Questions
Q1
17 Marks
Q1
·
a
·
8 Marks
Define with example Mutual exclusion, race condition, Semaphore, and Deadlock.
Q1
·
b
·
9 Marks
How is the TestandSet instruction used to solve the critical section problem? Write and explain the pseudocode for TestandSet instruction implementation.
Q2
17 Marks
Q2
·
a
·
8 Marks
Explain the wait-for graph method for deadlock detection along with an example.
Q2
·
b
·
9 Marks
For the given snapshot of the system: Allocation Max Available P1 0 1 1 0 5 4 4 4 1 2 4 3 P2 2 0 0 1 2 1 3 3 P3 1 1 3 2 8 5 4 4 P4 2 1 2 2 6 5 4 5 P5 3 1 0 1 6 2 2 3 Determine: i) Need Matrix ii) Current snapshot is safe of unsafe. iii) Whether following requests can be granted or not for Process P3 : 1 1 0 1
Q3
18 Marks
Q3
·
a
·
9 Marks
Consider a logical address space of 128 pages of 512 Bytes each mapped onto a physical memory of 32 frames of 512 Bytes. i) How many bits are in the physical address? ii) How many bits are in the logical address? iii) How many bits are required to determine the frame number in the physical address? iv) How many bits are required to determine the page number in logical address?
Q3
·
b
·
9 Marks
With the help of neat diagrams (Bar diagram and Tree), Write a short note on the Buddy system.
Q4
18 Marks
Q4
·
a
·
9 Marks
Consider the page reference string with 3 frames. 1, 2, 3, 4, 5, 4, 5, 3, 6, 7, 8, 9, 5, 4, 7, 8, 9, 5, 4, 2. Calculate the number of page faults for the following page replacement algorithm. i) FIFO ii) OPTIMAL iii) LRU
Q4
·
b
·
9 Marks
For the system where memory cycle time is 200 nanoseconds, Translation Look-aside Buffer access time is 20 nanoseconds, Determine the Effective Access Time when i) Hit ratio is 99% ii) Hit ratio is 95% Also justify if the value of hit ratio should be smaller or larger.
Q5
18 Marks
Q5
·
a
·
12 Marks
A disk drive has 200 tracks, numbered 0-199. The drive is currently serving the request at track no 53. The queue of pending requests in FIFO order is 98, 183, 37, 122, 14, 124, 65, 67. Starting from the current head position what is the total distance that disk arm moves to satisfy all the pending requests for the following disk scheduling algorithms. Assume that the head is moving in the increasing order of track number for C-SCAN and LOOK. i) FCFS ii) C-SCAN iii) LOOK iv) SSTF
Q5
·
b
·
6 Marks
Explain with diagrams different Record Blocking techniques.
Q6
18 Marks
Q6
·
a
·
9 Marks
Explain with the help of neat diagrams different secondary storage management methods.
Q6
·
b
·
9 Marks
List and explain (any 3) directory structure organization.
Q7
17 Marks
Q7
·
a
·
6 Marks
Explain ORIGIN, EQU, and LTROG with an example.
Q7
·
b
·
6 Marks
Explain the data structures required for TWO PASS Assembler in detail.
Q7
·
c
·
5 Marks
Differentiate between literal and immediate operand.
Q8
17 Marks
Q8
·
a
·
6 Marks
What are the types of loaders? Discuss 4 different functions of the loader.
Q8
·
b
·
6 Marks
Using a suitable diagram, explain the ‘Compile and Go’ Loader scheme with its advantages and disadvantages.
Q8
·
c
·
5 Marks
Explain any two phases of the compiler with a suitable diagram.
| Subject Name | Operating Systems |
|---|---|
| Semester | IV |
| Pattern Year | 2019 |
| Subject Code | 218552 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6402]-69 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Machine Learning |
| Exam Type | ENDSEM |
| Exam Session | 2025 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 27/05/2025 09:40:09 static-237'] |
ENDSEM
2025 Nov Dec ENDSEM
17 Questions
Q1
18 Marks
Q1
·
a
·
9 Marks
Describe in brief the different IPC mechanisms.
Q1
·
b
·
9 Marks
What is deadlock? Explain the necessary and sufficient conditions for the occurrence of a deadlock.
Q2
18 Marks
Q2
·
a
·
9 Marks
Explain the following with example i) Mutual Exclusion ii) Synchronization iii) Race condition.
Q2
·
b
·
9 Marks
What is Critical Section Problem? Explain readers-writers problem.
Q3
17 Marks
Q3
·
a
·
9 Marks
What is page Fault? For the given reference string with 3-page frame available, determine the number of page faults for FIFO and LRU algorithms : 3, 5, 3, 7, 2, 1, 5, 4, 6, 7, 4, 1, 2.
Q3
·
b
·
8 Marks
Explain Demand paging with the help of neat diagram.
Q4
17 Marks
Q4
·
a
·
8 Marks
What is segmentation? How address Translation is performed in segmentation system?
Q4
·
b
·
9 Marks
Explain Buddy System with the help of neat diagram and example.
Q5
18 Marks
Q5
·
a
·
9 Marks
Describe three methods of record blocking with the help of neat diagrams.
Q5
·
b
·
9 Marks
Explain the different functions of a file management system.
Q6
18 Marks
Q6
·
a
·
12 Marks
Assume a disk with 200 tracks and the disk request queue has random Requests in it as follows : 98,183,37,122,14,124,65,67. Find the no of tracks traversed and average seek length if i) FCFS ii) SSTF iii) SCAN is used and initially head is at track no 53.
Q6
·
b
·
6 Marks
What is spooling? Explain with suitable diagrams.
Q7
17 Marks
Q7
·
a
·
6 Marks
Explain the data structures required for two PASS Assembler in detail.
Q7
·
b
·
6 Marks
What is Macro? Explain macro call and macro expansion with suitable example.
Q7
·
c
·
5 Marks
Discuss with example what is forward reference problem.
Q8
17 Marks
Q8
·
a
·
9 Marks
What is Loader? What are the basic functions of loaders?
Q8
·
b
·
8 Marks
What is system software? Explain any four system software in brief?
| Subject Name | Operating Systems |
|---|---|
| Semester | IV |
| Pattern Year | 2019 |
| Subject Code | 218552 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6582]-64 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence & Machine Learning Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2025 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 26/11/2025 09:45:53 static-237'] |
Loading PDFs...
INSEM
INSEM
ENDSEM
Select Paper