State and explain different services provided by an operating system.
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 11 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
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 Oct INSEM
Q1
15 MarksWhat is System call? Explain its types.
What is Operating System? Describe in detail the functions of OS as a resource manager.
Q2
15 MarksDescribe the components of OS in detail.
Explain Batch OS in detail.
State the function of following shell commands: i) cat ii) mkdir iii) grep iv) cd
Q3
15 MarksExplain SJF (preemptive) scheduling algorithm with suitable example.
Explain the different process states with the help of state diagram.
What is scheduler? Explain its types.
Q4
15 MarksWhat is Process Control Block (PCB)? Explain in detail.
Define thread. Explain multithreaded model.
What is Scheduling? Explain its types.
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6578]-24 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2025 Oct INSEM |
| Watermark | ['CEGP013091', '49.248.216.237 08/11/2025 10:53:39 static-237'] |
2024 Sep INSEM
Q1
15 MarksDiscuss in detail time sharing operating system.
Explain the different issues in operating system design.
Give the different types of operating system in short.
Q2
15 MarksList and explain the different services of operating system.
Explain the system calls.
Give four basic shell commands and explain them.
Q3
15 MarksExplain the concept of Inter Process Communication.
Consider following set of process with their CPU Burst time. Draw Gantt chart FCFS. Calculate average waiting time and average turnaround time. Process Arrival time Burst time P1 0 4 P2 1 3 P3 2 1 P4 3 2 P5 4 5
Differentiate between Process and Threads
Q4
15 MarksDiscuss the FCFS process scheduling algorithms
Draw and Explain process state transition diagram
Define Threads? Explain Threads Life Cycle.
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6359]-524 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2024 Sep INSEM |
| Watermark | ['CEGP013091', '49.248.216.238 11/10/2024 10:39:01 static-238'] |
2023 Oct INSEM
Q1
15 MarksDiscuss different functions of operating system.
Explain in detail Time sharing operating system with diagram.
Define bash shell? Explain it.
Q2
15 MarksExplain in detail batch operating system.
Discuss the system calls.
Give the System Programs in operating system.
Q3
15 MarksExplain the concept of Process Control Block with diagram.
Discuss SJF process scheduling algorithms.
Define Threads? Explain Threads Life Cycle.
Q4
15 MarksDraw and Explain process state transition diagram.
Consider following set of process with their CPU Burst time. Draw Gantt chart FCFS. Calculate average waiting time and average turnaround time. Process Arrival time Burst time P1 0 4 P2 1 3 P3 2 1 P4 3 2 P5 4 5
Differentiate between Process & Threads.
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6186]-524 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2023 Oct INSEM |
| Watermark | ['CEGP013091', '49.248.216.238 13/10/2023 10:42:07 static-238'] |
2022 Oct INSEM
Q1
15 MarksDifferentiate between following types of operating system by defining their essential properties. i) Parallel system ii) Real time system
Explain the basic instruction cycle with appropriate diagram.
Q2
15 MarksExplain user operating system Interface in detail.
What are the various objectives and functions of operating systems.
Q3
15 MarksExplain following scheduling algorithms i) SJF ii) Priority
What is dining philosopher problem? Explain its solution with monitor.
Q4
15 MarksWhat is thread? Explain classical thread model.
Discuss following terms. i) Semaphore ii) Critical Section iii) Monitor iv) Message passing
| Subject Name | Operating Systems |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [5931]-63 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | INSEM |
| Exam Session | 2022 Oct INSEM |
| Watermark | ['CEGP013091', '49.248.216.238 20/01/2023 10:46:09 static-238'] |
2025 May Jun ENDSEM
Q1
18 MarksProvide solution to producer- Consumer process problem using semaphore.
What is deadlock? What are the conditions under which a deadlock situation may arise?
What is banker’s algorithm? Explain it with suitable example.
Q2
18 MarksWhat is Process? Differentiate between Process and Thread?
Write a short note on Pipe, Semaphore, Signal.
With given matrices, determine safe state with the help of banker algorithm. Claim Matrix C Allocation Matrix A Resource Vector R (R1, R2, R3) P1 3 2 2 P1 1 0 0 9 3 6 P2 6 1 3 P2 6 1 2 P3 3 1 4 P3 2 1 1 P4 4 2 2 P4 0 0 2 Available Vector V : R1-0, R2-1, R3-1
Q3
17 MarksWrite a note on (Any two) : i) Demand Paging ii) Segmentation iii) Memory Partitioning
Consider the page reference string 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2 Calculate page fault for FIFO. If the number of page frames : 3
How operating system utilizes swapping techniques in memory management? Explain in detail.
Q4
17 MarksExplain following memory allocation strategies with suitable example. i) Best fit ii) First fit iii) Next fit
What is fragmentation? Explain types of fragmentation with example.
Given memory partition of 100K, 500K, 200K, 300K and 600K (in order). How would each of First fit, Best fit and worst fit algorithm place processes of size 212K, 417K, 112K, 426K (in order)? Which also makes the most efficient use of memory.
Q5
18 MarksList and Explain file types and file access methods.
List methods of allocation of disk space. Explain any of these methods.
What information is present in directories. Explain the structure of directories in detail.
Q6
18 MarksExplain the following concepts i) Disk Access methods ii) Directory structure
Explain the advantages of organizing file directory structure into a tree structure?
List and explain various layers of a file system.
Q7
17 MarksWhat is make utility? Explain it with example. Consider your own make file.
Explain share memory with system calls.
Give overview of Linux operating system. Also explain its goals.
Q8
17 MarksDefine the components of LINUX system with diagram. What is the responsibility of kernel in LINUX operating system?
What are different Process management system calls in Linux. Explain any two with example.
What are the primary goals of conflict-resolution mechanisms used by the Linux kernel for loading kernel modules?
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6402]-45 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2025 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 22/05/2025 09:41:32 static-237'] |
2025 Nov Dec ENDSEM
Q1
17 MarksWhat is deadlock? Explain necessary conditions for deadlock.
Give a semaphore solution for producer-consumer problem.
Short note on Mutual exclusion.
Q2
17 MarksWrite a semaphore solution for readers-writers problem.
Explain different inter-process communication mechanism.
What is deadlock? Write deadlock prevention policies.
Q3
17 MarksExplain: i) Internal fragmentation ii) External fragmentation
Explain dynamic partitioning placement algorithms.
Write a short note on Buddy System.
Q4
17 MarksExplain fixed and dynamic memory partitioning.
Explain the concept of Virtual memory.
Explain paging mechanism.
Q5
18 MarksExplain different file organization techniques.
Explain free space management techniques.
List and Explain directory management techniques.
Q6
18 MarksWrite a short note on Directory Structure.
List and Explain any two file allocation mechanisms.
Write a short note on I/O buffering.
Q7
18 MarksHow Memory management is done in Linux.
Write short note on Linux file system.
Explain Process management in Linux.
Q8
18 MarksExplain Process Scheduling in Linux.
State and explain different Linux inter-process communication mechanism.
Write short note on Kernel Modules.
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6582]-48 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2025 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 27/12/2025 09:37:23 static-237'] |
2024 May Jun ENDSEM
Q1
17 MarksWhat is a deadlock? State and explain the conditions for deadlock to occur.
Write the structure of Producer-Consumer problem in bounded buffer using semaphore. Discuss how critical section requirements are fulfilled?
What is semaphore? Explain the concept of binary semaphore.
Q2
17 MarksState and explain in brief different methods of handling deadlock.
What is Readers-Writers problem? How Reader and Writer processes synchronize?
What is monitor? Explain the concept of monitor with example.
Q3
18 MarksExplain segmentation with suitable diagram.
How sharing and protection is provided in a paging system? Explain with suitable diagram.
Explain with example first-fit, best-fit and worst-fit memory allocation techniques.
Q4
18 MarksExplain paging with suitable diagram.
Write a short note on swapping.
What are the advantages and disadvantages of fixed and dynamic partitioning of memory? When there is a need of compaction?
Q5
17 MarksWhich are different file organization techniques? Describe any one in brief.
What is an I/O buffer? What is its use?
Describe any one disk scheduling policy with an example.
Q6
17 MarksWhat are the file access methods? Explain them in detail.
Describe working of FIFO and C-SCAN algorithms with suitable diagrams.
Write a note on free space management.
Q7
18 MarksHow process and threads are implemented in Linux? Explain.
How process scheduling is performed in Linux?
What are goals of Linux? Also interfaces to linux.
Q8
18 MarksExplain process management system calls in Linux.
Write a short note on kernel structure.
Define the components of LINUX system with diagram. What is the responsibility of kernel in LINUX operating system?
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6261]-48 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2024 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.238 27/05/2024 13:41:29 static-238'] |
2024 Nov Dec ENDSEM
Q1
17 MarksWhat is deadlock? Explain necessary conditions for deadlock.
Give a semaphore solution for producer-consumer problem.
Short note on Mutual exclusion.
Q2
17 MarksWrite a semaphore solution for readers-writers problem.
Explain different inter-process communication mechanism.
What is deadlock? Write deadlock prevention policies.
Q3
17 MarksExplain i) Internal fragmentation ii) External fragmentation
Explain dynamic partitioning placement algorithms.
Write a short note on Buddy System.
Q4
17 MarksExplain fixed and dynamic memory partitioning.
Explain the concept of Virtual memory.
Explain paging mechanism.
Q5
18 MarksExplain different file organization techniques.
Explain free space management techniques.
List and Explain directory management techniques.
Q6
18 MarksWrite a short note on Directory Structure.
List and Explain any two file allocation mechanisms.
Write a short note on I/O buffering.
Q7
18 MarksHow Memory management is done in Linux.
Write short note on Linux file System.
Explain Process management in Linux.
Q8
18 MarksExplain Process Scheduling in Linux.
State and explain different Linux inter-process communication mechanism.
Write short note on Kernel Modules.
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6352]-48 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2024 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.237 09/12/2024 09:58:41 static-237'] |
2023 May Jun ENDSEM
Q1
18 MarksWhat is synchronization? Operating system support and programming language support for synchronization.
What is inter process communication? Explain pipes and shared memory.
What are classical synchronization problems? Explain any one in detail.
Q2
18 MarksWhat is deadlock? Explain its characteristics with example.
What are different methods of handling deadlock? Explain deadlock detection with example.
Consider a system that contains five processes P1, P2, P3, P4, P5 and the three resource types A, B and C. Following are the resources types: A has 10, B has 5 and the resource type C has 7 instances. Determine if the system is safe or not. Process Allocation Max Available A B C A B C A B C P1 0 1 0 7 5 3 3 3 2 P2 2 0 0 3 2 2 P3 3 0 2 9 0 2 P4 2 1 1 2 2 2 P5 0 0 2 4 3 3
Q3
18 MarksExplain the virtual memory system with suitable diagram.
Explain the basic method for implementing paging. Draw the paging model of logical and physical memory.
What is swapping? Does swapping increase the Operating system’s overheads?
Q4
18 MarksExplain the differences between: i) Logical and physical address space ii) Paging and segmentation
What is internal fragmentation and external fragmentation? How are they reduced?
What are advantages of partitioning the memory? What are different ways memory partitioning?
Q5
17 MarksList and explain file types and file access methods.
What are different disk scheduling policies? Explain SCAN and CSCAN with example.
Explain how free space management is done by Operating Sytem?
Q6
17 MarksWhat are different disk scheduling policies? Explain LIFO and SCAN with example.
Given memory partition of 100K, 500K, 200K, 300K and 600K(in order). How would each of First fit, best fit and worst fit algorithm place processes of size 212K, 417K, 112K, 426K (in order)? Which also makes the most efficient use of memory.
What is Directory? Explain directory implementation and allocation methods.
Q7
17 MarksWhat are goals of Linux? Also interfaces to linux.
What is kernel? Explain structure of kernel.
Explain various process management system calls in Linux with example.
Q8
17 MarksDefine the components of LINUX system with diagram. What is the responsibility of kernel in LINUX operating system?
What are different Process management system calls in Linux. Explain exec() and brk() in detail.
Explain implementation of process and threads in Linux.
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6002]-222 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2023 May Jun ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.238 20/06/2023 10:40:01 static-238'] |
2023 Nov Dec ENDSEM
Q1
18 MarksWhat is Readers/Writers problem? Explain with suitable example.
What is deadlock detection and recovery? Explain two options of deadlock recovery.
What do you mean by pipe? Explain anonymous and named/FIFO pipe.
Q2
18 MarksWhat is Producer-Consumer Problem? How to solve it using Semaphores and Mutex.
Write a short note on (Any Two) i) Mutual Exclusion ii) Inter-process Communication iii) Semaphores
Q3
17 MarksList the page replacement algorithms and explain LRU in detail.
Explain Buddy system memory allocation with suitable example.
Write a short note on Segmentation.
Q4
17 MarksExplain the concept of Virtual Memory.
Differentiate between paging and segmentation.
Explain Fixed Partitioning with suitable example.
Q5
18 MarksWhat is file system? Explain File system implementation in detail.
Define following term with respect to disk access i) Seek time ii) Rotational Latency iii) Data transfer time
Differentiate SCAN and C-SCAN disk scheduling policy.
Q6
18 MarksExplain Directory structure with its types.
Write a short note with respect to disk scheduling policies (Any Two) i) FIFO ii) LIFO iii) STTF
Q7
17 MarksExplain in detail the memory management in LINUX system.
Explain system calls in Linux.
Differentiate between Linux and Unix
Q8
17 MarksExplain Linux file system.
Explain Linux Shell?
Explain Linux booting process.
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6179]-248 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2023 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.238 05/01/2024 09:34:07 static-238'] |
2022 Nov Dec ENDSEM
Q1
18 MarksWhat is deadlock detection and recovery? Explain two options of deadlock recovery.
What is the producer consumer problem? How to solve it using semaphore and Mutex?
What are different types of classical synchronization problems? Explain any one in detail.
Q2
18 MarksWhat is Inter Process Communication? Why it is important for operating system.
Write short note on critical section, Monitors and mutex.
What do you mean by pipe? Explain anonymous and named/FIFO pipe.
Q3
17 MarksExplain the following term : i) Compaction ii) Belady's anomaly iii) Thrashing
Why is the principle of locality crucial to use of virtual memory? Explain with example.
Reference String 1 2 3 2 1 5 2 1 6 2 5 6 3 1 3 6 1 2 4 3. Execute LRU and OPR on above string. Consider page frame of 3 pages Write page hit and page faults if any.
Q4
17 MarksWrite and explain algorithms for : i) Allocating region ii) Freeing region
Differentiate between : i) Internal and external fragmentation ii) Fixed and variable size partitioning
Explain in brief what is paging and segmentation. How logical physical Address Translation is done in both.
Q5
18 MarksWhat is file system? Explain File system implementation in detail.
Explain following term with respect to directory structure i) Two level directory structure (with diagram) ii) Tree structured Directories (with diagram)
Define following term with respect to disk access i) Seek time ii) Rotational Latency iii) Data transfer time
Q6
18 MarksExplain directory structure with types its types. Also discuss directory implementation in details.
What is free space management (FSM)? Explain how bit vector and linked list performs on FSM.
What is the advantage of the double buffering scheme over single buffering?
Q7
17 MarksExplain scheduling in i) Linux Operating Systems ii) UNIX free BSD OS
Explain grep utility and its variations with examples.
Explain system calls exec() and brk().
Q8
17 MarksWhat are the requirements for Linux system administrator? Define the design principles of LINUX systems.
Explain different types of hypervisors.
Explain in detail the memory management in LINUX system.
| Subject Name | Operating Systems |
|---|---|
| Semester | III |
| Pattern Year | 2019 |
| Subject Code | 217521 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [5925]-326 |
| Academic Year | S.E. |
| Branch Name | Artificial Intelligence and Data Science |
| Exam Type | ENDSEM |
| Exam Session | 2022 Nov Dec ENDSEM |
| Watermark | ['CEGP013091', '49.248.216.238 01/02/2023 13:19:55 static-238'] |