Scribd
Upload
102 views2 pages

Department of Computer Science & Engineering: University of Asia Pacific (UAP)

1. The document is a final exam for an Operating Systems course. It contains 4 questions worth a total of 150 marks. The questions cover topics like page replacement algorithms, bankers algorithm for deadlock detection, process scheduling using priority scheduling and shortest job first, states of a process, and operating system services. 2. The exam tests the students understanding of key operating systems concepts like memory management, concurrency, scheduling and system structure. It requires students to apply algorithms to scenarios and explain their analysis and outcomes. 3. The questions are both theoretical, asking about OS goals and process states, and practical, requiring application of algorithms to example problems to test comprehension.

Uploaded by

Kingshuk Paul Mishon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
102 views2 pages

Department of Computer Science & Engineering: University of Asia Pacific (UAP)

1. The document is a final exam for an Operating Systems course. It contains 4 questions worth a total of 150 marks. The questions cover topics like page replacement algorithms, bankers algorithm for deadlock detection, process scheduling using priority scheduling and shortest job first, states of a process, and operating system services. 2. The exam tests the students understanding of key operating systems concepts like memory management, concurrency, scheduling and system structure. It requires students to apply algorithms to scenarios and explain their analysis and outcomes. 3. The questions are both theoretical, asking about OS goals and process states, and practical, requiring application of algorithms to example problems to test comprehension.

Uploaded by

Kingshuk Paul Mishon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Department of Computer Science & Engineering

University of Asia Pacific (UAP)


Program: B.Sc. in Computer Science and Engineering

Final Examination Spring 2020 4th Year 1st Semester

Course Code: CSE 405 Course Title: Operating Systems Credits: 3

Full Marks: 120* (Written) Duration: 2 Hours

* Total Marks of Final Examination: 150 (Written: 120 + Viva: 30)

Instructions:
1. There are Four (4) Questions. Answer all of them. All questions are of equal value. Part marks are
shown in the margins.
2. Non-programmable calculators are allowed.

1. a) Take your student ID, now take the reverse string of your student ID. Now append(join) 30
them. Now, suppose this represent the page requests for a system. Now, apply all the three
page replacement algorithms on this scenario, where window size = 3, and analyze which
algorithm is better and explain why.

2. a) Suppose, there are 5 processes P0 through P4; 3 resource types: P (11 instances), Q (6 30
instances), and R (8 instances).
Snapshot at time T0:
Allocation Max
PQR PQR
P0 121 864
P1 311 433
P2 413 913
P3 322 333
P4 113 544
Here, Available = the last three digits of your ID, BUT, mod each digit with 3. For example
of the last 3 digit of your id is 198, them Available = 102, (1%3 = 1, 9%3 = 0, 8%3 = 2).
Now, perform Bankers and determine if there is any Deadlock present in this scenario.

3. a) Process Burst time Priority 15


P 3 8
Q 2 5
R 7 5
S 5 2
t 12 1
Consider the given scenario. Now, apply pre-emptive priority scheduling and shortest
job first for the given scenario and prepare the grant chart and calculate the average
waiting time.

b) What is Operating System? What are the goals of Operating System? 15

4. a) What are the different states of a process? Explain with diagram. 15


b) Write short notes on: Web-based System, Client-Server System, Peer to Peer System. 15

OR

a) Explain the Services provided by Operating System 15


b) Write short notes on: Different types of schedulers, Different types of process scheduling 15
queues.

You might also like