HamiIT
Sign inGet started
Home
Theme
ADD CONTENT

Sign in Required

Please sign in to add content

Sign In
ProgramsBSC CSITSemester 4Operating System2070

BSC CSIT Semester 4 – Operating System 2070 TU Final Exam Questions & Answers

12 Questions•75 Marks•TU

Tribhuvan University

Institute of Science and Technology

2070

Bsc CSIT / Semester 4 / Science

Computer Science and Information Technology

Operating System

Full Marks: 60 + 20 + 20

Pass Marks: 24 + 8 + 8

Time: 3 Hours

Candidates are required to give their answers in their own words as far as practicable.

The figures in the margin indicate full marks.

SECTION A

Attempt any TWO question.

1
  1. For the processes listed in the following table, draw a Gantt chart illustrating their execution using:

    • a) First-Come-First-Serve (FCFS)
    • b) Shortest-Job-First (SJF)
    • c) Shortest-Remaining-Time-Next (SRTN)
    • d) Round-Robin (quantum = 2)
    • e) Round-Robin (quantum = 1)
    ProcessesArrival TimeCPU Time
    A0.0003
    B1.0016
    C4.0014
    D6.0022
    • What is the turnaround time for each algorithm?

    OR

    What do you mean by disk management? What is the major difference between error handling and formatting?

2
  1. How many page faults occur for each of the following page replacement algorithms for the reference string
    Code
    0 1 7 2 3 2 7 1 0 3
    with four page frames and eight pages?
    Suppose all frames are initially empty.
    • a) Optimal replacement
    • b) FIFO replacement
    • c) LRU replacement
    • d) Clock replacement
3
  1. Suppose that the disk drive has 50 cylinders, numbered from 0 to 49.
    The drive is currently serving the request at cylinder 20 and the previous request was at cylinder 25.
    The queue of pending requests is:
    Code
    10, 22, 20, 2, 40, 6, 38
    (in this order).
    A seek takes 6 msec per cylinder moved. How much seek time is needed for the following disk-scheduling algorithms?
    • a) First-Come, First-Served (FCFS)
    • b) Shortest Seek Time First (SSTF)
    • c) SCAN
    • d) LOOK

SECTION B

Attempt any EIGHT question.

4

Define the essential properties of the following types of operating systems:

  • a) Batch
  • b) Interactive
  • c) Time sharing
  • d) Real time
  • e) Handheld
5

Describe how multithreading improves performance over a single-threaded solution.

6

“Using Semaphore is very critical for programmer.”
Do you support this statement? If yes, prove the statement with some logical facts.
If not, present your view with logical facts against the statement.

7

Students working at individual PCs in a computer laboratory send their files to be printed by a server which spools the files on its hard disk.
Under what conditions may a deadlock occur if the disk space for print spool is limited?
How may the deadlock be avoided?

8

What are Segmentation and Paging? Why are they sometimes combined into one scheme?

9

What are the differences between a trap and an interrupt? What is the use of each?

10

What is “device independence”? Define.

11

Explain how the File Allocation Table (FAT) manages files.
Mention the merits and demerits of using FAT.

12

Write short notes on (any two):
a) Unix file system
b) Race condition
c) Windows file system

Showing 12 questions

*** END OF QUESTION PAPER ***

Exam Years

Sample Questions

1) For the processes listed in the following table, draw a Gantt chart illustrating their execution using: - a) First-Come-First-Serve (FCFS) - b) Shortest-Job-First (SJF) - c) Shortest-Remai

Marks: 10Chapter: Unit 4: Memory Management (8 Hrs.)

Given processes (arrival, burst): A(0.000, 3), B(1.001, 6), C(4.001, 4), D(6.002, 2) 1) FCFS (non‑preemptive) - Order: A → B → C → D - Completion times: A=3.000, B=9.000, C=13.000, D=15.000 - TAT

2) How many page faults occur for each of the following page replacement algorithms for the reference string 0 1 7 2 3 2 7 1 0 3 with four page frames and eight pages? Suppose all frames are

Marks: 10Chapter: Unit 4: Memory Management (8 Hrs.)

Page Replacement Algorithms and Page Faults Given: - Reference string: 0 1 7 2 3 2 7 1 0 3 - Number of page frames: 4 - Total pages: 8 - All frames are initially empty. --- 1. a) Optimal Page

3) Suppose that the disk drive has 50 cylinders, numbered from 0 to 49. The drive is currently serving the request at cylinder 20 and the previous request was at cylinder 25. The queue of pe

Marks: 10Chapter: Unit 6: Device Management (6 Hrs.)

Disk Scheduling Algorithms and Seek Time Calculation Given: - Cylinders: 0–49 - Current head: 20 - Previous request: 25 → direction = toward lower cylinders - Request queue: 10, 22, 20, 2, 40,

Define the essential properties of the following types of operating systems: - a) Batch - b) Interactive - c) Time sharing - d) Real time - e) Handheld

Marks: 5Chapter: Unit 1: Operating System Overview (4 Hrs.)

Types of Operating Systems and Their Essential Properties a) Batch Operating System - Definition: Executes a group of jobs (batch) without user interaction. - Properties: - No direct user inter

Describe how multithreading improves performance over a single-threaded solution.

Marks: 5Chapter: Unit 2: Process Management (10 Hrs.)

- Parallelism: Multiple cores execute threads simultaneously → higher throughput. - Overlap I/O and CPU: While one thread blocks on I/O, another runs → better CPU utilization. - Responsiveness: GU

And more questions available on this page.

About Operating System Past Questions

This page contains the complete 2070 TU Final examination paper for Operating System, part of the BSC CSIT Semester 4 curriculum. All questions are from official Tribhuvan University (TU) exam papers.

How to Use This Resource

  • Practice each question thoroughly before checking the answer
  • Use the answers as reference to understand the expected format
  • Time yourself to simulate exam conditions
  • Review chapter concepts if you struggle with any question
  • Link to specific questions using #q1, #q2, etc. in the URL

Related Resources

← Back to Operating System Chapters

Operating System 2070 TU Final past questions with answers for BSC CSIT students in Nepal. Prepare for Tribhuvan University (TU) exams with our comprehensive question bank and model answers.

H
Hami IT

Empowering IT students with quality education resources and comprehensive exam preparation materials.

Programs

  • Flutter
  • Java
  • DevOps

Company

  • About Us
  • Contact
  • Terms of Service
  • Privacy Policy

Contact

  • 📧contact@hamiit.com
  • 📞+977 9813706443
  • 📍Kathmandu, Nepal

Community

  • Join Discord
  • Report a bug
  • Request feature

© 2026 Hami IT. All rights reserved.