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

Cs604 Current Final Term Papers & Past Final Term Papers at One Place from 22 agust TO 2 september2015

Share Your Final Term Papers Here in Reply of this Discussion

May Allah Solve Our Problems and Give Us Success

You Can download papers by a simple click on file. All the uploaded filed are in Zip file or PDF format So Install Adobe Reader and Winrar Software’s to open these Files

Note: If you download files with Internet Download Manager (IDM), you would face problem of damage files. All files are correct and no damage file, If you face this problem, Open IDM > Click on Options > Click on File Types > Remove PDF and ZIP from files types and save. After it download again files, files will work properly.

You Can Download Solved Final Term Papers, Short Notes, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quizzes , Solved Final Term Subjective Papers , Solved Final Term Objective Papers From This Discussion For Preparation Final Term Paper of FALL 2014

Or

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


See Your Saved Posts Timeline

Views: 8998

.

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

Replies to This Discussion

Suppose a process P1 does not have sufficient pages, the page-fault rate is very high. This leads to low CPU utilization. The operating system needs to increase the degree of multiprogramming because it monitors the CPU utilization. When another process added, will it increase the throughput of the system? Justify your answer.

 

Ans:

If the process does not have enough pages the page fault rate is very high. This leads to low cpu utilization, the operating system thinks that it need to increase the degree of multiprogramming because it monitors Cpu utilization and find it to be decreasing due page fault. Thus another process is added to the system and hence thrashing occurs and cause throughput to plunge.

 

 

 

Consider a virtual memory system in which a process does not have enough pages therefore the page-fault rate is very high. This leads to low CPU and I/O devices utilization; whereas disk utilization is high. Write down the name of activity that leads to said problems and how can you overcome these problems.

 

Ans:

 

 

 

Let us consider a page size of 16 bytes and process address space of 32 pages and physical address space of 64

frames. Calculate the following.

a) Size of logical address i.e. Number of bits needed to uniquely identify a page in this address space of 16

pages.

b) Logical address in bits for (18, 10). Where ‘p’ and ‘d’ are 18 and 10 respectively.

 

Ans:

 

Number of bits needed for P=ceiling [log216] bits = 3 bits

Number of bits needed for F= ceiling [log232] bits = 5 bits

Number of bits needed for D= ceiling [log264] bits = 11 bits

Logical address size =P+D= 3+11 = 14 page

Physical address size = F+D = 5 +11 = 16 bits

 

b

Logical address size =P+D= 18+10 = 28 bits

 

 

Which component of an operating system is best suited to ensure fair, secure, orderly, and efficient use of memory? Also identify some more tasks managed by that component

Ans:

The most suitable component of an operating system that suited to ensure fair, secure, orderly and efficient use of memory is Memory Management System.

The task of memory management includes keeping track of used and free memory space as well as when, where, and how much memory to allocate and deallocate.

It is also responsible for swapping process in and out of main memory. The purpose of memory management is to ensure fair, secure, orderly and efficient use of memory.

 

 

In segmentation, how do you evaluate whether a logical address is legal or not? Write evaluation criteria and segment offset partitioning.

 

Ans:

In segmentation, logical address is legal. A logical space is a collection of segments. A segment is a logical unit such as program, procedure, functions, methods, objects, global variables, stacks and symbol table.

 

 

What will be guaranteed if the following limits are checked in banker's algorithm?

 

Is Request1 ≤ Need1?

Is Request1 ≤ Available?

 

When a new process enter the system it must declare the maximum number of instances of each resource that it may need. This number may not exceed the total number of instance of resource in the system otherwise the process must wait until some other process release enough resources.

 

1. True 

2. True

 

 

You are required to identify the primary protection scheme under paging that guards a process trying to access a page that does not belong to its address space. Name the scheme with brief description.

 

Ans:

The primary protection scheme guards against the process trying to access a page that does not belong to its address space. This is achieved by using a invalid bit. This bit indicates whether the page is in the process address space or not. It the bit is set to invalid it indicates that the page is not in the process logical address space.

Illegal address is a trapped by using the valid invalid bit and control is passed to the operating system for appropriate section.

 

 

Virtual Memory is an extremely large main memory”.

Do you agree with the given statement or not? Give reason to support your answer.

 

