Operating Systems – Key Vocabulary

Fifty vocabulary flashcards summarizing foundational operating-system concepts, terms, and mechanisms drawn from the lecture notes.

Virtual Memory

It is the separation of user logical memory from physical memory.

the system becomes like FCFS

If the quantum is made too long in a Round Robin scheduling:

Stack

Analogy: Data Section : Global Variables <==> ________________: Temporary Data

Compaction

A memory management where all jobs are migrated to the end of the RAM.

Copy-on-Write Fork

The sense behind ________________ is that pages for a parent job do not have to be actually duplicated for the child until one or the other jobs changes the page

I/O Ports

A network engineer purchases a brand new hard disk drive for his computer It was attached to his system as part of the local storage and are accessed through ________________

Context Switch

When the CPU changes to another process, the system must preserve the previous process's state and load it into the new process through a ________________

Encapsulation

Which of the following is not a solution of External Fragmentation?

Hold-and-Wait

A condition to determine deadlock, where process do not release previously granted resources while waiting for pending requests to be granted.

Ready Queue

A ________________ is a selection of all processes in main memory that are ready to run.

Processes A, B, C, D, E are all safe

Consider a system with five processes, and three resource types X, Y, Z. Resource type X has 7 instances, Y has 2, and Z has 6. 21 (Given Allocation and Request tables). Which of the following is true?

Direct Memory Access

Without the use of the CPU, the device controller moves data blocks from buffer storage to main memory. This is referred to as ________________

File Server

In a client-server architecture, a ________________ system offers an interface for clients to store and retrieve files.

Permissions

: A collection of access rights, each of which is an ordered pair

Tasks

Analogy: Windows: Threads | Linux: ________________

Logical Address

It is an address generated by the CPU.

12

Consider the following page-reference string: 1, 2, 3, 4, 2, 1, 5, 5, 6, 2, 1, 2, 2, 3. How many page faults would occur for FIFO replacement algorithm, assuming one frame. The frame is initially empty.

Fragmentation

A situation in the Main Memory where the free memory is splitted into small pieces, where none of which is sufficient enough to satisfy the next memory request.

Ethernet

Network Attached Storage (NAS) connects different storage devices to different computer systems using ________________

Linux, Unix, MAC OS X

: PThreads are usually used by which Operating Systems?

Compaction

It is a process in which the free space is collected in a large memory chunk to make some space available for processes

Compute Server

In a client-server architecture, a ________________ system provides an interface for clients to request services, similar to a database system.

Linked Allocation

A file allocation methods that solves the problem of contiguous allocation that contains a pointer to the first and last blocks of the file.

Deadlock

A situation where in a waiting process may never change its state.

Distributed System

A collection of processors that do not share memory or a clock

Stack Algorithms

Except FIFO, Least Recently Used (LRU) and Optimal Page replacement are types of ________________

Program Counter

A ________________ specifies the position of the next instruction to execute in a single-threaded process.

Dynamic-Link Library (DLL)

Device drivers are usually made up of ________________ file type.

P2

(Given a table of processes with arrival times and CPU times) What is the second (2nd) process that will complete if a Round-Robin algorithm using a time quantum equal to 2 millisecond is used?

Segmentation

It is a memory management technique in which, the memory is divided into the variable size parts.

Process

Analogy: Program: Passive Entity <==> ________________: Active Entity

Foreground

It's a type of process that can be controlled using a graphical user interface or a user interface.

8.25 ms

(Given a table of processes with arrival times and CPU times) what is the average turnaround time if Non-pre-emptive Shortest Job First algorithm is used?

code, data, files

Which of the following are shared among multiple threaded processes?

Discovery Protocol

Broadcast request for service and respond to requests for service peer-to-peer communication is possible via ________________

5.5 ms

(Given a table of processes with arrival times and CPU times) What is the average waiting time if FCFS scheduling algorithm is used?

Stack

Least Recently Used is said to be a better page replacement algorithm and are mostly used. In reality, this is implemented using ________

Deadlock

This takes place when two or more processes are waiting indefinitely for an event that can be caused by only one of the waiting processes.

Dynamic Memory Allocation

storing memory allocated dynamically during program runtime.

9

(Given a scenario with 3 processes A, B, C with specific arrival times, CPU times, and priorities) At what time does process A complete if the process-scheduling algorithm is priority scheduling...

Paging

It mainly deals with conversion from logical to physical address

Critical Section

It is the segment code in threads in which threads may be changing common variables.

Partition

A network engineer needs to perform formatting on a brand new hard drive to assign ________________ on the disk prior to Operating Systems installation

POSIX Pthreads, Windows Threads, Java Threads

Which of the following are performed by a user-level threads libraries?

registers, Program Counter, stack

Which of the following are unique among multiple threaded processes?

Virtual Memory

: ________________ enables the operation of programs that do not fit entirely in memory.

Background

It's a kind of process that runs in memory but isn't visible on the screen.

CPU Scheduler

The ________________ chooses one of the available processes for the CPU core's next execution.

Lock-Key Scheme

A compromise between the access list and capability is ________________ lists in OS protection.

Cache Coherency

________________ in hardware is required in a multiprocessor system so that all CPUs have the most current value in their cache.