CS604_FINAL PAPER_18 July 2011

Document Sample
CS604_FINAL PAPER_18 July 2011 Powered By Docstoc
					             CS604 FINAL TERM 18 July 2011 by


               All MCQS from ahndouts..Alhamdulillah ez.....:)
       And find the attachemnt for freshly baked Theory Questions..
                             There are 13...


                                    THEORY QUESTIONS




                                                                 m
   1. Suggest some way to reduce external fragmentation.




                                                               ru
   2. Write down the code/ pseudo-code for the wait operation on counting semaphore.
   3. The problem with using an acyclic-graph structure is ensuring that there are no
      cycles. What is the solution?




                                                            /fo
   4. If processes P and Q want to communicate, a communication link must exist between
      them and they send messages and receive messages. How many possible methods to
      communicate with each other
                                                   om
   5. Differentiate between outer page table and inner page table.
A page table needed for keeping track of pages of the page table is called the outer page table.
                                        .c
The other part of the page table index is called the inner page table.
                                      39

   6. Describe Safe state with reference to Deadlock Avoidance.
                               vu



   7. What is the main idea behind Overlays memory management technique?
   8. How vfork system call differes from fork system call?
                 w.




      .
               ww




   9. What is the problem hard links creates in terms of referential naming? How
      does one solve it?


   10. An operating system is intermediary between the user and the hardware system?
       .

   11. Consider a logical address space of eight pages of 1024 words each,
       mamapped ont a physical memory of 32 frames.
         a. How many bits are there in the logical address?
         b. How many bits are there in the physical address?

   12. Describe the concept of Directory Entry.




                                 www.vu39.com/forum
            CS604 FINAL TERM 18 July 2011 by

   13. Consider the following segmented paging memory system.
There are 4 segments for the given process and a total of 5 page tables in the entire system.
Each page table has a total of 8 entries. The physical memory requires 12 bits to address it;
there are a total of 128 frames.




                                                             m
                                                           ru
                                                        /fo
                                                om
                                      .c
                                    39

(a) How many bytes are contained within the physical memory?
                             vu
                w.
              ww




                               www.vu39.com/forum

				
DOCUMENT INFO
Shared By:
Stats:
views:9
posted:5/26/2012
language:English
pages:2
Description: CS604_FINAL PAPER_18 July 2011