Chapter 32 Flashcards

1
Q

What are 2 techniques for contiguous memory allocation for a process

A
  1. MVT

2. MFT

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

What are 2 issues in MFT

A
  1. Waist memory space

2. Load time address binding

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

How waist memory space

A

It can be from 2 ways.

  1. At a time one process takes place. The rest of memory other than process occupies remains waist. It is also known as internal fragmentation.
  2. It is possible whole partition is being wasted. It is because a process goes to according to its size into memory partition and there might be no such a process that falls on a specific memory partitions. Thus, it will remain useless.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Does MVT have internal fragmentation or external fragmentation

A

External fragmentation

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

Does MVT have dynamic address binding

A

Yes

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

What is external fragmentation

A

We have holes in memory because of multiple processes come and go and we have enough space to load a new process but could not load because space is not contiguous. Then it is called external fragmentation. e.g. there are 3 holes 100k, 200k and 300k respectively. And we have a new process of 310k then we can not load it although we have 600k overall space in holes but it is not contiguous.

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

What is compact / de fragmentation of memory

A

Making all memory in one place to make it contiguous

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

What is memory move

A

Moving process to in and out in de fragmentation process is called memory move.

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

What is paging

A

Latest memory techniques like virtual memory uses paging. Divide physical memory into fixed-size blocks called frames. Divide logical memory into blocks of the same size, called pages.

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

What is typical page size

A

1k - 6k

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

Does size of a page power of 2

A

Yes

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

What is the relationship between pages and frames

A

Program pages loads into frames

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

What is page table

A

Keep track of a program’s pages in the main memory by using the page table.

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