We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
Assignment No. 03
CS604: Operating System
Total Marks: 15
Due Date: 25/07/2017
Please read the following instructions carefully before submitting the assignment. It should be clear that your assignment will not get any credit if:
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.
The objective of this assignment is to provide hands on experience of:
For any query about the assignment, contact at CS604@vu.edu.pk
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
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
• Physical address
Be Best of Luck st of Luck
.+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)