Chapter 1
the act of removing unimportant details or attributes of objects in order to construct more general and less complex objects.
What is abstraction?
A data structure that holds information for a process, including the current instruction address, the execution stack, the set of resources used by the process, and the program being executed.
What is the Process Control Block?
A _____ process performs a long-running and generally repetitive task that does not require any intervention from the user.
What is batch
is a segment of code that cannot be entered by a process while another process is executing a corresponding segment of the code.
What is A critical section?
A process is in the this state when the process has all necessary resources and the CPU is actively executing the program's instructions.
What is running?
the act of creating the illusion of having one or more objects with more desirable characteristics than the real object.
What is virtualization?
an instance of a program being executed by an OS.
What is a process
algorithm, also known as FCFS (First-Come-First-Served), schedules processes strictly according to the process arrival time. The earlier the arrival, the higher the priority.
What is FIFO (First-In-First-Out) algorithm?
Multiple processes trying to enter the CS at the same time must not block each other indefinitely.
What is deadlock?
an event that diverts the current execution of a program to a predefined location in the kernel in order to respond to an event.
What is an interrupt?
a technique that keeps several programs active in memory and switches execution among the different programs to maximize the use of the CPU and other resources.
What is multiprogramming?
A process is in this state (or ready) when the process has all necessary resources to run but the CPU is currently unavailable.
What is ready?
______________algorithm, also known as SJN (Shortest Job Next), schedules processes according to the total CPU time requirements. The shorter the required CPU time, the higher the priority.
What is SJF (Shortest Job First) algorithm?
s is a non-negative integer variable that can be accessed using only two special operations, P and V.
What is a semaphore?
consists of all intermediate values held in any CPU registers and hardware flags at the time of the interruption.
What is a CPU state?
the minimal set of functions necessary to manage the system resources safely and efficiently
What is the kernal?
A process is in this state (or blocked) when the process is waiting on a currently unavailable resource.
What is blocked?
algorithm schedules processes according to the remaining CPU time needed to complete the work. The shorter the remaining CPU time, the higher the priority.
What is SRT (Shortest Remaining Time) algorithm?
representative of situations where multiple processes compete for shared resources but each process needs more than one resource at a time.
What is the dining philosopers problem?
algorithm uses a single queue of processes. The priority is determined solely by a process's position within the queue. The process at the head of the queue has the highest priority and is allowed to run for Q time units. When Q ends, the process is moved to the tail of the queue and the next process now at the head of the queue is allowed to run for Q time units.
What is the round-robin (RR) algorithm?
this type of instruction performs critical operations that access I/O devices and the CPU's status and control registers.
What is a privileged instruction?
the transfer of control from one process to another.
What is a context switch?
is the indefinite postponement of a process while other processes are allowed to proceed. Both SJF and SRT can lead to starvation.
What is starvation?
This semaphore can take only the values 0 or 1.
What is a binary semaphore?
algorithm schedules processes according to the shortest remaining time until the deadline. The shorter the remaining time, the higher the priority.
What is the earliest deadline first (EDF)?