Explain Differences between static link library and dynamic link library.
Please rotate your device horizontally for split view
Access and download Systems Programming And Operating System question papers from Savitribai Phule Pune University (SPPU). Our collection includes INSEM (Internal Semester) and ENDSEM (End Semester) exam papers.
We offer 11 question papers for Systems Programming And Operating System, covering various exam patterns and years. All papers are in PDF format for easy viewing and download.
Prepare for mid-term evaluations with Systems Programming And Operating System INSEM papers, aligned with the SPPU exam pattern and syllabus.
Access Systems Programming And Operating System 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.
Systems Programming And Operating System is a key subject in the SPPU curriculum. Our question paper collection helps students understand exam patterns, practice effectively, and improve academic performance.
Explore Systems Programming And Operating System 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
Explain Differences between static link library and dynamic link library.
What are the different types of Loaders? Explain compile and Go loader in detail.
List and explain different loader schemes in detail.
Explain Design of Direct linking loaders and explain required data structures.
Compare Compilers and Interpreters.
What is LEX? Explain working of LEX with suitable diagram.
Define token, pattern, lexemes & lexical error.
What is a compiler? Explain any two phases of compiler with suitable diagram.
What is the need of Process synchronization? Explain Semaphore in detail.
What is Operating System? Explain various operating system services in detail.
Explain preemptive and Non preemptive scheduling in detail.
Explain any two scheduling algorithm with suitable example.
What is virtual memory management? Explain address translation in paging system.
Write proper examples and explain memory allocation strategies first fit, best fit and worst fit. Also explain their advantages and disadvantages.
Explain any two page replacement strategies in detail.
What is TLB? Explain the paging system with the use of TLB? What are the advantages of TLB?
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [5870]-1127 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2022 May Jun Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 18/07/2022 08:59:13 static-238'] |
Explain “General loading scheme (using suitable diagram)” with advantages and disadvantages?
Give complete design of Direct Linking Loader?
Give complete design of Absolute Loader with suitable example?
What is the need of DLL? Differentiate between Dynamic and static linking?
Explain the following types of Schedulers. i) Short Term ii) Long Term iii) Medium Term
Explain seven state process model with diagram? Also explain difference between Five state process model & Seven state process model?
Draw Gantt chart and calculate Avg. turnaround time, Avg. waiting time for the following process using SJF non preemptive and round robin with time quantum 0.5 Unit Process | Burst Time | Arrival Time P1 | 2 | 10 P2 | 1 | 10 P3 | 1 | 11 P4 | 1 | 12
What is mean by Threads, Explain Thread lifecycle with diagram in detail?
Write a short note on following with example? i) Semaphore ii) Monitor iii) Mutex
Explain Deadlock prevention, deadlock avoidance, deadlock detection, deadlock recovery with example?
Explain producer Consumer problem & Dining Philosopher problem with solution?
What is deadlock? State and explain the conditions for deadlock, Explain them with example?
Consider page sequence 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2 and discuss working of following page replacement policies Also count page faults. (use no. of Frames = 3) i) FIFO ii) LRU
Discuss fixed Partitioning and Dynamic Partitioning in detail.
Write a short note on following with diagram i) VM with Paging ii) VM with Segmentation
Explain Page Table structure and Inverted page Table?
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6003]-348 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2023 May Jun Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 10/06/2023 10:28:19 static-238'] |
Explain Differences between static link library and dynamic link library.
What are the different types of Loaders ? Explain compile and Go loader in detail.
What is absolute loader? Explain design of absolute loader with suitable example and flowcharts.
Explain Design of Direct linking loaders.
Compare Compilers and Interpreters.
What is YAAC? Explain working of YAAC with suitable diagram.
Define token, pattern, lexemes & lexical error.
What is a compiler? Explain any two phases of compiler with suitable diagram.
Explain Preemptive and Non preemptive scheduling in detail.
What is Operating System ?Explain various operating system services in detail.
What is Thread? Explain Thread Lifecycle in detail.
Explain any two scheduling algorithm with suitable example.
Explain Paging and segmentation with suitable example in detail.
Explain following placement strategies: First Fit, Best Fit, Next Fit and Worst Fit.
Explain any two page replacement algorithms in detail.
Define and Explain Virtual Memory, Translation Lookaside buffer, Thrashing
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6262]-37 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2024 May Jun Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 22/05/2024 09:40:00 static-238'] |
Explain “General loading scheme (using suitable diagram)” with advantages and disadvantages?
What is the need of DLL? Differentiate between Dynamic and static linking?
List and explain different loader schemes in detail.
What are the different types of Loaders? Explain compile and Go loader in detail.
List different types of Operating Systems? Describe any two of them.
Differentiate Preemptive and non-preemptive scheduling. Explain one example of each.
What is time quantum and its significance in Round robin scheduling.
Explain multithreaded mode and Process Control block in detail.
Write a short note on following with example? i) Semaphore ii) Monitor iii) Mutex
What is Deadlock? Explain deadlock avoidance algorithm with suitable example.
Explain hardware approach for Mutual Exclusion with its advantages and disadvantages.
What is semaphore? Write a solution to Reader Writer problem using Semaphore with Readers have priority.
Given a memory partitions of 100 K, 500 K200 K,300Kand 600K (in order), how would each of the first fit, best fit and worst fit algo. Place processes of size 212K, 417K, 112K, 426K (in order)? Which also makes the most efficient use of memory.
Compare Paging and Segmentation with the help of an example.
Consider page sequences 2, 3, 2, 1, 5, 4, 5, 3, 2, 2, 2, 5, 2 and discuss working of following page replacement policies. Also count page faults. (Use no. of frames = 3) i) FIFO ii) LRU
What is TLB? Explain the paging system with the use of TLB? What are the advantages of TLB?
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | V |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6403]-37 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2025 May Jun Endsem |
| Watermark | ['CEGP013091', '49.248.216.237 19/05/2025 09:43:16 static-237'] |
Explain “General loading scheme (using suitable diagram)” with advantages and disadvantages?
Give complete design of Direct Linking Loader?
Give complete design of Absolute Loader with suitable example?
What is the need of DLL? Differentiate between Dynamic and static linking?
Explain the following types of Schedulers. i) Short Term ii) Long Term iii) Medium Term
Explain seven state process model with diagram? Also explain difference between Five state process model & Seven state process model?
Draw Gantt chart and calculate Avg. turnaround time, Avg. Waiting time for the following processes using SJF non preemptive and round robin with time quantum 0.5 Unit. Process: P1, P2, P3, P4. Burst Time: 2, 1, 1, 1. Arrival Time: 10, 10, 11, 12
What is meant by Threads, Explain Thread lifecycle with diagram in detail?
Write a short note on following with example? i) Semaphore ii) Monitor iii) Mutex
Explain Deadlock prevention, deadlock avoidance, deadlock detection, deadlock recovery with example?
Explain producer Consumer problem & Dining Philosopher problem with solution?
What is deadlock? State and explain the conditions for deadlock, Explain them with example?
Consider page sequence 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2 and discuss working of following page replacement policies. Also count page faults. (use no. of frames = 3) i) FIFO ii) LRU
What is meant by Fragmentation, Explain Buddy Systems Fragmentation in detail?
Write a short note on following with diagram i) VM with Paging ii) VM with Segmentation
Given the memory partition of size 100K, 500K, 200K, 300K, 600K, how would each of the First Fit, Best Fit, Worst Fit algorithm place the processes of 212K, 417K, 426K. Which algorithm makes the most efficient use of memory?
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [5926]-59 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2022 Nov Dec Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 16/01/2023 13:45:14 static-238'] |
Explain in brief Compile and Go loading scheme. What are advantages and disadvantages of it.
Describe the concept of DLL? How dynamic linking can be done with or without import.
Write short notes on : i) Subroutine Linkage ii) Overlays
With the help of diagram explain General Loading Scheme.
List different types of Operating Systems? Describe any two of them.
Differentiate Preemptive and non preemptive scheduling.
What is time quantum and its significance in Round robin scheduling.
Explain multithreaded mode and Process Control block in detail.
What is semaphore? Justify how semaphore is used to solve critical section problem.
Explain necessary conditions for occurrence of deadlock.
Explain hardware approach for Mutual Exclusion with its advantages and disadvantages.
Write a solution to Reader Writer problem using Semaphore with Readers have priority.
Given a memory partitions of l00K, 500K, 200K, 300K and 600K (in order), how would each of the first fit, best fit and worst fit algo. Place processes of size 212K, 417K, 112K, 426K (in order)? Which also makes the most efficient use of memory.
What is internal fragmentation? Explain same with suitable diagram/ example.
Write and explain Deadlock Avoidance Bankers Algorithm.
Compare Paging and Segmentation with the help of example.
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6180]-47 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2023 Nov Dec Endsem |
| Watermark | ['CEGP013091', '49.248.216.238 04/12/2023 09:37:10 static-238'] |
Explain Static and Dynamic Linking with suitable diagram and example?
Explain complete design of Absolute Loader? Also explain its advantages and disadvantages?
What is Direct Linking Loader? Explain design of Direct Linking Loader with suitable example?
What is self-relocating programs? Explain with the help of loader schemes with neat diagram?
Explain Short term, Medium term and Long term scheduler? Discuss their role in seven state process model.
Explain seven state process model with diagram?
Draw Gantt chart and calculate Avg. turnaround time, Avg. waiting time for the following processes using SJF (Non preemption) and round robin with time quantum 2 Units? Process Burst Time Arrival Time P1 3 0 P2 5 1 P3 2 3 P4 5 9 P5 5 12
What is Process control block? Explain with diagram in detail?
Write a short note on following with example? i) Semaphore ii) Monitor iii) Mutex
Explain Bankers algorithm for deadlock avoidance in detail with suitable example?
Explain producer Consumer problem & Dining Philosopher problem with solution?
What is deadlock prevention? State and explain the conditions for deadlock occurrence?
Consider page sequence 2,3,2, 1,5,2,4,5,3,2,5,2 and discuss working of following page replacement policies. Also count page faults.(use no. of Frames = 3) i) OPT (Optimal) ii) LRU (Last Recently Used)
Why page size and frame size in paging should be same?What is translation look aside buffer?Describe its importance.
Write a short note on following with diagram i) Fixed Partitioning ii) Dynamic Partitioning
Explain Placement Strategies: First Fit, Best Fit, Next Fit and Worst Fit. In detail with example?
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 70 |
| Total Questions | 8 |
| Duration | 2½ Hours |
| Paper Number | [6353] - 37 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | ENDSEM |
| Exam Session | 2024 Nov Dec Endsem |
| Watermark | ['CEGP013091', '49.248.216.237 14/12/2024 09:33:18 static-237'] |
Explain Different assembly language statements with examples?
Explain Pass I and Pass II of two pass Assemblers with suitable examples and flowcharts?
Explain different data structures associated with PASS 1 & PASS 2 Assembler with example and structure?
What is System Programming? Explain Foundation of System Programming?
Explain in detail the various phases of a compiler, describes the output for the following Expression after each phase. A= b*c + c*d
What are macro processors? Explain Two Pass Macro with a suitable example and algorithm?
Explain different argument passing mechanism in Macros with an example?
Write Short note on: i) Compiler and interpreter ii) Macro and Assembler
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6579]-327 |
| Academic Year | T.E. |
| Branch Name | Computer Engg./Computer Science |
| Exam Type | INSEM |
| Exam Session | 2025 August Insem |
| Watermark | ['CEGP013091', '49.248.216.237 21/08/2025 10:35:33 static-237'] |
Draw and explain flowchart of Pass-I of two pass assembler with suitable example.
Differentiate between literal and immediate operand.
Explain in detail with a suitable example, the formates and contents of databases used in assembler design.
Explain algorithm of pass 1 of two pass assembler.
Define Macro. What are the advantages of macro facility? How they are different from functions?
Write Short note on i) Compiler ii) Interpreter
What are different data structures required for Two Pass Macro Processor? Justify which data structures are implemented at that time of processing Macro definition, Macro call and Macro Expansion.
Explain argument passing mechanism in Macros with suitable examples?
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | Oct-22/TE/Insem - 527 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | INSEM |
| Exam Session | 2022 Oct Insem |
| Watermark | ['CEGP013091', '49.248.216.238 06/10/2022 10:42:08 static-238'] |
What is purpose of Assembler pass 1? Draw and explain overview of Assembler pass 1 flow chart
Compare system softwares with Application softwares? Explain benefits of Assembly Language.
Discuss need of intermediate code of assembly program. Generate intermediate code for an assembly language program given in Question 2b using any one variant of intermediate code.
Explain the output of pass-I of two pass Assembler with respect to the given program: START 600 READ A READ B LOOP MOVER AREG, A MOVER CREG, B SUB AREG,=’l’ BC GT,LOOP STOP A DS 1 B DS 2 END
What is Macro? Explain Macro definition, Macro Call and Macro Expansion with an example.
Differentiate i) Macro and subroutine ii) Compiler and Interpreter
Explain various phases of the Compiler for the expression x = I + R * 60 where the data type of R is float.
Explain briefly the algorithm of pass l of two pass macro processor?
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6187]-427 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering/(A.I.D.S) |
| Exam Type | INSEM |
| Exam Session | 2023 Sep Insem |
| Watermark | ['CEGP013091', '49.248.216.238 06/09/2023 10:42:33 static-238'] |
Draw and explain flowchart of pass I of two pass assembler with example.
Differentiate : i) Literal and Immediate operand. ii) Assembler and Compiler
Consider following Assembly code and show output of pass-I of two pass Assembler with entries in Mnemonic Opcode Table, Pseudo Opcode Table, Symbol Table, Literal Table and Pool Table. PROG START 50 USING PROG+2, 15 L1, FIVE Al, = F ‘2’ LTORG ST 1, RES FIVE DC F ‘4’ RES DS F ‘4’ RES DS IF END
Enlist and explain necessity of different data structures used in Pass-I of two pass Assembler?
Explain the Phases of Compiler and their output with an example.
Define macro. What are the advantages of macro facility? How they are different from function.
What is the use of AIF and AGO pseudo-op in macro? Explain macro expansion with positional parameter with the help of suitable example.
Explain the concept of single pass Macro processor with example. Give example for macro calls within the macro.
| Subject Name | Systems Programming And Operating System |
|---|---|
| Semester | I |
| Pattern Year | 2019 |
| Subject Code | 310243 |
| Max Marks | 30 |
| Total Questions | 4 |
| Duration | 1 Hour |
| Paper Number | [6360]-27 |
| Academic Year | T.E. |
| Branch Name | Computer Engineering |
| Exam Type | INSEM |
| Exam Session | 2024 Sep Insem |
| Watermark | ['CEGP013091', '49.248.216.238 03/09/2024 10:39:29 static-238'] |
Select a question to generate an answer