HamiIT
Sign inGet started
Home
Theme
ADD CONTENT

Sign in Required

Please sign in to add content

Sign In
ProgramsBSC CSITSemester 4Operating System2078

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

12 Questions•75 Marks•TU

Tribhuvan University

Institute of Science and Technology

2078

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

What kind of problem arises with sleep and wakeup mechanism of achieving mutual exclusion? Explain with suitable code snippet.

2

Why OPR is best but not pratically fessible page replacement algorithm? Calculate the number of page faults for OPR, LRU and Clock page replacement algorithm for the reference string: 1, 3, 4, 2, 3, 5, 4, 3, 1, 2, 4, 6, 3, 2, 1, 4, 2. Assume the memory size is 3.

3

How unsafe state differs from deadlocked state? Consider follows initial state and identify wheather requested is and granted or denies for the given cases.

ProcessHasMax
A26
B15
C23
D38

Free = 2

  • What will happen if process D request 1 resource?\
  • What will happen if process A request 1 resource?

SECTION B

Attempt any EIGHT question.

4

What is system call? Discuss process of handling system calls briefly.

5

What is lock variable? Discuss its working and problems associated with it in detail.

6

Differentiate between internal and external fragmentation? Suppose that we have memory of 100 KB with 5 partitions of size 150 KB, 200 KB, 250 KB, 100 KB, and 300 KB. Where the processes A and B of size 175 KB and 125 KB will be loaded, if we used Best-Fit, and Worst-Fit Strategy?

7

What is ment by file attributes? Discuss any one technique of implementing directories in detail.

8

Why the concept of disk interleaving is important? Explain with suitable example.

9

What is resource allocation graph? Explain the process of detecting deadlocks when there is single instance of each resources with suitable example?

10

Discuss the concept of SJF and SRTN scheduling algorithms with suitable example.

11

What approaches are using for managing free disk spaces? Explain linked list approaches with example.

12

Write short notes on:
a. IPC in Linux
b. Disk access

Showing 12 questions

*** END OF QUESTION PAPER ***

Exam Years

Sample Questions

What kind of problem arises with sleep and wakeup mechanism of achieving mutual exclusion? Explain with suitable code snippet.

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

Sleep and Wakeup Mechanism for Mutual Exclusion 1. Concept: - The sleep and wakeup mechanism is a software-based way to achieve mutual exclusion without busy waiting. - Idea: - If a process cann

Why OPR is best but not pratically fessible page replacement algorithm? Calculate the number of page faults for OPR, LRU and Clock page replacement algorithm for the reference string: 1, 3, 4, 2, 3, 5

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

Optimal Page Replacement (OPR) and Practical Feasibility 1. Why OPR is the Best but Not Practically Feasible - Optimal Page Replacement (OPR): - Replaces the page that will not be used for the lon

How unsafe state differs from deadlocked state? Consider follows initial state and identify wheather requested is and granted or denies for the given cases. Process | Has | Max| ----|-----|-----| A |2

Marks: 10Chapter: Unit 3: Process Deadlocks (6 Hrs.)

Unsafe State vs Deadlocked State - Deadlocked State: - No process can proceed because each is waiting indefinitely for resources held by others. - System is completely stuck. - Unsafe State:

What is system call? Discuss process of handling system calls briefly.

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

System Call in Operating System 1. Definition: - A system call is a request made by a user-level program to the operating system (kernel) to perform a task that the program cannot execute directly. -

What is lock variable? Discuss its working and problems associated with it in detail.

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

Lock Variable 1. Definition: - A lock variable is a shared boolean variable used to achieve mutual exclusion between processes in a critical section. - Purpose: Ensure that only one process enters t

And more questions available on this page.

About Operating System Past Questions

This page contains the complete 2078 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 2078 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.