memory management Flashcards

1
Q

Also known as dynamic partitioning. Only the exact memory space needed by a process is allocated

A

Variable partition memory allocation strategies

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Is a technique wherein only those instructions or data that are currently needed are loaded into main memory

A

Overlaying

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Is a special hardware device used to take care of logical to physical address conversion

A

Memory management unit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Main memory is divided into 8 fixed, but equal-sized partitions of 4MB each

A

Fixed equal-sized partitions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Select the smallest partition that will fit an incoming process

A

Best fit available strategy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

32MB main memory is divided into 8 fixed, but unequal-sized partitions

A

Fixed unequal-sized partitions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

If the sized of partition is larger than the size of the process, it leads to wastage of memory known as

A

Internal fragmentation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

It happens when the available partitions are not big enough to accomodate any waiting process

A

External fragmentation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

the OS searches from the beginning of the main memory. The first hole encountered that is large enough for the incoming process will be selected.

A

First-fit strategy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

The operating system searches the entire list of holes for the smallest hole that can accommodate then incoming
process.

A

Best-fit strategy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

the operating system searches the entire list of holes for the largest hole and this will allocated to the incoming
process.

A

Worst-fit strategy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Strategies used by the operating system in deciding which hole a process will be placed

A

Firs-fit strategy, Best-fit strategy, Worst-fit strategy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Free memory space

A

Hole

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

processes are moved towards the beginning of the main memory. The holes are therefore grouped
together, forming one large block of free memory

A

Compaction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

memory management scheme that allocate the non-contigiuos memory space into process.

A

Paging

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Processes are divide into equal sized of blocks

A

Pages

17
Q

The main memory is divided into equal-sized blocks

A

Frames

18
Q

Solutions from the main problem with external fragmentation

A

Compaction and Paging