We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

CS703 - Advanced Operating Systems Assignment No. 2 Solution & Discussion Due Date: Dec 08, 2016

CS703 - Advanced Operating Systems Assignment No. 2 Solution & Discussion Due Date: Dec 08, 2016

CS703 - Advanced Operating Systems Assignment No. 2 Solution Fall 2016 Due Date: Dec 08, 2016

Virtual University of Pakistan

Fall 2016

Assignment No. 2

Instructions to Solve Assignments

The purpose of the assignments is to give you hands on practice. It is expected that students will solve the assignments themselves. Following rules will apply during the evaluation of assignment.

?  Cheating from any source will result in zero marks in the assignment.

?  Any student found cheating in any two of the assignments submitted will be awarded "F" grade in the

course.

?  No assignment after due date will be accepted.

1

Virtual University of Pakistan

Fall 2016

Question No. 1                                                                                                     (10 marks)

Give two differences between user-level threads and kernel-level threads? Under what circumstances is one type better than the other?

Question No. 2                                                                                                     (15 marks)

Revive the Readers/Writers problem discussed in lecture 12, write the code for function Writer() when readers are given priority over writers, keeping the problem constraints in mind?

Question No. 3                                                                            (8 + 8 + 8 + 1 = 25 marks)

Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

Process  Burst Time  Priority

P

1

10

3

P

2

1

1

P

3

2

3

P

4

1

4

P

5

5

2

The processes are assumed to have arrived in the order P

1.  P2, P 3, P 4, P 5, all at time 0.
1.  Draw four Gantt charts illustrating the execution of these processes using FCFS,

SJF, a nonpreemptive priority (a smaller priority number implies a higher

priority), and RR (quantum = 1) scheduling.

1.  What is the turnaround time of each process for each of the scheduling algorithms

in part a?

1.  What is the waiting time of each process for each of the scheduling algorithms in

part a?

1.  Which of the schedules in part a results in the minimal average waiting time (over

all processes)?

2

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

Views: 186

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Replies to This Discussion

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

&

Latest Activity

+ ! ! ! ❣ maho ❣ ! + posted a discussion

.......

2 hours ago
2 hours ago
Bilal.Khan posted a status
"cs201 past papers required.."
3 hours ago
3 hours ago
4 hours ago
4 hours ago
4 hours ago
4 hours ago
4 hours ago
4 hours ago
4 hours ago
4 hours ago

1

2

3