Back to Other Questions [Of this Course]
👁️ 176 views
University of Barishal Logo

University of Barishal

Department of Computer Science and Engineering

1st Mid Exam

Course Title: Operating System (CSE-2207)

Semester: 4th | Session: 21-22

Time: 60 minutes | Marks: 20.00

Course Teacher: Md. Rashid Al Asif

Exam Date: July 9, 2025

View 133 Topic-wise Questions for this Course
1.
Scenario:

Consider the following set of process with CPU burst time.

Consider the FCCFS, SJF Non-Preemptive and Round Robin (Quantum =10) scheduling algorithms and calculate average waiting time to find which algorithm would give the minimum average waiting time.

 

Consider the following snapshot of a system where there are five processes PO through p4 and three resource ypes A (10 instances), B (5 instances), and C (7 instances):

a)

Answer the following questions using the banker's algorithm:

i) What is the content of the matrix Need?

 

ii) Define safe and unsafe state. Is the system in a safe state? If so, show a safe order in which the processes can execute.

 

iii) If a request from process PO arrives for (0,2,0), can the request be granted immediately?

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
10 Marks
2.

a)

Describe the following with examples:

i) Paging

ii) TLB

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
10 Marks
View 133 Topic-wise Questions for this Course

Contributors of this Question:

Role Name Date
Prepared By (Teacher): Md. Rashid Al Asif July 9, 2025
Uploaded By: Margia Rowshon July 9, 2025, 9:38 p.m.
Converted By (Img/PDF to Text): Obaydul Hasan Nayeem Dec. 3, 2025, 9:18 p.m.
Reviewed By: Obaydul Hasan Nayeem Dec. 3, 2025, 9:49 p.m.
Back to Other Questions [Of this Course]