Skip to content
EndsemNov 20222019 patternTE IT

Operating System (OS) SPPU Endsem Question Paper Nov 2022

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 2022
Max. marks
70
Time
2½ Hours
Semester
I
Paper code
[5926]-120

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, and Q.7 or Q.8.
  2. Figures to the right side indicate full marks.

Questions

  1. Q1

    1. a)

      What is semaphore and mutex? Explain with the help of pseudocode, how semaphore is used to solve producer consumer problem?

      Also asked:May 2025 ·May 2024

      [9]
    2. b)

      What are the four necessary conditions for deadlock? How is a deadlock detected in a system with resources having single instances? Explain with an example.

      Also asked:Nov 2025

      [9]

  2. Q2

    1. a)

      Define mutual exclusion, race condition, semaphore. 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 memory partitions of 150k, 650k, 280k, 390k and 540k (in order) how would each of the First fit, Best fir, and Worst fit algorithms place processes of 212k, 457k, 112k, 510k and 326k (in order)

      [9]
    2. b)

      With the help of neat diagrams, Write a short note on Buddy system.

      [8]

  4. Q4

    1. a)

      Explain Belady’s anomaly with suitable example.

      [6]
    2. b)

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

      [6]
    3. c)

      What are the distinctions among logical, relative and physical addresses?

      [5]

  5. Q5

    1. a)

      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 SCAN and C-LOOK. 3 i) FCFS ii) SCAN iii) C-LOOK iv) SSTF

      [12]
    2. b)

      Explain with diagrams different I/O buffering techniques.

      Also asked:May 2025

      [6]

  6. Q6

    1. a)

      List and explain different file access methods.

      Also asked:Nov 2025

      [9]
    2. b)

      Describe different methods of record blocking with the help of a neat diagram.

      [9]

  7. Q7

    1. a)

      What is system software? Explain any four system software in brief?

      Also asked:May 2024

      [6]
    2. b)

      Explain imperative statement, declarative statement, and assembly directive of assembly language programming?

      [6]
    3. c)

      Discuss with example what is forward reference problem.

      [5]

  8. Q8

    1. a)

      Explain ORIGIN, EQU and LTROG with an example.

      [6]
    2. b)

      Explain the data structures required for two PASS Assembler in detail.

      Also asked:May 2025

      [6]
    3. c)

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

      [5]