Scribd
Upload
3 views

Course-Assignment-CSC-307-A-SP-24-1

307-A

Uploaded by

alaminakash550
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

Course-Assignment-CSC-307-A-SP-24-1

307-A

Uploaded by

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

Founded 1991 by Md.

Alimullah Miyan

College of Engineering and Technology


Department of Computer Science and Engineering
Course Assignment of Spring Semester 2024
Program: Bachelor of Computer Science and Engineering
Course Instructor: M.M. Rakibul Hasan

Course Code: CSC 307


Course Title: Operating Systems Full Marks: 100
Section: A Last Date of Submission: 30.04.2024

Instructions: (1) Answer all the questions. (2) Marks allocated are indicated in the right margin.
(3) Parts of each question must be answered consecutively. (4) Full task should be
Hand Written. (5) Hand write should be clean and readable. (6) Give a computer
compose front page. (7) Write your findings in the assignment. Coping for others’ is
totally prohibited. Result of plagiarism is directly F grade.

1 Consider a system with three I/O devices: a printer, a disk, and a CO C2 [10]
. communications line, with increasing priorities of 2, 4, and 5, respectively. 1
PO1
A user program begins at t = 0, a printer interrupt occurs at t = 5, a
communications interrupt occurs at t = 10 while the printer Interrupt
Service Routine (ISR) is still executing, and a disk interrupt occurs at t =
15 while the communication ISR is executing. Show a possible time
sequence by using priority-based multiple interrupts approach.

2 Consider the following information: CO C3 [10]


. P = {P1, P2, P3} 1
R = {R1, R2, R3} PO1
E = {R1 --> P1, P1 --> R2, R2 --> P2, P2 --> R3, R3 --> P3, P3 --> R1}
Resource type R1 has one instance,
Resource type R2 has one instance,
Resource type R3 has one instance
Draw a resource allocation graph and explain the possibility for a
deadlock.

Page 1 of 3
Founded 1991 by Md. Alimullah Miyan

3 CO C3 [20]
. 3
PO2

4 Given 5 memory partitions of 100KB, 500KB, 200KB, 300KB and CO C3 [20]


. 2
600KB in order. In fixed size partitioning method how would each of the PO1
First-fit, Best-fit and Worst-fit algorithm place processes of 212KB,
417KB, 112KB, 426KB in order.

5 Assume a machine in which 4 page frames are available, and in which memory is CO C3 [20]
. initially empty. Consider the following reference string of memory accesses to 2
pages: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 PO1
How many page faults will occur with the following replacement algorithms? Do
not count the initial 4 page faults to bring pages 1 to 4 in memory.
Briefly explain your answer.
a) OPT
b) LRU
c) FIFO
d) MRU
6 Consider the following set of processes, with the length of the CPU burst given CO C3 [20]
. in milliseconds. 3
PO2
PNO Burst Time
P1 10
P2 1
P3 2
P4 1
P5 5

The processes are assumed to have arrived in the order P1, P2, P3, P4, and
P5 all at time 0.

a) Draw four Gantt charts that illustrate the execution of these processes using

Page 2 of 3
Founded 1991 by Md. Alimullah Miyan

the following scheduling algorithms: FCFS, SJN, SRTF and RR (quantum =1).
b) What is the average turnaround time of each process for each of the
scheduling algorithms in part a?
c) What is the average waiting time of each process for each of the scheduling
algorithms in part a?
d) Which of the algorithms give result in the minimum average waiting
time?

Bloom’s Taxonomy Levels in Cognitive Domain:


C1: Remember; C2: Understand; C3: Apply; C4: Analyze; C5: Evaluate; C6: Create

Targeted PO: PO1(co1, co2), PO2(co2, co3)

Course Outcomes:
CO1: Explain the concept, role, and structural design of operating system.
CO2: Apply mechanisms to solve problems related to task-processing, memory, I/O and file
management.
CO3: Evaluate the performance of different algorithms used in operating systems.

Program Outcomes:
PO1. Engineering Knowledge An ability to apply knowledge of computing, mathematics, science
and engineering fundamentals to the solution of complex engineering problems.

PO2. Problem Analysis An ability to identify, formulate and analyze complex engineering
problems. Also, capability to select and apply the engineering knowledge to computing problems that
requires the application of principles and applied procedures or methodologies.

Page 3 of 3

You might also like