Platform Technology PRE-FINALS

Question 1

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.

Answer 1

Memory management

Question 2

Addresses used in a program before and after memory allocation.

Answer 2

Symbolic, Relative, and Physical

Question 3

Addresses used in a source code.

Answer 3

Symbolic addresses

Question 4

Addresses at the time of compilation.

Answer 4

Relative addresses

Question 5

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

Answer 5

Physical address

Question 6

Pertains to a fixed-length block of main memory.

Answer 6

Frame

Question 7

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

Answer 7

Page

Question 8

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

Answer 8

Segment

Question 9

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.

Answer 9

Swapping

Question 10

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

Answer 10

Fragmentation

Question 11

Occurs when the allotted memory blocks are varying sizes.

Answer 11

External fragmentation

Question 12

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.

Answer 12

Internal fragmentation

Question 13

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

Answer 13

Main memory

Question 14

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

Answer 14

Secondary memory

Question 15

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.

Answer 15

Fixed Partitioning

Question 16

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

Answer 16

Dynamic Partitioning

Question 17

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

Answer 17

Best-fit

Question 18

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

Answer 18

First-fit

Question 19

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.

Answer 19

Next-fit

Question 20

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.

Answer 20

Simple Paging

Question 21

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

Answer 21

Simple Segmentation

Question 22

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

Answer 22

Virtual memory

Question 23

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

Answer 23

Virtual Memory Paging

Question 24

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

Answer 24

Virtual Memory Segmentation

Question 25

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

Answer 25

Scheduling or process scheduling

Question 26

This queue contains all the processes in the system.

Answer 26

Job queue

Question 27

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

Answer 27

Ready queue

Question 28

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

Answer 28

Device queue

Question 29

Determines which programs are admitted to the system for processing.

Answer 29

Long-term scheduling

Question 30

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

Answer 30

Short-term scheduling

Question 31

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

Answer 31

Medium-term scheduling

Question 32

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

Answer 32

Turnaround time

Question 33

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

Answer 33

Response time

Question 34

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

Answer 34

Burst time

Question 35

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

Answer 35

Waiting time

Question 36

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

Answer 36

Throughput

Question 37

The percentage of time that the processor is busy.

Answer 37

Processor utilization

Question 38

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

Answer 38

Priority

Question 39

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.

Answer 39

Fairness

Question 40

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

Answer 40

Resource balancing

Question 41

This includes applications that perform heavy compute operations.

Answer 41

CPU-bound

Question 42

This includes applications that perform input/output operations.

Answer 42

I/O-bound

Question 43

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.

Answer 43

Non-preemptive

Question 44

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

Answer 44

Preemptive

Question 45

In this algorithm all incoming processes join the ready queue.

Answer 45

First-Come First-Serve (FCFS)

Question 46

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

Answer 46

Shortest Job First (SJF)

Question 47

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.

Answer 47

Shortest Remaining Time First (SRTF)

Question 48

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

Answer 48

Round Robin (RR)

Question 49

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

Answer 49

Non-Preemptive Priority (NPP) Scheduling