We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
CS604 Spring 2018 Final Term Papers Pattern & Questions 01 September 2018 to 12 September 2018 & Helping Material
+ Click Here To Join also Our facebook study Group.
.+ http://bit.ly/vucodes (Vu Study Groups By Subject Codes Wise)
Share Your Final Term Papers (Questions/Pattern) & Past Papers as well here to help each other. Thanks
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
Please Click on the below link to see…
Identify the name of problem which could be solved by using the code given below. Also describe that problem briefly.
Shared Data Structures:
semaphore mutex, wrt;
if(readcount == 1)
reading is performed
if(readcount == 0)
writing is performed
MCQs aur subjective kis ki file se the?
MCQs kis ki file se aye the?
60-70% mcqs from moaz paper
Provide names of common file structures.
How can you achieve memory protection in paging?
What is the basic function of pipe system call?
What is the structure of Two-Level Page Table?
Ignoring CPU overhead, what are the three primary components of disk access time (the time from the request of a sector to the time that it is available to the CPU). Given a transfer of a single sector, rank them according to their relative average cost.
Briefly explain Thrashing as it pertains to main memory management.
What do you think that why Main Memory is kept as a volatile memory and why not a permanent storage device?
Summarize the tradeoffs among simple arrays, trees, and hash tables as implementations of a page table
30% MCQs were from past paper and 70% were new..
Subject part was little bit difficult....
All questions were new.. I remember some questions of them .. That are share..
1) enlist the conditions of deadlock and which condition dining philosopher problem occur .
2) arrange according to througput( to order high to low)
Priority based scheduling
Shorten job first
3) describe problems due to preemption resources (in deadlock)
4) given 3 processes and resources.. Find how system allocate resouces to each process for safe state..
5) page fault and who responsible for page fault..
6) Given table ..fill it according to banker algorithm..
plz send me Waqar Siddu files