Operating Systems

Question 1

address binding

Answer 1

the process of mapping a program’s logical addresses to physical addresses in memory

Question 2

application software

Answer 2

Software that performs a specific task for the end user.

Question 3

batch processing

Answer 3

When jobs are bundled into groups and processed automatically for more efficient processing.

Question 4

base register

Answer 4

The starting location of a memory segment used to create a physical address

Question 5

bounds register

Answer 5

The upper limit in memory for a process that defines its ending memory location. Used to prevent a process from accessing another processes memory.

Question 6

context switch

Answer 6

Saving a process state and loading another so multiple processes can share the CPU.

Question 7

CPU scheduling

Answer 7

The OS deciding in what order processes will get access to CPU time

Question 8

demand paging

Answer 8

When pages are loaded as needed to save memory.

Question 9

dumb terminal

Answer 9

Monitor and input device(s) which are connected to a central computer for resources.

Question 10

dynamic partition technique

Answer 10

The OS creates variable-sized partitions at runtime based on each process’s memory request.

Question 11

first-come, first-served (FCFS)

Answer 11

Algorithm that runs processes in the order they are received.

Question 12

fixed partition technique

Answer 12

When memory is divided into fixed size partitions and tasks are assigned one partition per task

Question 13

frame

Answer 13

Fixed sized pieces of memory used in paging systems, which hold pages of virtual memory.

Question 14

logical address

Answer 14

program execution creates logical address which is mapped to physical address

Question 15

mainframe

Answer 15

The central computer that provides needed resources for multiple users.

Question 16

memory management

Answer 16

Strategy for how memory will be used, such as when memory will be given or taken from processes

Question 17

multiprogramming

Answer 17

When programs are ran concurrently to maximize use of resources

Question 18

non-preemptive scheduling

Answer 18

When a process switches to a different state voluntarily — either because it finishes or moves to the waiting state — rather than because another task demands the CPU

Question 19

operating system OS

Answer 19

System that manages the allocation of resources for software and hardware, and provides services to programs.

Question 20

page

Answer 20

a fixed sized part of a virtual address that’s loaded into a memory frame

Question 21

page map table (PMT)

Answer 21

Layout the OS uses to track the mapping between pages and frames

Question 22

page swap

Answer 22

When pages are moved between primary and secondary memory to manage memory space.

Question 23

paged memory technique

Answer 23

A method of managing memory by breaking memory up into fixed sized frames and dividing logical addresses into fixed sized pages and an offset, which are then mapped to the frames to produce a physical address.

Question 24

partition memory management

Answer 24

When memory blocks are divided into partitions and processes are assigned one process per partition

Question 25

physical address

Answer 25

the actual location in computer memory hardware where data is stored

Question 26

preemptive scheduling

Answer 26

When CPU time is given from one process to another due to schedulers policy

Question 27

process

Answer 27

The states and data of the active part of a program

Question 28

process control block (PCB)

Answer 28

Data structure that contains needed data and states for a process

Question 29

process management

Answer 29

operating system coordinating the execution of processes, including their creation, scheduling, and termination

Question 30

process states

Answer 30

The different states a process can be in during its lifecycle, such as new, ready, running, waiting and terminated.

Question 31

real-time system

Answer 31

A system where tasks are given fixed deadlines to produce a guaranteed response.

Question 32

response time

Answer 32

The time it takes for the system to respond to a request.

Question 33

round-robin

Answer 33

A preemptive scheduling method where tasks take evenly timed turns accessing the CPU in rotating order

Question 34

shortest job next (SJN)

Answer 34

Non preemptive method of scheduling tasks where jobs are ordered from shortest to longest completion time.

Question 35

single contiguous memory management

Answer 35

When a process or all processes are placed in a single segment of memory.

Question 36

system software

Answer 36

Foundational software that mediates between application software and hardware.

Question 37

thrashing

Answer 37

Degradation of performance that occurs due to excessive paging.

Question 38

time slice

Answer 38

a fixed, equal amount of CPU time given to each task when using the round robin scheduling algorithm.

Question 39

timesharing

Answer 39

When CPU time is shared between multiple users.

Question 40

turnaround time

Answer 40

The total time from submission to completion for a process.

Question 41

virtual machine

Answer 41

Emulator of a physical computer that has the same functionality as a physical computer.

Question 42

virtual memory

Answer 42

When paging creates the illusion of a large, contigous memory space.