Chapter 30

Question 1

What are 3 methods of memory management

Answer 1

1. Dynamic Loading
2. Dynamic Linking
3. Overlays

Question 2

What are 5 types of memory hierarchy

Answer 2

1. Extremely fast, expensive (e.g. registers)
2. Small, Very fast, expensive and volatile cache (e.g. cache)
3. Hundreds of megabytes of medium-speed, medium-price, volatile main memory (e.g. main memory)
4. Hundreds of gigabytes of slow, cheap and non-volatile secondary storage (e.g. secondary storage)
5. Internet storage

Question 3

What is memory management

Answer 3

Keeping track of free used memory space. It is also called free space management.

Question 4

Who do swapping out and swapping in

Answer 4

Memory manager

Question 5

What are the steps of making source code executable

Answer 5

Compile/assembly –> Link –> Load –> Execute

Question 6

What is object code

Answer 6

It is in the form of instruction for machine language

Question 7

What is address binding

Answer 7

Binding instructions and data to memory addresses

Question 8

Does there can be load time, compile time and execution time binding

Answer 8

Yes

Question 9

What is compile time binding

Answer 9

If we know at compile time where the process will reside in memory.

Question 10

What is load time binding

Answer 10

If the location of a process in memory is not known at compile time then it will be load time binding.

Question 11

What is execution time binding

Answer 11

If the process can be moved from one memory region to another during its execution, then it is execution time binding.

Question 12

What is logical address

Answer 12

An address generated by the process/CPU; refers to an instruction or data in the process.

Question 13

What is physical address

Answer 13

An address for a main memory location where instruction or data resides.

Question 14

What is memory management unit (MMU) in CPU

Answer 14

The run-time mapping from logical to physical addresses is done by a piece of the CPU hardware, called the memory management unit (MMU).

Question 15

What is logical address space

Answer 15

Set of logical addresses a process can generate, it lies on logical address space.

Question 16

What is physical address space

Answer 16

The total physical addresses as a result of logical addresses compromise the space of physical address space.

Question 17

Does physical address translated from logical address

Answer 17

Yes

Question 18

What is relocation register

Answer 18

The base register is called the relocation register.

Question 19

What is instruction pointer

Answer 19

In microprocessor, the logical address of the next instruction is specified by the value of instruction pointer (IP).

Question 20

What is dynamic loading

Answer 20

With dynamic loading, a routine is not loaded into the main memory until it is called. So only relevant section of code is loaded when required/called.

Question 21

What are advantages of dynamic loading

Answer 21

• Potentially less time needed to load a program

- Potentially less memory space needed

Question 22

What are disadvantages of dynamic loading

Answer 22

Run-time activity

Question 23

What is static linking

Answer 23

In static linking, system language libraries are linked at compile time.

Question 24

What is dynamic linking

Answer 24

In dynamic linking, linking is postponed until run-time.

Question 25

What is role of stub in dynamic linking

Answer 25

A library call is replaced by a piece of code, called stub, which is used to locate memory-resident library routine.

Question 26

Does gcc compiler generates dynamic linking by default

Answer 26

Yes