Scribd
Upload
36 views2 pages

Bit Info Nepal - Operating Systems - Bit204-2078

This document is an examination paper for the Bachelor in Information Technology program at Tribhuvan University, focusing on Operating Systems. It includes long answer questions on disk scheduling algorithms, virtual memory, critical sections, and semaphore operations, as well as short answer questions covering various operating system concepts. The exam consists of a total of 60 marks, with specific instructions on answering and marking distribution.

Uploaded by

Jayprakash Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views2 pages

Bit Info Nepal - Operating Systems - Bit204-2078

This document is an examination paper for the Bachelor in Information Technology program at Tribhuvan University, focusing on Operating Systems. It includes long answer questions on disk scheduling algorithms, virtual memory, critical sections, and semaphore operations, as well as short answer questions covering various operating system concepts. The exam consists of a total of 60 marks, with specific instructions on answering and marking distribution.

Uploaded by

Jayprakash Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

BIT204-2078 ✡

Tribhuvan University
Institute of Science and Technology
2078
✡
Bachelor Level/Second Year/Third Semester/Science Full Marks: 60
Bachelors in Information Technology (BIT 204) Pass Marks: 24
(Operating Systems) Time: 3 hours

Candidates are required to give their answers in their own words as for as practicable.
The figures in the margin indicate full marks.
Section A
Long Answer Questions
Attempt any TWO questions. [2×10=20]

1. Suppose that a disk has 100 cylinders, numbered 0 to 99. The drive is currently serving a request
at cylinder 45. The queue of pending request, in FIFO order is: 88, 72, 13, 74, 48, 9, 22, 50, 35
and 30. What is the total distance (in cylinders) that the disk arm moves to satisfy all pending
request for each of the following disk scheduling algorithms?
a) FCFS
b) SCAN
c) SSTF

2. Why virtual memory technique is used in the computer system? What is logical address? Explain
the process of conversion of logical address to physical address in single level paging scheme.

3. What is critical section? What are the operations that can be performed on the semaphore?
Explain the solution to producer consumer problem using semaphore.

Section B
Short Answer Questions
Attempt any EIGHT questions. [8×5=40]

4. Draw and describe the 5-state process model.


5. What is kernel? Differentiate between monolithic and microkernel structure.
6. What is DMA? Explain how it works in brief with suitable diagram.
7. What are different types of file? Describe the sequential and random access of files.
8. What is deadlock? What ate necessary conditions for deadlock? Explain.
9. What is thread? Explain user level thread and kernel level thread.
10. A 2 GB hard disk has 2 KB block size, calculate the size of bitmap for bitmap based free space
management.
11. What is an operating system? Differentiate between time sharing and real time operating system.

IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2078
BIT204-2078 ✡

12. Consider the following set of processes, with the length of CPU brust time given in milli seconds.

Process CPU Brust Priority


A 8 3
B 9 1 (Lowest)
C 10 2
D 6 4 (Highest)

The processed are assumed to have arrived in the order A, B, C and D all at time 0.
What is the turnaround time and waiting time for the scheduling algorithms, RR
(quantum = 3) and Priority Algorithm.

IOST, TU
BIT INFO NEPAL - Operating Systems - BIT204-2078

You might also like