OS Organization: Final Exam Sample Questions- Multiple Choice II

  1. Consider a simple paging system with the following parameters: 2^32 bytes of physical memory, a page size of 2^10 bytes, and 2^16 pages of logical address space.  Suppose the page table entries have the following three fields:Page number, Valid bit, Page Frame number.

    How many bits are in a logical address?




    B. 16
  2. Consider a simple paging system with the following parameters: 2^32
    bytes of physical memory, a page size of 2^10 bytes, and 2^16 pages of
    logical address space.  Suppose the page table entries have the
    following three fields:Page number, Valid bit, Page Frame number.

    How many bytes are in a frame?




    A. 1,024
  3. Using the same description of 1 and 2: How many bits in the physical address specify the frame number? 




    C. 22
  4. Using the same description of 1 and 2: How many bits in the physical address specify the frame number? 
    A.10
    B. 16
    C. 22
    D. 32
    E. none of the above
  5. Using the same description of 1 and 2: How many bits in the logical address specify the page number?





    E. none of the above
  6. How many entries are there in the page table?





    C. 64
  7. How many bits in each page table entry?




    E. none of the above
  8. How large is the page table for a process?




    E. none of the above
  9. What is usually the critical performance requirement in an interactive OS:




    B. Response Time
  10. The type of scheduling that involves the decision to add a process to those that are at least partially in main memory and therefore available for execution is referred to as:




    B. Medium-term scheduling
  11. In a tree-structured directory, the series of directory names that culminates in a file name is referred to as the:



    A. Path name
  12. Briefly describe when on-demand fetch means that pages are loaded into memory
    On demand fetching means that each page of a process is loaded into memory upon the first access by the processor to a memory location within that page, and not before, as is often the case with pre-fetching.
  13. Define deadlock.
    A deadlock is a permanent blocking of a set of threads or processes due to each thread/process holding a resource which is wanted by one of the other threads/processes that are deadlocked
  14. (10 pts) Briefly describe what memory compaction is used for.
    Memory compaction is a technique to reduce/eliminate external fragmentation that results from the placement of variable sized partitions in main memory using the Dynamic Partitioning scheme. It works by moving processes around in main memory so as to eliminate the “holes” between them
Author
geschw66
ID
319989
Card Set
OS Organization: Final Exam Sample Questions- Multiple Choice II
Description
CSE 422s Operating Organization Spring 2016: On these multiple choice questions: Consider a simple paging system with the following parameters: 2 32 bytes of physical memory, a page size of 2 10 bytes, and 2 16 pages of logical address space. Suppose the page table entries have the following three fields: Page number, Valid bit, Page Frame number
Updated