Module 3

Question 1

How an operating system handles primary memory and moves processes between main memory and disk during execution.

Answer 1

Memory Management

Question 2

Process of mapping from one address space to another.

Answer 2

Address Binding

Question 3

A process is moved between ___ and ___ during its execution.

Answer 3

disk, memory

Question 4

Collection of processes that are waiting to be brought into memory

Answer 4

Job Queue or Input Queue

Question 5

Address Binding where the location of a process is known at compile time

Answer 5

Compile Time Address Binding

Question 6

Address Binding where the location of a process is not known at compile time

Answer 6

Load Time Address Binding

Question 7

Translates the relocatable address to absolute address

Answer 7

Loader

Question 8

Added to the logical address to gain the physical address

Answer 8

Base Address

Question 9

Address Binding where the instructions are now in memory and being processed

Answer 9

Execution Time Address Binding

Question 10

Method that helps OS collect and merge various modules of code and data into a single executable file

Answer 10

Linking

Question 11

The operating system can link system-level libraries in a program that combines them at ___

Answer 11

Load Time

Question 12

Linking that is done during load or run time

Answer 12

Dynamic Linking

Question 13

Used to obtain better memory-space utilization.

Answer 13

Dynamic Loading

Question 14

A ____ is not loaded until it is called and kept on disk in a relocatable load format.

Answer 14

routine

Question 15

Whenever a routine is called, the ________ is called to load the routine into memory and update the program’s address tables.

Answer 15

relocatable linking loader

Question 16

Address generated by the CPU.

Answer 16

Logical Address

Question 17

An address seen by the memory unit.

Answer 17

Physical Address

Question 18

In these address binding, logical and physical addresses are the same.

Answer 18

Compile-Time and Load-Time

Question 19

In this address binding scheme, the logical and physical addresses are different.

Answer 19

Execution-Time

Question 20

The run-time mapping from logical to physical is done by the ___

Answer 20

Memory Management Unit

Question 21

The base register can be substituted for the ____

Answer 21

relocation register

Question 22

Process of reserving a portion of computer memory for the execution of programs and processes.

Answer 22

Memory Allocation

Question 23

The Operating System is partitioned to the ___

Answer 23

Low Memory

Question 24

The user processes is partitioned to the ___

Answer 24

High Memory

Question 25

Memory Allocation technique that doesn't support multiprogramming

Answer 25

Single Partition

Question 26

Oldest technique to put more than one process in the main memory.

Answer 26

Multiple Fixed Partitions

Question 27

In this partitioning, the number of partitions (non-overlapping) in RAM is fixed but the size of each partition may or may not be the same.

Answer 27

Multiple Fixed Partitions

Question 28

In fixed partitions, each partition can only contain ____ process.

Answer 28

One

Question 29

The degree of multiprogramming is bounded by the ____?

Answer 29

Number of Partitions

Question 30

Assigns the first process to the first available partition

Answer 30

First-fit allocation

Question 31

Looks for the process that fits the best in the partition.

Answer 31

Best-fit allocation

Question 32

In this allocation, jobs with a size closest to a partition is assigned to that partition

Answer 32

Best-fit allocation

Question 33

Happens when free memory is broken into little pieces.

Answer 33

Fragmentation

Question 34

It happens after processes cannot be allocated to memory blocks considering their small size and memory blocks remains unused.

Answer 34

Fragmentation

Question 35

____ occurs when a partition is too big for a process.

Answer 35

Internal fragmentation

Question 36

____ occurs when a partition is available, but is too small for any waiting job.

Answer 36

External fragmentation

Question 37

Allocation technique that allows the partition sizes to vary dynamically

Answer 37

Multiple Variable Partitions

Question 38

Large block of available memory

Answer 38

hole

Question 39

The Multiple Variable Partitions again follows the ____ in scheduling processes.

Answer 39

FCFS algorithm

Question 40

