HamiIT
Sign inGet started
Home
Theme
ADD CONTENT

Sign in Required

Please sign in to add content

Sign In
ProgramsBSC CSITSemester 4Operating System2079

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

12 Questions•75 Marks•TU

Tribhuvan University

Institute of Science and Technology

2079

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

Discuss about single level and two level directory system. Consider the following process and answer the following questions.

ProcessAllocationMaxAvailable
A B C DA B C DA B C D
P00 0 1 20 0 1 21 5 2 0
P11 0 0 01 7 5 0
P21 3 5 42 3 5 6
P30 6 3 20 6 5 2
P40 0 1 40 6 5 6

a. What is the content of matrix Need?
b. Is the system in safe state?
c. If P1 request (0,4,2,0) can the request be granted immediately.

2

When does race condition occur in inter process communication? What does busy waiting mean and how it can be handled using sleep and wakeup strategy?

3

Define shell and system call. suppose a disk has 201 cylinders, numbered from 0 to 200. At same time the disk arm is at cylinder 95, and there is a queue of disk access requests for cylinders 82,170,43,140,24,16 and 190. Calculate the seek time for the disk scheduling algorithm FCFS,SSTF,SCAN and C-SCAN.

SECTION B

Attempt any EIGHT question.

4

Distinguish between starvation and deadlock . How does the system schedule process using multiple queues?

5

List any two demerits of disabling interrupt to achieve mutual exclusion. Describe about fixed and variable partitioning

6

For the following dataset, compute average waiting time for SRTN and SJF.

ProcessArrival TimeBurst Time
P007
P124
P241
P354
7

Discuss the advantages disadvantages of implementing file system using Linked List.

8

Consider the page references 7,0,1,2,0,3,0,4,2,3,0,3,2, Find the number of page fault using OPR and FIFO, with 4 page frame.

9

Describe the working mechanism of DMA.

10

What is the task of disk controller ? List some drawback of segmentation.

11

Write the structure and advantages of TLB.

12

Why do we need the concept of locality of reference ? List the advantages and disadvantages of Round Robin algorithm.

Showing 12 questions

*** END OF QUESTION PAPER ***

Exam Years

Sample Questions

Discuss about single level and two level directory system. Consider the following process and answer the following questions. Process | Allocation | Max |Available| |----|-----|-----|-----| | |A B C

Marks: 10Chapter: Unit 5: File Management (6 Hrs.)

1. Single-Level and Two-Level Directory Systems Single-Level Directory - Concept: - All files are stored in one directory per user or system. - Structure: - Directory contains file name → p

When does race condition occur in inter process communication? What does busy waiting mean and how it can be handled using sleep and wakeup strategy?

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

Race Condition in Inter-Process Communication Definition: - A race condition occurs when two or more processes access shared resources concurrently, and the final outcome depends on the order of exe

Define shell and system call. suppose a disk has 201 cylinders, numbered from 0 to 200. At same time the disk arm is at cylinder 95, and there is a queue of disk access requests for cylinders 82,170,4

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

1. Definitions Shell - A shell is an interface between the user and the operating system. - It allows users to execute commands, run programs, and interact with the kernel. - Example: Bash, Zsh,

Distinguish between starvation and deadlock . How does the system schedule process using multiple queues?

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

1. Starvation vs Deadlock | Feature | Starvation | Deadlock | |----------------------|-------------------------

List any two demerits of disabling interrupt to achieve mutual exclusion. Describe about fixed and variable partitioning

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

1. Demerits of Disabling Interrupts for Mutual Exclusion Disabling interrupts is a method to achieve mutual exclusion by preventing context switches. Two main demerits are: 1. Increased Response Time

And more questions available on this page.

About Operating System Past Questions

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