Question 1

A __________ is a variable length block of data that resides in secondary memory.

Accepted Answer

segment

Question 2

The __________ shows the frame location for each page of the process.

Accepted Answer

page table

Question 3

All segments of all programs must be of the same length.

Accepted Answer

A) True 
 B)False  False

Question 4

One technique for overcoming external fragmentation is __________ .

Accepted Answer

A)  loading 
B)  compaction 
C)  relocation 
D)  partitioning 
A)  loading 
B)  compaction 
C)  relocation 
D)  partitioning

Question 5

In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and chooses the next available block that is large enough to satisfy the request is called __________ .

Accepted Answer

A)  last-fit 
B)  best-fit 
C)  next-fit 
D)  first-fit 
A)  last-fit 
B)  best-fit 
C)  next-fit 
D)  first-fit

Question 6

As time goes on, memory becomes more and more fragmented and memory utilization declines, creating a phenomenon referred to as _________ .

Accepted Answer

external f

Question 7

Main memory divided into a number of equal size frames is the __________ technique.

Accepted Answer

A)  simple paging 
B)  dynamic partitioning 
C)  fixed partitioning 
D)  virtual memory segmentation 
A)  simple paging 
B)  dynamic partitioning 
C)  fixed partitioning 
D)  virtual memory segmentation

Question 8

A fixed length block of data that resides in secondary memory is a __________ .

Accepted Answer

The answer of A fixed length block of data that...

Question 9

A compromise to overcome the disadvantages of fixed partitioning and dynamic partitioning is the __________ .

Accepted Answer

The answer of A compromise to overcome the disadvantages of...

Question 10

The chunks of a process are known as __________ .

Accepted Answer

A)  pages 
B)  addresses 
C)  frames 
D)  segments 
A)  pages 
B)  addresses 
C)  frames 
D)  segments

Question 11

The memory protection requirement must be satisfied by the operating system rather than the processor.

Accepted Answer

A) True 
 B)False

Question 12

_________ in a computer system is organized as a linear, or one-dimensional, address space, consisting of a sequence of bytes or words.

Accepted Answer

The answer of _________ in a computer system is organized...

Question 13

Countermeasures to defend systems against attacks can be classified into two categories: compile-time defenses and _________ .

Accepted Answer

The answer of Countermeasures to defend systems against attacks can...

Question 14

A physical address is the location of a word relative to the beginning of the program and the processor translates that into a logical address.

Accepted Answer

A) True 
 B)False

Question 15

Secondary memory provides fast access at relatively high cost.

Accepted Answer

A) True 
 B)False

Question 16

In a system employing a segmentation scheme for memory management wasted space is due to _________ .

Accepted Answer

A)  external fragmentation 
B)  frames of different sizes 
C)  internal fragmentation 
D)  segments of different sizes 
A)  external fragmentation 
B)  frames of different sizes 
C)  internal fragmentation 
D)  segments of different sizes

Question 17

In the Dynamic Partitioning technique of memory management, the placement algorithm that chooses the block that is closest in size to the request is called __________ .

Accepted Answer

A)  first-fit 
B)  best-fit 
C)  last-fit 
D)  next-fit 
A)  first-fit 
B)  best-fit 
C)  last-fit 
D)  next-fit

Question 18

Overlay programming wastes programmer time.

Accepted Answer

A) True 
 B)False

Question 19

A __________ can occur as a result of a programming error when a process attempts to store data beyond the limits of a fixed-sized buffer and consequently overwrites adjacent memory locations.

Accepted Answer

The answer of A __________ can occur as a result...

Question 20

Any protection mechanism must have the flexibility to allow several processes to access the same portion of main memory.

Accepted Answer

A) True 
 B)False

A __________ is a variable length block of data that resides in secondary memory.

The __________ shows the frame location for each page of the process.

All segments of all programs must be of the same length.

One technique for overcoming external fragmentation is __________ .

In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and chooses the next available block that is large enough to satisfy the request is called __________ .

As time goes on, memory becomes more and more fragmented and memory utilization declines, creating a phenomenon referred to as _________ .

Main memory divided into a number of equal size frames is the __________ technique.

A fixed length block of data that resides in secondary memory is a __________ .

A compromise to overcome the disadvantages of fixed partitioning and dynamic partitioning is the __________ .

The chunks of a process are known as __________ .

The memory protection requirement must be satisfied by the operating system rather than the processor.

_________ in a computer system is organized as a linear, or one-dimensional, address space, consisting of a sequence of bytes or words.

Countermeasures to defend systems against attacks can be classified into two categories: compile-time defenses and _________ .

A physical address is the location of a word relative to the beginning of the program and the processor translates that into a logical address.

Secondary memory provides fast access at relatively high cost.

In a system employing a segmentation scheme for memory management wasted space is due to _________ .

In the Dynamic Partitioning technique of memory management, the placement algorithm that chooses the block that is closest in size to the request is called __________ .

Overlay programming wastes programmer time.

A __________ can occur as a result of a programming error when a process attempts to store data beyond the limits of a fixed-sized buffer and consequently overwrites adjacent memory locations.

Any protection mechanism must have the flexibility to allow several processes to access the same portion of main memory.

Computer Systems Overview

Operating System Overview

Process Description and Control

Threads

Concurrency: Mutual Exclusion and Synchronization

Concurrency: Deadlock and Starvation

Virtual Memory

Uniprocessor Scheduling

Multiprocessor and Real-Time Scheduling

Io Management and Disk Scheduling

File Management

Embedded Operating Systems

Computer Security Threats

Computer Security Techniques

Distributed Processing, Clientserver, and Clusters

Network Protocols

Distributed Process Management

Filters

Exam 7: Memory Management

A __________ is a variable length block of data that resides in secondary memory.

The __________ shows the frame location for each page of the process.

All segments of all programs must be of the same length.

One technique for overcoming external fragmentation is __________ .

In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and chooses the next available block that is large enough to satisfy the request is called __________ .

As time goes on, memory becomes more and more fragmented and memory utilization declines, creating a phenomenon referred to as _________ .

Main memory divided into a number of equal size frames is the __________ technique.

A fixed length block of data that resides in secondary memory is a __________ .

A compromise to overcome the disadvantages of fixed partitioning and dynamic partitioning is the __________ .

The chunks of a process are known as __________ .

The memory protection requirement must be satisfied by the operating system rather than the processor.

_________ in a computer system is organized as a linear, or one-dimensional, address space, consisting of a sequence of bytes or words.

Countermeasures to defend systems against attacks can be classified into two categories: compile-time defenses and _________ .

A physical address is the location of a word relative to the beginning of the program and the processor translates that into a logical address.

Secondary memory provides fast access at relatively high cost.

In a system employing a segmentation scheme for memory management wasted space is due to _________ .

In the Dynamic Partitioning technique of memory management, the placement algorithm that chooses the block that is closest in size to the request is called __________ .

Overlay programming wastes programmer time.

A __________ can occur as a result of a programming error when a process attempts to store data beyond the limits of a fixed-sized buffer and consequently overwrites adjacent memory locations.

Any protection mechanism must have the flexibility to allow several processes to access the same portion of main memory.

Computer Systems Overview

Operating System Overview

Process Description and Control

Threads

Concurrency: Mutual Exclusion and Synchronization

Concurrency: Deadlock and Starvation

Virtual Memory

Uniprocessor Scheduling

Multiprocessor and Real-Time Scheduling

Io Management and Disk Scheduling

File Management

Embedded Operating Systems

Computer Security Threats

Computer Security Techniques

Distributed Processing, Clientserver, and Clusters

Network Protocols

Distributed Process Management

Filters