CS 4348.0U1 Operating System Concepts Midterm

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/51

flashcard set

Earn XP

Description and Tags

Midterm Study Set

Last updated 3:47 PM on 6/29/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

52 Terms

1
New cards
Operating System
A software program that makes it easier for a user to work on a machine.
2
New cards
Process
An abstraction of a program in execution.
3
New cards
Program
A passive entity stored on disk that becomes a process when executed.
4
New cards
Thread
The basic unit of CPU utilization within a process.
5
New cards
Concurrency
The ability of multiple tasks to make progress during overlapping time periods.
6
New cards
Parallelism
The simultaneous execution of multiple tasks on multiple processors.
7
New cards
Interprocess Communication (IPC)
Mechanisms that allow processes to exchange data and coordinate execution.
8
New cards
Shared Memory
An IPC mechanism where processes communicate through a shared region of memory.
9
New cards
Message Passing
An IPC mechanism where processes exchange messages.
10
New cards
Pipe
An IPC mechanism for communication between processes.
11
New cards
Signal
A software interrupt used to notify a process that an event has occurred.
12
New cards
Scheduler
The operating system component that selects the next process to execute.
13
New cards
New State
The process has been created but is not yet in memory.
14
New cards
Ready State
The process is in memory waiting to be assigned a CPU.
15
New cards
Running State
The process is currently executing on the CPU.
16
New cards
Blocked State
The process is waiting for an event to occur.
17
New cards
Terminated State
The process has completed execution.
18
New cards
Turnaround Time
The total time from process arrival until completion.
19
New cards
Waiting Time
The total time a process spends waiting in the ready queue.
20
New cards
Response Time
The time from process arrival until its first response.
21
New cards
CPU Utilization
The percentage of time the CPU is busy.
22
New cards
Throughput
The number of processes completed per unit time.
23
New cards
First Come First Served (FCFS)
A non-preemptive scheduling algorithm that executes processes in arrival order.
24
New cards
Shortest Job First (SJF)
A scheduling algorithm that selects the process with the shortest CPU burst.
25
New cards
Shortest Remaining Time First (SRTF)
The preemptive version of SJF.
26
New cards
Priority Scheduling
A scheduling algorithm that executes the highest-priority process first.
27
New cards
Round Robin (RR)
A preemptive scheduling algorithm that gives each process a fixed time quantum.
28
New cards
Race Condition
A situation where the result depends on the timing or order of concurrent execution.
29
New cards
Critical Section
A code segment where shared data is accessed.
30
New cards
Mutual Exclusion
Ensuring that only one process or thread enters its critical section at a time.
31
New cards
Lock
A synchronization mechanism that enforces mutual exclusion.
32
New cards
Semaphore
A synchronization primitive used to control access to shared resources.
33
New cards
Binary Semaphore
A semaphore whose value is restricted to 0 or 1.
34
New cards
Counting Semaphore
A semaphore whose value can be any nonnegative integer.
35
New cards
Monitor
A high-level synchronization construct that encapsulates shared data and operations.
36
New cards
Condition Variable
A synchronization object used with monitors for waiting and signaling.
37
New cards
Producer-Consumer Problem
A synchronization problem involving producers generating data and consumers using it.
38
New cards
Dining Philosophers Problem
A classic synchronization problem illustrating deadlock and starvation.
39
New cards
Peterson's Algorithm
A software algorithm that provides mutual exclusion for two processes.
40
New cards
Deadlock
A state in which every process is waiting for an event that can only be caused by another process in the set.
41
New cards
Resource Allocation Graph
A graph used to model processes
42
New cards
Mutual Exclusion Condition
A necessary deadlock condition where at least one resource is non-shareable.
43
New cards
Hold and Wait Condition
A necessary deadlock condition where a process holds resources while requesting more.
44
New cards
No Preemption Condition
A necessary deadlock condition where resources cannot be forcibly taken away.
45
New cards
Circular Wait Condition
A necessary deadlock condition where processes form a circular chain waiting for resources.
46
New cards
Deadlock Prevention
A technique that prevents at least one necessary deadlock condition.
47
New cards
Deadlock Avoidance
A technique that grants resources only if the system remains in a safe state.
48
New cards
Safe State
A state in which there exists an order allowing all processes to complete.
49
New cards
Unsafe State
A state that may lead to deadlock.
50
New cards
Banker's Algorithm
A deadlock avoidance algorithm that checks for a safe state.
51
New cards
Deadlock Detection
A technique used to determine whether a deadlock exists.
52
New cards
Deadlock Recovery
Techniques used to eliminate a detected deadlock.