Main Memory

Question 1

Programs must be brought into memory and placed within a _____ in order to run

Answer 1

Process

Question 2

The only storages that the CPU can access directly

Answer 2

Main memory and registers

Question 3

What does the memory unit only see?

Answer 3

Stream of address
Read request / address
Data & write request

Question 4

Main memory can take many cycles which causes ___

Answer 4

Stalls

Question 5

__ sits between main memory and CPU registers

Answer 5

Cache

Question 6

A pair of ___ and ___ define the logic address space

Answer 6

Base and limit registers

Question 7

Programs on disk ready to be brought into memory to execute form an

Answer 7

Input queue

Question 8

Three different stages if address binding

Answer 8

Compile time
Load time
Execution time

Question 9

In compile time, if memory location is known a priori, ___ code can be generated

Answer 9

Absolute

Question 10

Compiled code bind to ___ adrdresses

Answer 10

Relocatable

Question 11

Linker / loader bind relocatable address to _— address

Answer 11

Absolute

Question 12

Address seen by the memory unit

Answer 12

Physical address

Question 13

Logical and ohysical addresses diiffer in terms of

Answer 13

Execution time address binding scheme

Question 14

Hardware device that run time maps virtual to physical address

Answer 14

Memory management unit

Question 15

Value in the ___ is added to every address generated by a user process

Answer 15

Relocation register

Question 16

MS-DOS on intel 80x86 uses how many relocation registers

Answer 16

4

Question 17

User program only deals with what tyoe if addresses

Answer 17

Logical

Question 18

A type of relocation wherein a routine is not loaded until it is called

All routines are kept in relocatable load format

No special support from the OS

Linking is postponed until EXECUTION TIME

Answer 18

Dynamic Linking

Question 19

System libraries and program code combined by the loaded]r into the binary program image

Answer 19

Static linking

Question 20

Small piece of code used to locate appropriate memory resident library routine

It replacesitself with the ADDRESS of the routine and executes the routine

Answer 20

Stub

Question 21

Dynamic linking is useful for system libraries also known as

Answer 21

Shared libraries

Question 22

A process can be swapped temporarily out of a memory and to a ___which is a fat disk large enough to accomodate copies of all memorybimages for all users

Must provide direct access ti these memory images

Answer 22

Backing stores

Question 23

Swapping variant used for priority-based scheduling algorithms

Lower priority is swapped iut by higher priority

Answer 23

Roll out roll in

Question 24

Major part of swao time is __

Answer 24

Transfer time

Question 25

System maintains a __- of ready ti run oricesses which have memory images on disk

Answer 25

Ready queue

Question 26

In this type of allocation, the memory is partitioned into two parts

Answer 26

Contiguous allocation

Question 27

In contiguous allocation, the memory is partitioned into

Answer 27

OS (low memory)
User processes (high memory)

Question 28

Used to protect user processes from each other

Answer 28

Relocation register

Question 29

This type of fragmentation states that the total memory soace exists to SATISFY A REQUEST

Answer 29

External fragmentation

Question 30

In this type of fragmentation, allocated memory be slightly LARGER THAN REQUESTED MEMORY

size difference is memory internal to a partition but not being used

Answer 30

Intenal frag

Question 31

According tobthis rule, first fit analysis reveals that given N blocks allocated, 0.5N blocks lost to fragmentation

1/3 may be unusable

Answer 31

50 percent rule

Question 32

A way to reduce external fragmentation by shuffling memory contents to place all free memory together in one large block

Answer 32

Compactin

Question 33

A memory management scheme that supports user view of memory

Answer 33

Segmentation

Question 34

Maps 2D ohysicall addresses

Answer 34

Segment table

Question 35

Points to the segment tabke’s location memory

Answer 35

Segment tabke base register

Question 36

Indicates number of segments used by a orogram

Answer 36

Segment table length register

Question 37

If validation bit == 0 then

Answer 37

Illegal statement

Question 38

Allows physical address soace of a process to not be contiguous

Process is allotted to memory whenever it is available

Avoids EXTERNAL fragmentation and problem of varying sized memory chunks

Answer 38

Paging divides ohysical memory into FIXED SIZED BLOCKS called

Question 39

Frames

Answer 39

Pages divide LOGICAL MEMORY INTO BLOCKS OF SAME SIZE CALLED

Question 40

Pages

Answer 40

Translate logical to physical address

Question 41

Page table

Answer 41

Addres generated by the CPU is divided into 2