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

Looking For Something at vustudents.ning.com? Click Here to Search

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. 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

•        Physical address

 

 

 

 

Be Best of Luck st of Luck

 

 

 

+ Click Here To Join also Our facebook study Group.

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


See Your Saved Posts Timeline

Views: 3263

.

+ 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?)

Attachments:

Replies to This Discussion

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

2

P1

6

4

6

P2

10

2

11

P3

9

3

9

 

Safe Sequence is  < P1, P3, P2, P0 >  

Available tape drives are < 2, 6, 11, 9 >

QUESTION NO 3: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 |f|
• Physical address
ANS IS:
Maximum pages in a process address space = 232 / 4K = 1M
|d| = log2 4K = 12 bits
|p| = 32 – 12 = 20 bits
No. of frames = 512 M / 4 K = 128 K
|f| = ceiling [log2 128 K] bits = 17 bits ≈ 4 bytes (rounding to next even-numbered byte)
Physical address = 17+12 bits
MY ANSWER IS CORRECT OR NOT PLZZ TELL ME

no... Page size is 8K not 4K

Complete solution kia hai?

Q.No.3:

Maximum Page in Process Address Space = 512 k

|d| = 13 bits

|p| = 19 bits

No. of Frames = 64k

|f| = 16 bits

Physical Address = 29 bits

Is sequence k according available tape drives are
2, 6,9,11

yes your answer is right

2nd question kry discuss plzz k kaisy value put kry

Please Discuss here about this assignment.Thanks

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.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•.

 

Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 

Q#2:

Handouts Page # 170 & 171

Kindly check is it right or wrong.

Tmem = 200 nsec
TTLB = 30 nsec
Hit ratio is 70 %
Teffective = 0.7(30+200) + 0.3 (30+2*200) nanoseconds = 290

This is right thnks share

kindly post the second answer 

RSS

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service