Ans:

Yes I agree that Virtual Memory is an extremely large main memory.

Virtual memory makes the tasks of programming easier because the programmer need not worry about the amount of physical memory, or about what code can be placed in overlays. They can concentrate instead on the problem to be programmed.

 

 

Under what conditions can you use the Wait-for graph to detect deadlock?

Ans:

Single instance of each resource type.

If all resources have only a single instance then we can define a deadlock algorithm that uses a variant of the resource allocation graph called a wait for graph.

We obtain this graph from the resource allocation graph by removing the nodes of type resource and collapsing the appropriate edges.

 

 

Name the algorithm which is used as bench mark for page replacement.

Ans:

 

FIFO page replacement algorithm is used as bench mark for page replacement.

 

 

In a UNIX operating system, name the system call that can be used to request memory map an opened file.

Ans:

In a UNIX operating system, mmap() system call can be used to request the operating system to memory map an opened file.

 

 

What is Roll out, Roll in technique with respect to Swapping.

Ans:

If a higher priority process arrives and wants service the memory manager can swap out the lower priority process. So it can load and execute the higher priority process. When the higher priority process finishes the lower priority process can be swapped back in and continue. This technique is called Roll out, Roll in technique.

thanks u very much nayab for shairing

Thanks a lot + Nayab Ali for sharing

plz any one share mcqz file of moaz.thankx

Asslam o Alikum !!!

Kch papers m ny solve keye hain cs604 k pechly sem k finltrm may be help ho jay sb ki

Dua krna sb kindly kal sbo mera paper cs604 ka

Attachments:

RSS

Latest Activity

szh786 updated their profile
1 hour ago
+ ՏhehαrZααD + replied to + M.Tariq Malik's discussion VU Students Reserves The Right to Delete Any Profile On the Site
2 hours ago
+ Android updated their profile
3 hours ago
+ "αяsαℓ " Ќąƶµяɨ •" and + Iuuoɔǝut+ are now friends
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + Iuuoɔǝut+'s discussion Har Shaks Naraz hy meri baton sy
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + "αяsαℓ " Ќąƶµяɨ •"'s blog post چھوٹا کام
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG replied to + Iuuoɔǝut+'s discussion Har Shaks Naraz hy meri baton sy
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + Iuuoɔǝut+'s discussion Farz Karo ....
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + Adeeena's discussion usay pasand hai
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + Iuuoɔǝut+'s discussion Investment risk management report Bangladesh
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG replied to + M.Tariq Malik's discussion ایسا بھی میرے دوست فارغ نہیں ہوں - میں بیٹھا ہوں انتظار میں، کب یاد آوں گا
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + M.Tariq Malik's discussion ایسا بھی میرے دوست فارغ نہیں ہوں - میں بیٹھا ہوں انتظار میں، کب یاد آوں گا
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG replied to + M.Tariq Malik's discussion کوئی مشکل پڑے تعویذ بنا سکتے - ہو تم مرے نام پہ ہر داو لگا سکتے ہو
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG replied to + M.Tariq Malik's discussion یہ ان کا ظرف ہے بیٹھے ہیں آستینوں میں - یہ میری خو ہے کہ میں یار یار کرتا ہوں
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + M.Tariq Malik's discussion کوئی مشکل پڑے تعویذ بنا سکتے - ہو تم مرے نام پہ ہر داو لگا سکتے ہو
3 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + M.Tariq Malik's discussion یہ ان کا ظرف ہے بیٹھے ہیں آستینوں میں - یہ میری خو ہے کہ میں یار یار کرتا ہوں
3 hours ago
+ M.Tariq Malik left a comment for Ƨ.ℳƧℂƧ
3 hours ago
+ M.Tariq Malik liked + M.Tariq Malik's discussion یہ ان کا ظرف ہے بیٹھے ہیں آستینوں میں - یہ میری خو ہے کہ میں یار یار کرتا ہوں
3 hours ago
+ M.Tariq Malik posted discussions
3 hours ago
+ M.Tariq Malik liked + M.Tariq Malik's discussion کوئی مشکل پڑے تعویذ بنا سکتے - ہو تم مرے نام پہ ہر داو لگا سکتے ہو
3 hours ago

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

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