Question 1

Describe the partitions in a logical-address space of a process in the IA-32 architecture.

Accepted Answer

The logical-address space is divided int

Question 2

Replacement question: With segmentation in IA-32 architecture, a logical address consists of _____.

Accepted Answer

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 
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

Question 3

Computing systems need cache because

Accepted Answer

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. 
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.

Question 4

If the starting address location changes, in which of the following cases, the program has to be recompiled?

Accepted Answer

A)  Execution time binding. 
B)  Load time binding. 
C)  Compile time binding 
D)  Both compile and load time bindings. 
A)  Execution time binding. 
B)  Load time binding. 
C)  Compile time binding 
D)  Both compile and load time bindings.

Question 5

Describe how a transaction look-aside buffer (TLB) assists in the translation of a logical address to a physical address.

Accepted Answer

Typically, large page tables are stored

Question 6

Distinguish between internal and external fragmentation.

Accepted Answer

Fragmentation occurs when memory is allo

Question 7

Given the logical address 0xAEF9 (in hexadecimal) with a page size of 256 bytes, what is the page number?

Accepted Answer

A)  0xAE 
B)  0xF9 
C)  0xA 
D)  0x00F9 
A)  0xAE 
B)  0xF9 
C)  0xA 
D)  0x00F9

Question 8

Explain why mobile operating systems generally do not support paging.

Accepted Answer

Mobile operating systems typically do no

Question 9

How are illegal page addresses recognized and trapped by the operating system?

Accepted Answer

Illegal addresses are trapped by the use

Question 10

Which of the following is true about dynamic storage allocation?

Accepted Answer

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. 
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.

Question 11

Fragmentation does not occur in a paging system.

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

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

Accepted Answer

A) True 
 B)False

Question 14

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?

Accepted Answer

A)  262,144 
B)  1,024 
C)  1,048,576 
D)  18 
A)  262,144 
B)  1,024 
C)  1,048,576 
D)  18

Question 15

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

Accepted Answer

A) True 
 B)False

Question 16

Explain the basic method for implementing paging.

Accepted Answer

Physical memory is broken up into fixed-

Question 17

The x86-64 architecture provides support for

Accepted Answer

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. 
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.

Question 18

Assume the value of the base and limit registers are 1200 and 350 respectively. Which of the following addresses is legal?

Accepted Answer

A)  355 
B)  1200 
C)  1551 
D)  all of the above 
A)  355 
B)  1200 
C)  1551 
D)  all of the above

Question 19

A(n) ______ matches the process with each entry in the TLB.

Accepted Answer

A)  address-space identifier 
B)  process id 
C)  stack 
D)  page number 
A)  address-space identifier 
B)  process id 
C)  stack 
D)  page number

Question 20

Replacement questions: Briefly describe the memory management scheme of IA-32. How does it differ from the paging memory management scheme in terms of the user's view of memory?

Accepted Answer

Memory management in IA-32 systems is di

Describe the partitions in a logical-address space of a process in the IA-32 architecture.

Replacement question: With segmentation in IA-32 architecture, a logical address consists of _____.

Computing systems need cache because

If the starting address location changes, in which of the following cases, the program has to be recompiled?

Describe how a transaction look-aside buffer (TLB) assists in the translation of a logical address to a physical address.

Distinguish between internal and external fragmentation.

Given the logical address 0xAEF9 (in hexadecimal) with a page size of 256 bytes, what is the page number?

Explain why mobile operating systems generally do not support paging.

How are illegal page addresses recognized and trapped by the operating system?

Which of the following is true about dynamic storage allocation?

Fragmentation does not occur in a paging system.

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

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

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?

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

Explain the basic method for implementing paging.

The x86-64 architecture provides support for

Assume the value of the base and limit registers are 1200 and 350 respectively. Which of the following addresses is legal?

A(n) ______ matches the process with each entry in the TLB.

Replacement questions: Briefly describe the memory management scheme of IA-32. How does it differ from the paging memory management scheme in terms of the user's view of memory?

Introduction

Operating-System Structures

Processes

Threads Concurrency

Cpu Scheduling

Synchronization Tools

Synchronization Examples

Deadlocks

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters

Exam 9: Main Memory

Describe the partitions in a logical-address space of a process in the IA-32 architecture.

Replacement question: With segmentation in IA-32 architecture, a logical address consists of _____.

Computing systems need cache because

If the starting address location changes, in which of the following cases, the program has to be recompiled?

Describe how a transaction look-aside buffer (TLB) assists in the translation of a logical address to a physical address.

Distinguish between internal and external fragmentation.

Given the logical address 0xAEF9 (in hexadecimal) with a page size of 256 bytes, what is the page number?

Explain why mobile operating systems generally do not support paging.

How are illegal page addresses recognized and trapped by the operating system?

Which of the following is true about dynamic storage allocation?

Fragmentation does not occur in a paging system.

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

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

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?

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

Explain the basic method for implementing paging.

The x86-64 architecture provides support for

Assume the value of the base and limit registers are 1200 and 350 respectively. Which of the following addresses is legal?

A(n) ______ matches the process with each entry in the TLB.

Replacement questions: Briefly describe the memory management scheme of IA-32. How does it differ from the paging memory management scheme in terms of the user's view of memory?

Introduction

Operating-System Structures

Processes

Threads Concurrency

Cpu Scheduling

Synchronization Tools

Synchronization Examples

Deadlocks

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters