OS9

A relocation register is used to check for invalid memory addresses generated by a CPU. True False

False

Fragmentation does not occur in a paging system. True False

False

Hierarchical page tables are appropriate for 64-bit architectures. True False

False

Inverted page tables require each process to have its own page table. True False

False

Mobile operating systems typically support swapping. True False

False

Reentrant code cannot be shared. True False

False

A(n) ______ matches the process with each entry in the TLB. a.) address-space identifier b.) process id c.) stack d.) page number

a.) address-space identifier

A 32-bit logical address with 8 KB page size will have 1,000,000 entries in a conventional page table. True False

False

There is a 1:1 correspondence between the number of entries in the TLB and the number of entries in the page table. True False

False

Hashed page tables are commonly used when handling addresses larger than 32 bits. True False

True

Hashed page tables are particularly useful for processes with sparse address spaces. True False

True

In swapping with paging technique, individual pages of a process are swapped in or out. True False

True

The ARM architecture uses both single-level and two-level paging. True False

True

Without a mechanism such as an address-space identifier, the TLB must be flushed during a context switch. True False

True

Given the logical address 0xAEF9 (in hexadecimal) with a page size of 256 bytes, what is the page number? a.) 0xAE b.) 0xF9 c.) 0xA d.) 0x00F9

a.) 0xAE

If the base register is loaded with value 12345 and limit register is loaded with value 1000, which of the following memory address access will not result in a trap to the operating system? a.) 12500 b.) 12200 c.) 13346 d.) 12344

a.) 12500

Consider a logical address with 18 bits used to represent an entry in a conventional page table. How many entries are in the conventional page table? a.) 262,144 b.) 1,024 c.) 1,048,576 d.) 18

a.) 262,144

A page-table base register stores a.) a pointer to the page table in memory. b.) the starting logical address of the page currently being accessed. c.) the starting physical address of the frame currently being addressed. d.) the page size of the page currently being accessed.

a.) a pointer to the page table in memory.

Computing systems need cache because a.) accessing main memory is slow and cache speeds it up. b.) register access is slow and cache speeds it up. c.) main memory is expensive and cache offsets the cost. d.) All of the about.

a.) accessing main memory is slow and cache speeds it up.

A translation look-aside buffer is used to a.) cache page table entries. b.) store the address of the page table in memory. c.) size of the logical address space of the currently running process. d.) store page size.

a.) cache page table entries.

A page out operation a.) moves a page from memory to the backing store. b.) moves a page from the backing store to memory. c.) moves a page from one frame to another. d.) deletes a page from the backing store.

a.) moves a page from memory to the backing store.

The protection bit in a page table a.) provides protection against unauthorized updates in the page table. b.) marks a page table as read-only or read-write. c.) marks a frame as read-only or read-write. d.) All of the above.

a.) provides protection against unauthorized updates in the page table.

Assume the value of the base and limit registers are 1200 and 350 respectively. Which of the following addresses is legal? a.) 355 b.) 1200 c.) 1551 d.) all of the above

b.) 1200

Which of the following is true about dynamic storage allocation? a.) Worst fit provides the best storage utilization. b.) First fit requires less time for allocation than worst fit on average. c.) Best fit is clearly better than first fit in terms of time and storage utilization. d.) First fit is clearly better than best fit in terms of time and storage utilization.

b.) First fit requires less time for allocation than worst fit on average.

Which of the following statement is correct? a.) Base register holds the size of a process. b.) Limit register holds the size of a process. c.) Base and limit registers can be loaded by the standard load instructions in the instruction set. d.) Any attempt by a user program to access memory at an address higher than the base register value results in a trap to the operating system.

b.) Limit register holds the size of a process.

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

b.) logical address

If execution time binding is used, a.) logical addresses of process may change over time but physical addresses remain the same. b.) physical addresses of process may change over time but logical addresses remain the same. c.) both physical and logical addresses may change over time. d.) both physical and logical addresses remain the same over time.

b.) physical addresses of process may change over time but logical addresses remain the same.

