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

# Assignment No.# 3 CS604

Assignment No. 03
Semester: Spring 2017

CS604: Operating System

Total Marks: 15

Due Date: 25/07/2017

Instructions:

Please read the following instructions carefully before submitting the assignment. It should be clear that your assignment will not get any credit if:

• The assignment is submitted after the due date.
• The submitted assignment does not open or file is corrupt.
• Assignment is copied (partial or full) from any source (websites, forums, students, etc)

Note: Assignment covered from lecture no. 27 to 33. You have to upload only .doc file. Assignment in any other format (extension) will not be accepted and will be awarded with zero marks.

Objective:

The objective of this assignment is to provide hands on experience of:

• Understanding of Memory Management
• To know the algorithms of deadlock handling, prevention and avoidance  mechanisms
• Page table implementation and Performance of paging

For any query about the assignment, contact at CS604@vu.edu.pk

Assignment

Question No. 1 (05 marks):

There is a system with 16 tape drives and four processes. To follow the deadlock avoidance algorithm creates a Safe Sequence of the following processes by calculating the available tape drives.

Initial Avialable tap drive = 2

 Processes Max Need of tape drives Allocated tape drives Available tape drives P0 15 5 P1 6 4 P2 10 2 P3 9 3

Question No. 2 (05 marks):

Considering the following constraints, calculate the effective access time of finding a page table entry in the TLB. Write down the all calculating steps.

Tmem = 200 nsec

TTLB = 30 nsec

Hit ratio is 70%

Teffective = ?

Question No. 3 (05 marks):

Suppose, Logical address space = 32 bits, Page size = 8k, Process address space = 4GB and Main memory RAM = 512 MB

Then calculate the following

•        Maximum pages in a process address space

•        Address bits p (page number) and d (offset)

•        No. of frames

•        Frame size

Be Best of Luck st of Luck

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

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

Views: 3269

.

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

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

Attachments:

### Replies to This Discussion

kindly share solution file....

Solution

Attachments:

## Latest Activity

1 minute ago
+ ! ! No Name updated their profile
11 minutes ago
42 minutes ago
42 minutes ago
42 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked + "Jɨyą's discussion okey :x
42 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked + "Jɨyą's discussion Kia fark perta h...! XD
42 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked + "AS"'s discussion Log tou Masla Banaty Hain..
43 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked + "AS"'s discussion Jesi Ab hai ..
43 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked + "AS"'s discussion Dil Behlane K liye Log..
43 minutes ago
+ ! ! ! ! ! ! ! ! ! AG liked + "AS"'s discussion Suna Hai Ab ..
43 minutes ago
43 minutes ago
45 minutes ago
+ ! ! ! ! ! ! ! ! ! AG joined + M.Tariq Malik's group

### STA301 Statistics and Probability

45 minutes ago
46 minutes ago
+ ! ! ! ! ! ! ! ! ! AG joined + M.Tariq Malik's group

### MTH401 Differential Equations

47 minutes ago
48 minutes ago
+ ! ! ! ! ! ! ! ! ! AG joined + M.Tariq Malik's group

48 minutes ago
48 minutes ago

1

2

3