Scribd Logo
Upload

Welcome to Scribd!

  • 2K views

    Step 3 Test Chapter 8

    Uploaded by

    nicodz
    Absolute code can be generated at compile-time. Load-time binding is the method most operating systems use to bind instructions and data to memory. An address generated by the CPU is called a logical address. In a program with execution-time binding using a relocation register of 100, a physical address of 300 would correspond to a logical address of 200. The memory management unit maps logical addresses to physical addresses in hardware. A dynamically linked library postpones loading until execution time.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Step 3 Test Chapter 8

    Uploaded by

    nicodz
    2K views3 pages
    Absolute code can be generated at compile-time. Load-time binding is the method most operating systems use to bind instructions and data to memory. An address generated by the CPU is called a logical address. In a program with execution-time binding using a relocation register of 100, a physical address of 300 would correspond to a logical address of 200. The memory management unit maps logical addresses to physical addresses in hardware. A dynamically linked library postpones loading until execution time.

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Absolute code can be generated at compile-time. Load-time binding is the method most operating systems use to bind instructions and data to memory. An address generated by the CPU is called a logical address. In a program with execution-time binding using a relocation register of 100, a physical address of 300 would correspond to a logical address of 200. The memory management unit maps logical addresses to physical addresses in hardware. A dynamically linked library postpones loading until execution time.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    2K views3 pages

    Step 3 Test Chapter 8

    Uploaded by

    nicodz
    Absolute code can be generated at compile-time. Load-time binding is the method most operating systems use to bind instructions and data to memory. An address generated by the CPU is called a logical address. In a program with execution-time binding using a relocation register of 100, a physical address of 300 would correspond to a logical address of 200. The memory management unit maps logical addresses to physical addresses in hardware. A dynamically linked library postpones loading until execution time.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Test Chapter 8

    Absolute code can be generated for ____. A) compile-time binding B) load-time binding C) execution-time binding D) interrupt binding _____ is the method of binding instructions and data to memory performed by most generalpurpose operating systems. A) Interrupt binding B) Compile time binding C) Execution time binding D) Load-time binding An address generated by a CPU is referred to as a ____. A) physical address B) logical address C) post relocation register address D) Memory-Management Unit (MMU) generated address Suppose a program is operating with execution-time binding and the physical address generated is 300. The relocation register is set to 100. What is the corresponding logical address? A) 199 B) 201 C) 200 D) 300 The mapping of a logical address to a physical address is done in hardware by the ________. A) memory-management-unit (MMU) B) memory address register C) relocation register D) dynamic loading register In a dynamically linked library, ____. A) loading is postponed until execution time B) system language libraries are treated like any other object module C) more disk space is used than in a statically linked library D) a stub is included in the image for each library-routine reference

    7. The _____ binding scheme facilitates swapping. A) interrupt time B) load time C) assembly time D) execution time _____ is the dynamic storage-allocation algorithm which results in the smallest leftover hole in memory. A) First fit B) Best fit C) Worst fit D) None of the above _____ is the dynamic storage-allocation algorithm which results in the largest leftover hole in memory. A) First fit B) Best fit C) Worst fit D) None of the above Which of the following is true of compaction? A) It can be done at assembly, load, or execution time. B) It is used to solve the problem of internal fragmentation. C) It cannot shuffle memory contents. D) It is possible only if relocation is dynamic and done at execution time. A(n) ____ page table has one page entry for each real page (or frame) of memory. A) inverted B) clustered C) forward-mapped D) virtual With segmentation, a logical address consists of _____. A) segment number and offset B) segment name and offset C) segment number and page number D) segment table and segment number Which of the following data structures is appropriate for placing into its own segment? A) heap B) kernel code and data C) user code and data D) all of the above

    A relocation register is used to check for invalid memory addresses generated by a CPU. Ans: False Reentrant code cannot be shared. Ans: False There is a 1:1 correspondence between the number of entries in the TLB and the number of entries in the page table. Ans: False Hierarchical page tables are appropriate for 64-bit architectures. Ans: False Fragmentation does not occur in a paging system. Ans: False Hashed page tables are particularly useful for processes with sparse address spaces. Ans: True Without a mechanism such as an address-space identifier, the TLB must be flushed during a context switch. Ans: True Hashed page tables are commonly used when handling addresses larger than 32 bits. Ans: True

    You might also like