Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

OS > Module 3 > Flashcards

Module 3 Flashcards

1
Q

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

A

Memory Management

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

Process of mapping from one address space to another.

A

Address Binding

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

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

A

disk, memory

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

Collection of processes that are waiting to be brought into memory

A

Job Queue or Input Queue

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

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

A

Compile Time Address Binding

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

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

A

Load Time Address Binding

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

Translates the relocatable address to absolute address

A

Loader

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

Added to the logical address to gain the physical address

A

Base Address

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

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

A

Execution Time Address Binding

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

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

A

Linking

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

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

A

Load Time

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

Linking that is done during load or run time

A

Dynamic Linking

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

Used to obtain better memory-space utilization.

A

Dynamic Loading

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

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

A

routine

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

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

A

relocatable linking loader

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

Address generated by the CPU.

A

Logical Address

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

An address seen by the memory unit.

A

Physical Address

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

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

A

Compile-Time and Load-Time

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

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

A

Execution-Time

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

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

A

Memory Management Unit

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

The base register can be substituted for the ____

A

relocation register

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

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

A

Memory Allocation

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

The Operating System is partitioned to the ___

A

Low Memory

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

The user processes is partitioned to the ___

A

High Memory

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

Memory Allocation technique that doesn’t support multiprogramming

A

Single Partition

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

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

A

Multiple Fixed Partitions

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

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.

A

Multiple Fixed Partitions

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

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

A

One

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

The degree of multiprogramming is bounded by the ____?

A

Number of Partitions

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

Assigns the first process to the first available partition

A

First-fit allocation

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

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

A

Best-fit allocation

32
Q

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

A

Best-fit allocation

33
Q

Happens when free memory is broken into little pieces.

A

Fragmentation

34
Q

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

A

Fragmentation

35
Q

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

A

Internal fragmentation

36
Q

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

A

External fragmentation

37
Q

Allocation technique that allows the partition sizes to vary dynamically

A

Multiple Variable Partitions

38
Q

Large block of available memory

A

hole

39
Q

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

A

FCFS algorithm

40
Q

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

A

First Fit

41
Q

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

A

Best Fit

42
Q

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

A

Worst Fit

43
Q

Process of merging adjacent holes into one larger hole

A

coalescing

44
Q

T/F
Internal fragmentation does not exist in MVT

A

True

45
Q

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

A

Compaction

46
Q

Variation of MVT that uses compaction to minimize external fragmentation.

A

Multiple Relocatable Variable Partitions (MRVT)

47
Q

Process that can minimize external fragmentation.

A

Multiple Relocatable Variable Partitions or Paging

48
Q

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

A

Paging

49
Q

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

A

Memory paging

50
Q

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

A

Virtual Memory

51
Q

The portion of the hard disk that acts as physical memory

A

Page File

52
Q

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

A

True

52
Q

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

A

Page Table

52
Q

The OS breaks a processes into ____.

A

Pages

53
Q

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

A

frames

54
Q

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

A

True

55
Q

Indicates what page the word resides.

A

Page Number (p)

56
Q

Selects the word within the page.

A

Page Offset (s)

57
Q

Used as an index into the page table.

A

Page Number

58
Q

Contains the base address of each page in physical memory.

A

Page Table

59
Q

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

A

physical address

60
Q

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.

A

2

61
Q

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

A

page number

62
Q

the n lower-order bits designate the

A

page offset

63
Q

T/F
There is no external fragmentation in paging

A

True

64
Q

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

A

True

65
Q

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

A

internal fragmentation

66
Q

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

A

Segmentation (Duh)

67
Q

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

A

True

68
Q

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

A

non-contiguous memory

69
Q

Every segment is loaded into a ___ of available memory.

A

contiguous block

70
Q

Segmentation works very similar to paging but segments are of ___

A

variable-length

71
Q

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

A

Segments

72
Q

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

A

Segment Map Table

73
Q

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

A

Starting address and length

74
Q

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

A

reference/offset

75
Q

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

A

Trap

OS (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions