Skip to content
EndsemNov 20252019 patternTE IT

Operating System (OS) SPPU Endsem Question Paper Nov 2025

All 8 questions from this SPPU endsem paper, as printed. Read them here or open the PDF.

Open the PDFMost repeated OS questions
Subject code
314442
Pattern
2019 pattern
Exam
Endsem
Session
Nov 2025
Max. marks
70
Time
2½ Hours
Semester
V
Paper code
[6583]-128

Printed for: T.E. (Information Technology)

Instructions to the candidates

  1. Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
  2. Neat diagrams must be drawn wherever necessary.
  3. Figures to the right side indicate full marks.
  4. Assume suitable data, if necessary.

Questions

  1. Q1

    1. a)

      What is critical section? Write parameters to control access to critical section and explain the requirements to be satisfied for its solution.

      [9]
    2. b)

      What is deadlock? What are the necessary conditions for deadlock? How deadlock is detected in a system having single instance of each type?

      Also asked:Nov 2022

      [9]

  2. Q2

    1. a)

      Explain any two approaches for Recovery from deadlock.

      [6]
    2. b)

      This part has equations that don’t show as text. Open the PDF to read it.

      [12]

  3. Q3

    1. a)

      Given references to the following pages by a program 0,1,4,2,0,2,6,5,1,2,3,2,1,2,6,2,1,3,6,2. Compute number of page faults if the system has 3 page frames for the following policies i) FIFO ii) LRU iii) Optimal Page replacement

      [9]
    2. b)

      Explain paged memory management in detail.

      [8]

  4. Q4

    1. a)

      What is Belady’s anomaly? Explain with suitable example.

      [6]
    2. b)

      Consider the following segment table : Segment Base Length 0 330 124 1 876 211 2 111 99 3 498 302 What are the physical addresses for the following logical addresses? If the address generates a segment fault indicate so. i) 0,99 ii) 2,78 iii) 1,265 iv) 3,222 v) 0,111

      [5]
    3. c)

      Explain memory partition selection algorithms

      [6]

  5. Q5

    1. a)

      A disk drive has 1000 cylinders, numberd 0-999. The drive is currently serving the request at track no. 345 and head is moving towards track 0. The queue of pending requests in FIFO order is 123,874, 692,475,105,376. 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. i) FCFS ii) SCAN iii) LOOK iv) SSTF

      [12]
    2. b)

      Explain Record blocking with the help of neat diagrams.

      [6]

  6. Q6

    1. a)

      Write different file system free space management techniques.

      [9]
    2. b)

      Explain different file allocation methods. 3

      Also asked:Nov 2022

      [9]

  7. Q7

    1. a)

      Define the following terms : i) Macro processor ii) Interpreter iii) Linker

      [3]
    2. b)

      Differentiate between a system software and application software.

      [6]
    3. c)

      Explain Pass 1of assembler with flowchart.

      [8]

  8. Q8

    1. a)

      Explain the phase structure of a compiler with neat diagram.

      [9]
    2. b)

      Explain the following i) Compile and Go Loader ii) Absolute Loader ♦♦♦

      [8]