Brainscape's Knowledge GenomeTM

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


See full index

2Y1 Pre-Finals > Platform Technology PRE-FINALS > Flashcards

Platform Technology PRE-FINALS Flashcards

1
Q

The functionality of an operating system that manages the primary memory, which includes the movement of processes back and forth between the main and the secondary memory during execution.

A

Memory management

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

Addresses used in a program before and after memory allocation.

A

Symbolic, Relative, and Physical

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

Addresses used in a source code.

A

Symbolic addresses

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

Addresses at the time of compilation.

A

Relative addresses

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

Addresses generated by the loader when a program is loaded into the main memory.

A

Physical address

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

Pertains to a fixed-length block of main memory.

A

Frame

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

Refers to a fixed-length block of data that resides in the secondary memory.

A

Page

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

A variable-length block of data that resides in the secondary memory.

A

Segment

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

A mechanism in which a process can be swapped temporarily out of the main memory to the secondary memory in order to make memory space available for other processes.

A

Swapping

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

This occurs due to the continuous loading and removal of processes in the memory, wherein free memory spaces are broken down into smaller fragments.

A

Fragmentation

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

Occurs when the allotted memory blocks are varying sizes.

A

External fragmentation

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

Occurs when the allotted memory blocks are fixed size, and specific processes need more space or less space than the size of the allotted memory block.

A

Internal fragmentation

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

A volatile memory that provides fast access at a relatively high cost.

A

Main memory

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

Usually a non-volatile memory at a cheaper cost with slower access.

A

Secondary memory

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

The main memory is divided into a number of static partitions at system generation time, wherein a process may be loaded into a partition of equal or greater size.

A

Fixed Partitioning

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

The partitions are created dynamically, wherein each process is loaded into a partition of exactly the same size as the process.

A

Dynamic Partitioning

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

This chooses the block that is closest to the requested size.

A

Best-fit

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

This scans the memory from the beginning and chooses the first available block that is large enough to cater to the process.

A

First-fit

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

This scans the memory from the location of the last placement and chooses the next available block that is large enough to cater to the process.

A

Next-fit

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

The memory is divided into a number of equally sized frames, while each process is divided into a number of equally sized pages of the same length as the frames.

A

Simple Paging

21
Q

Each process is divided into a number of segments, wherein a process is loaded by adding all of its segments into dynamic partitions.

A

Simple Segmentation

22
Q

An abstraction of the main memory, providing processes and the kernel with their own, almost infinite, private view of the main memory.

A

Virtual memory

23
Q

This partitioning method is similar to simple paging, but does not necessarily load all of the pages of the process.

A

Virtual Memory Paging

24
Q

This partitioning method is similar to simple segmentation, but does not necessarily load all the segments of a process.

A

Virtual Memory Segmentation

25
Q

The act of selecting a job or a task that is to be dispatched.

A

Scheduling or process scheduling

26
Q

This queue contains all the processes in the system.

A

Job queue

27
Q

This queue keeps a set of all processes residing in the main memory, ready and waiting to execute.

A

Ready queue

28
Q

This queue contains processes waiting for a device to become available.

A

Device queue

29
Q

Determines which programs are admitted to the system for processing.

A

Long-term scheduling

30
Q

This is invoked whenever an event that may lead to the blocking of the current process occurs.

A

Short-term scheduling

31
Q

This is in charge of handling the swapped-out processes.

A

Medium-term scheduling

32
Q

The interval of time between the submission of a process and its completion.

A

Turnaround time

33
Q

The time from the submission of a request until the response begins to be received.

A

Response time

34
Q

The amount of time required for a process to be executed by the CPU.

A

Burst time

35
Q

The scheduling algorithm also affects the amount of time that a process spends waiting in the ready queue.

A

Waiting time

36
Q

This is the measure of how much work is being performed by the processor.

A

Throughput

37
Q

The percentage of time that the processor is busy.

A

Processor utilization

38
Q

The process priority can be modified dynamically by the scheduler to improve the performance of certain workloads.

A

Priority

39
Q

In the absence of guidance form the user or other system-supplied guidance, processes should be treated the same, and no process should suffer from starvation.

A

Fairness

40
Q

The scheduling algorithm should keep the resources of the system busy.

A

Resource balancing

41
Q

This includes applications that perform heavy compute operations.

A

CPU-bound

42
Q

This includes applications that perform input/output operations.

A

I/O-bound

43
Q

Once a process is in the Running State, it continues to execute until it terminates or it blocks itself to wait for an I/O operation or to request some OS service.

A

Non-preemptive

44
Q

The currently running processes may be interrupted and moved to the Ready State by the OS.

A

Preemptive

45
Q

In this algorithm all incoming processes join the ready queue.

A

First-Come First-Serve (FCFS)

46
Q

This algorithm is easy to implement in batch systems, where the required CPU
time is known in advance.

A

Shortest Job First (SJF)

47
Q

In this algorithm, when a new process with a shorter remaining time joins the
ready queue, the scheduler may preempt the currently running process and
execute the new one.

A

Shortest Remaining Time First (SRTF)

48
Q

This algorithm involves the generation of a clock interrupt at periodic intervals.

A

Round Robin (RR)

49
Q

In general, each system process is assigned with a corresponding priority, and
the scheduler will always choose a process of higher priority.

A

Non-Preemptive Priority (NPP) Scheduling

2Y1 Pre-Finals (1 decks)

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