Department of Computer Science and Engineering

Jessore University of Science and Technology

3rd Year 1st Semester Final Examination-2019
Session: 2016-2017
Course Code: CSE- 3101 Time: 3.00 hours
Course Title: Operating System Marks: 72
[N.B. All questions are of equal value. Answer any 6(six) of the following]

1. (a) What is operating system? Discuss how operating system can be treated as Government. 4
(b) What is the purpose of interrupts? What are the differences between a trap and an interrupt? 3
(c) Define Caching. Discuss the performance of various levels of storage. 5

2. (a) What is system Call? For what facilities System Call can be initiated? 4
(b) Consider the following set of processes, with the length of the CPU burst given in milliseconds. Draw the 8
Gantt charts that illustrate the execution of these processes using SRTF. Calculate the average waiting time by
showing the waiting time of each process.

Process Arrival Time Burst Time

P1 0 8
P2 5 11
P3 7 7
P4 3 5

3. (a) Describe Process Synchronization. 3

4
(b) What is context switch? Explain how a process can be terminated.
(c) Define thread. How signals can be handled and delivered using threads? 5

4. (a) Write the differences between multiprogramming and multitasking 4

(b) Explain why threads are necessary. 4
(c) Define dispatch latency. Explain how context switch varies with Quantum. 4

5. (a) Explain how Round Robin Scheduling works with proper example. 4

(b) What purpose Compaction used for? 2

(c) Consider the following set of processes, with the length of the CPU burst given in milliseconds. Draw the 6
Gantt charts that illustrate the execution of these processes using SJF. Calculate the average waiting time by
showing the waiting time of each process.

Process Arrival Time Burst Time

P1 0 8
P2 2 10
P3 4 4
P4 5 2

6. (a) Explain how the performance of demand paging can be measured. 4

(b) Define Paging. Calculate physical memory for the following logical memory and page table. 8
 7. (a) Explain Deadlock Detection Algorithm. 4
(b) Let P={P1, P2, P3}, R={R1(1) , R2 (2), R3(1),} E={P1 →R1, P2 →R3, R1 →P2, R2 → P2, R2 5
→P1, R3 →P3}
Now draw resource allocation graph and determine whether a deadlock occurred or not.
(c) Explain how deadlock can be eliminated using process termination. 3

8. (a) What will be the number of page faults and page hits for Optimal page replacement strategy for the 5
following reference string with three frames?
8, 2, 3, 4, 2, 5, 8, 2, 3, 6, 7, 8, 1, 2, 8, 3, 4, 5, 6, 8
(b) Consider the following snapshot of a system: 7

i) Is the system in a safe state? If yes then find the safe sequence.
ii) If a request from process P4 arrives for (3,3,2) can the request be granted immediately?

Question Set By:

05/05/19

Md. Ashiq Mahmood,

Lecturer,
Institute of Information and Communication Technology (IICT),
Khulna University of Engineering & Technology (KUET),
Khulna-9203.
Phone: +88 041-769468-75 Ext 8471
Email: ashiqmahmood@iict.kuet.ac.bd, ashiqmahmoodbipu@gmail.com
Cell: +880 178 0636861