Download - 11a

Transcript
Page 1: 11a

Main Memory

1. Absolute code can be generated for ____.A) compile-time bindingB) load-time bindingC) execution-time bindingD) interrupt binding

Ans: AFeedback: 8.1.2Difficulty: Easy

2. _____ is the method of binding instructions and data to memory performed by most general-purpose operating systems.

A) Interrupt bindingB) Compile time bindingC) Execution time bindingD) Load-time binding

Ans: CFeedback: 8.1.2Difficulty: Medium

3. 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) 199B) 201C) 200D) 300

Ans: CFeedback: 8.1.3Difficulty: Easy

Page 2: 11a

4. The mapping of a logical address to a physical address is done in hardware by the ________.

A) memory-management-unit (MMU)B) memory address registerC) relocation registerD) dynamic loading register

Ans: AFeedback: 8.1.3Difficulty: Medium

5. In a dynamically linked library, ____.A) loading is postponed until execution timeB) system language libraries are treated like any other object moduleC) more disk space is used than in a statically linked libraryD) a stub is included in the image for each library-routine reference

Ans: DFeedback: 8.1.5Difficulty: Medium

6. _____ is the dynamic storage-allocation algorithm which results in the smallest leftover hole in memory.

A) First fitB) Best fitC) Worst fitD) None of the above

Ans: BFeedback: 8.3.2Difficulty: Easy

7. _____ is the dynamic storage-allocation algorithm which results in the largest leftoverhole in memory.

A) First fitB) Best fitC) Worst fitD) None of the above

Ans: CFeedback: 8.3.2Difficulty: Easy