Scribd
Upload
9 views

Operating Systems

This document outlines an examination for a Bachelor of Engineering course in Operating Systems at Pokhara University for Spring 2024. It includes various topics such as definitions and types of operating systems, process and thread management, deadlock, memory allocation strategies, disk scheduling algorithms, and distributed operating systems. Students are required to answer all questions, demonstrating their understanding of the subject matter.

Uploaded by

mediafantastic123
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Operating Systems

This document outlines an examination for a Bachelor of Engineering course in Operating Systems at Pokhara University for Spring 2024. It includes various topics such as definitions and types of operating systems, process and thread management, deadlock, memory allocation strategies, disk scheduling algorithms, and distributed operating systems. Students are required to answer all questions, demonstrating their understanding of the subject matter.

Uploaded by

mediafantastic123
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

POKHARA UNIVERSIT Y

Level: Bachelor Semester: Spring Year : 2024


Programme: BE Full Marks: 100
Course: Operating Systems Pass Marks: 45
Time : 3 hrs.
Candidates are required to give their answers in their own words as far
as practicable.
The figures in the margin indicate full marks.
Attempt all the questions.
1. a) What is Operating System? Explain the types of OS. 8
b) Explain process and thread. Draw process state diagram and explain 7
each step.
2. a) Explain Dining Philosophers Problem. How do you solve it? 7
b) What is semaphore? Explain the producer consumer problem and 8
algorithm solving it using semaphore.
3. a) What is Deadlock? Consider a system with four processes PO 8
through P3 and three resources types A, B, C. Resource type A has
10 instances, B has 6 instances and type C has 8 instances. Suppose
at a time t0, following snapshot of system has been taken.
Is the system safe? If yes, then what is the safe sequence?

b) Consider following set of processes along with their burst time, 7


arrival time and priorities. Calculate average waiting time and
average turnaround time using following scheduling. Also describe
which one is the best algorithm and why?
i. SJF
ii. Priority (preemptive)
iii. RR (Quantum size = 2ms)
Process Burst Time Arrival Time Priority
A 5 0 2
B 15 1 3
C 10 2 1

Page 1 of 2
4. a) What is contiguous memory allocation? Given memory partition of 7
11K, 14K, 20K,10K, 17K,19K,12K and 30K in order. How would
processes of 22K, 12K, 9K, 2k and 17K in order be placed for each.
i. first fit
ii. best fit
iii. worst fit
b) Consider the reference page string: 6,1,2,3,4,1,2,4,2,1,0,3,4,2,0. 8
Calculate page hits, page faults, hit ratio, fault ratio assuming
3 frames for the following page replacement algorithms.
i. Optimal
ii. FIFO
iii. MRU
5. a) Suppose a disk drive has 200 cylinders. The current position of the 8
R/W head is at cylinder 50 and the previous request was at cylinder
45. The sequence of pending requests is 40,82, 140, 46, 88, 170, 197,
135. Starting from current position what is the total number of track
movements (distance) for the following disk scheduling algorithms.
i. SSTF ii. LOOK iii. C-SCAN iv) FCFS
b) Explain the different attributes of file. Explain the file allocation 7
techniques.
6. a) What is distributed operating system? Explain Remote Procedure 8
Call (RPC) with appropriate figure and example.
b) Describe the Amoeba System Architecture. How process 7
management is done in Amoeba?
7. Write short notes on: (Any two) 2×5
a) Context Switching
b) PCB
c) File Systems and Disk management in LINUX

Page 2 of 2

You might also like