Replacement question: With segmentation in IA-32 architecture, a logical address consists of _____. a.) segment number and offset b.) segment number, GDT or LDT indicator, protection and offset c.) segment number, page number and offset d.) segment number, page number, GDT/LDT, protection and offset

b.) segment number, GDT or LDT indicator, protection and offset

Reentrant code is easier to share when paging is used, because a.) each process can modify that code its own way. b.) the code doesn't change during execution. c.) the code changes are identical for each process. d.) All of the above.

b.) the code doesn't change during execution.

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

c.) 200

Which of the following technique is well suited to support very large address space, e.g. 64-bit address space? a.) Inverted page tables b.) Hierarchical page tables c.) Clustered page tables d.) All of the above

c.) Clustered page tables

If the starting address location changes, in which of the following cases, the program has to be recompiled? a.) Execution time binding. b.) Load time binding. c.) Compile time binding d.) Both compile and load time bindings.

c.) Compile time binding

_____ is the method of binding instructions and data to memory performed by most general-purpose operating systems. a.) Interrupt binding b.) Compile time binding c.) Execution time binding d.) Load-time binding

c.) Execution time binding

Replacement Question: Address translation from a logical address to a physical address in IA-32 architecture is comprised of a.) a segmentation unit that translates the logical address to its physical address. b.) a paging unit that translates the logical address to its physical address. c.) a segmentation unit followed by a paging unit that translate the logical address to its physical address. d.) a paging unit followed by a segmentation unit that translates the logical address to its physical address.

c.) a segmentation unit followed by a paging unit that translate the logical address to its physical address.

A large page size results in a.) lower internal fragmentation b.) larger page table overhead c.) efficient disk I/O d.) All of the above

c.) efficient disk I/O

The roll out, roll in variant of swapping is used ____. a.) when a backing store is not necessary b.) for the round-robin scheduling algorithm c.) for priority-based scheduling algorithms d.) when the load on the system has temporarily been reduced

c.) for priority-based scheduling algorithms

A 64-bit architecture with more than 16 quintillion addressable memory a.) can support a majority of today's application requirements, but not all. b.) is large enough to support all current as well as future application requirements. c.) is large enough to support all current application requirements but may not be able to support all future application requirements. d.) All of the above.

c.) is large enough to support all current application requirements but may not be able to support all future application requirements.

Suppose the size of a process is 10,000 bytes and the relocation register is loaded with value 5000, which of the following memory address this process can access? a.) logical address 10,350 b.) physical address 4,500 c.) physical address 10,350 d.) None of the above

c.) physical address 10,350

Assume a system uses 2-level paging and has a TLB hit ratio of 90%. It requires 15 nanoseconds to access the TLB, and 85 nanoseconds to access main memory. What is the effective memory access time in nanoseconds for this system? a.) 22 b.) 108.5 c.) 30.5 d.) 117

d.) 117

The x86-64 architecture provides support for a.) 64-bit physical addresses b.) 48-bit physical addresses c.) 32-bit physical addresses d.) 52-bit physical addresses

d.) 52-bit physical addresses

A frame table stores a.) which frames are allocated. b.) which frames are free. c.) total number of frames. d.) All of the above.

d.) All of the above.

The _____ binding scheme facilitates swapping. a.) interrupt time b.) load time c.) assembly time d.) execution time

d.) execution time

The x86-64 architecture provides support for a.) three different page sizes using 3-level paging hierarchy. b.) four different page sizes using 4-level paging hierarchy. c.) four different page sizes using 3-level paging hierarchy. d.) three different page sizes using 4-level paging hierarchy.

d.) three different page sizes using 4-level paging hierarchy.

External fragmentation is a.) when there is some unused memory that cannot be allocated to a process. b.) when the amount of available memory is less than the size of a process. c.) when a process is broken up into smaller parts for memory allocation. d.) when there is enough total memory space to satisfy a request but the available spaces are not contiguous.

d.) when there is enough total memory space to satisfy a request but the available spaces are not contiguous.