CS604 Finalterm Current Paper 2013 File 6 Shared by syeda Areeba

No Comments


  1. Briefly describe the concept of the reentrant code?
  2. To resolve trashing due to ecessive paging, what can a user do?
  3. How can we calculate a size of page table? Just provide the formula?
  4. Describe the following command Grep ’’Asif’’ academics>admin
  5. What are three different stages/times when address can be bound to instructions and data?
  6. What is the problem hard links creats in terms of referential naming? How does one solve it?
  7. If we take a  average page falut service time of 20 milli secondand a memory access time of 100  neno second then affective access time in neno second?
  8. Analyze the relationship b/w fork() and except system calls?
  9. Describe 5 attributes of the file?
  10. What hardware is needed to support demand paging and swapping name and describe briefly?
  11. Let us consider a situation in which we want to communicate un related process on the same system?
  12. Out of primary and secondary storage which memory do you think is best suited to store a program written in C language is which memory is best suited when we want to execute that program given reasons?
Next PostNewer Post Previous PostOlder Post Home

0 comments

Post a Comment