What is synchronization? Operating system support and programming language support for synchronization.
Please rotate your device horizontally for split view
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.
We offer 7 question papers for Operating Systems, covering various exam patterns and years. All papers are in PDF format for easy viewing and download.
Prepare for mid-term evaluations with Operating Systems INSEM papers, aligned with the SPPU exam pattern and syllabus.
Access Operating Systems ENDSEM papers covering the entire syllabus, essential for final exam preparation.
Our question-paper viewer enables you to:
SPPU Question Papers Hub is focused entirely on SPPU previous year papers, with cleaner discovery by branch, semester, and subject.
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.
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.
Download all INSEM question papers as ZIP
Download all ENDSEM question papers as ZIP
Download all question papers (INSEM + ENDSEM) as ZIP
What 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.
What 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
Explain 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?
Explain 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?
List 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?
What 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.
What 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.
Define 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'] |
What 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.
State 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.
Explain 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.
Explain 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?
Which 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.
What 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.
How process and threads are implemented in Linux? Explain.
How process scheduling is performed in Linux?
What are goals of Linux? Also interfaces to linux.
Explain 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'] |
What 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.
What 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.
Explain 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.
Write 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.
What 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
Explain 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?
Explain 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().
What 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'] |
What 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.
What 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
List the page replacement algorithms and explain LRU in detail.
Explain Buddy system memory allocation with suitable example.
Write a short note on Segmentation.
Explain the concept of Virtual Memory.
Differentiate between paging and segmentation.
Explain Fixed Partitioning with suitable example.
What 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.
Explain Directory structure with its types.
Write a short note with respect to disk scheduling policies (Any Two) i) FIFO ii) LIFO iii) STTF
Explain in detail the memory management in LINUX system.
Explain system calls in Linux.
Differentiate between Linux and Unix
Explain 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'] |
Differentiate 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.
Explain user operating system Interface in detail.
What are the various objectives and functions of operating systems.
Explain following scheduling algorithms i) SJF ii) Priority
What is dining philosopher problem? Explain its solution with monitor.
What 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'] |
Discuss different functions of operating system.
Explain in detail Time sharing operating system with diagram.
Define bash shell? Explain it.
Explain in detail batch operating system.
Discuss the system calls.
Give the System Programs in operating system.
Explain the concept of Process Control Block with diagram.
Discuss SJF process scheduling algorithms.
Define Threads? Explain Threads Life Cycle.
Draw 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'] |
Discuss in detail time sharing operating system.
Explain the different issues in operating system design.
Give the different types of operating system in short.
List and explain the different services of operating system.
Explain the system calls.
Give four basic shell commands and explain them.
Explain 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
Discuss 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'] |
Select a question to generate an answer