Daffodil International University
Department of Computer Science and Engineering
Faculty of Science & Information Technology
Final Exam Examination, Summer 2020 @ DIU Blended Learning Center
Course Code: CSE 323 (Day), Course Title: Operating System
Level: 3 Term: 2 Section: O-1, O-2
Instructor: SL Modality: Open Book Exam
Date: Thursday, 22 August, 2020 Time: 02:00-06:00pm
Four hours (4:00) to support online open/case study based assessment Marks: 40
Directions:
Students need to go through the CASE STUDY shown in this exam paper.
Analyze and answer specific section based on your own thinking and work.
Do not share as this will be treated as plagiarism by Blended Learning Center.
Question 1: (8 + 6 + 6)
a) Apply both FIFO and LRU (Page Replacement Algorithm) to calculate the page fault for
following set-up:
Reference String: All digits of your Student ID (Example: 1 8 1 1 5 1 0 0 0 0)
Frame No: Total number of digits of last part of your Student ID (Example: 3/4/5)
b) Explain Paging and Page Fault concept with the pages and frames created in (a). Your answer must
include all the core parts of these concepts.
c) If the created pages in (a) would be segments for main memory partition or frames created in (a)
then what difference it would make? Justify your answer with demonstration of data.
Question 2: (5 + 4)
a) Draw resource allocation graph according to the following resource matrix. Determine if there is a
deadlock. If yes, indicate the processes and resources involved and add one resource which could
fix the deadlock. If not, argue why this is the case, and provide a feasible sequence of processes to
show completion and add one resource which could create deadlock.
pg. 1
Allocation Need Available
R0 R1 R2 R3 R0 R1 R2 R3 R0 R1 R2 R3
P0 1 0 0 0 0 0 0 0 1 0 0 1
P1 0 0 1 0 1 1 1 0
P2 0 1 0 1 1 0 0 0
P3 0 0 1 1 0 0 0 0
b) Suppose you want to build an operating system, you want to implement methods for handling
deadlock. Which method will you add in your operating system and why? Explain the benefits of
your chosen method over others in details.
Question 3 (5 + 6)
a) Suppose the processes P1 to P9 given in the table (in order) need to place in memory. Five memory
blocks of variable sizes are available. In your opinion, which algorithm is best for allocating these
process into memory in term of size and speed? Why? Explain your answer. Assume 5 memory sizes
which will be between 10K and 350K. Allocate these process to these memory by using a suitable
memory allocation algorithm and show this with necessary diagram.
Process Size Turnaround
P1 150k 2
P2 200k 1
P3 45k 2
P4 15k 3
P5 25k 1
P6 200k 2
P7 20k 1
P8 40k 2
P9 100k 2
pg. 2
b) You own the course, Operating System. Yes! This course was designed to give ownership to students
where students will practice adaptive learning and peer learning online! That means, you were
supposed to learn from your mistakes as well as share your knowledge with your friends in the last
3.5 months. Indeed that was a great journey of learning, fun, adda and what not! Now look back to
ask yourself, what are the core things you have learnt from this course after multiple attempts?
Write some cases with explanation that will showcase as evidence of adaptive learning. In each
case, do not forget to mention what were your mistakes in initial attempts with proper
example. Also, mention what new knowledge of this course you have shared with your friends
or peers after proper understanding and what specific learning you have received from your
peers? In peer learning section, you need to elaborate in concept wise pattern, not just a simple
calculation or formula will be an example here.
Hint: Highlight all valuable take-away of Operating System course learning with the reflection
of your own understanding.
Caution: Plagiarism will be checked. If any copy is found then there will be negative marking!
All the best!
pg. 3