Allocate the first hole large enough. This algorithm is generally faster but it tends to exhibit external fragmentation.

Answer 40

First Fit

Question 41

Allocate the smallest hole large enough. This produces the smallest leftover hole but may leave holes that are too small.

Answer 41

Best Fit

Question 42

Allocate the largest hole. This algorithm produces the largest leftover hole but tends to scatter the unused portions over non-contiguous areas of memory.

Answer 42

Worst Fit

Question 43

Process of merging adjacent holes into one larger hole

Answer 43

coalescing

Question 44

T/F Internal fragmentation does not exist in MVT

Answer 44

True

Question 45

Technique that shuffles memory to place all free memory together in one large block.

Answer 45

Compaction

Question 46

Variation of MVT that uses compaction to minimize external fragmentation.

Answer 46

Multiple Relocatable Variable Partitions (MRVT)

Question 47

Process that can minimize external fragmentation.

Answer 47

Multiple Relocatable Variable Partitions or Paging

Question 48

It permits a program’s memory to be non-contiguous allowing the operating system to allocate physical memory whenever possible.

Answer 48

Paging

Question 49

Memory management technique for controlling how a computer or virtual machine's memory resources are shared.

Answer 49

Memory paging

Question 50

Non-physical memory and a section of a hard disk set up to emulate the computer's RAM.

Answer 50

Virtual Memory

Question 51

The portion of the hard disk that acts as physical memory

Answer 51

Page File

Question 52

T/F The memory frame size is EQUAL to the process page size.

Answer 52

True

Question 52

The OS translates logical address into physical address in main memory with the use of a ___

Answer 52

Page Table

Question 52

The OS breaks a processes into ____.

Answer 52

Pages

Question 53

The OS divides main memory into fixed-sized blocks or ___

Answer 53

frames

Question 54

T/F The pages of a process may reside in different frames in main memory.

Answer 54

True

Question 55

Indicates what page the word resides.

Answer 55

Page Number (p)

Question 56

Selects the word within the page.

Answer 56

Page Offset (s)

Question 57

Used as an index into the page table.

Answer 57

Page Number

Question 58

Contains the base address of each page in physical memory.

Answer 58

Page Table

Question 59

This base address is combined with the page offset to get the ____

Answer 59

physical address

Question 60

The page size or frame size is defined by the hardware and is typically a power of ___ between 512 bytes and 16 MB per page.

Answer 60

2

Question 61

The high-order m – n bits of a logical address designate the ___

Answer 61

page number

Question 62

the n lower-order bits designate the

Answer 62

page offset

Question 63

T/F There is no external fragmentation in paging

Answer 63

True

Question 64

T/F It is possible to have internal fragmentation if the memory requirements of a process do not happen to fall on page boundaries.

Answer 64

True

Question 65

In the worst case, a process would need n pages plus one byte. It would result in an ___ of almost an entire frame.

Answer 65

internal fragmentation

Question 66

Memory management technique in which each job is divided into several segments of different sizes.

Answer 66

Segmentation (Duh)

Question 67

T/F Each segment is a different logical address space of the program.

Answer 67

True

Question 68

When a process is executed, its segmentation are loaded into ___.

Answer 68

non-contiguous memory

Question 69

Every segment is loaded into a ___ of available memory.

Answer 69

contiguous block

Question 70

Segmentation works very similar to paging but segments are of ___

Answer 70

variable-length

Question 71

In segmentation, a logical address space is a collection of ___.

Answer 71

Segments

Question 72

The OS maintains a ___ for every process and a list of free memory blocks along with segment numbers, their size and corresponding memory locations.

Answer 72

Segment Map Table

Question 73

For each segment, the table stores the ____ and ____ of a segment.

Answer 73

Starting address and length

Question 74

You can get the physical address of a segment by adding a ___ to the base address

Answer 74

reference/offset

Question 75

If the reference exceeds the physical memory, it results in a ___

Answer 75

Trap