Home
Explore
Exams
Search for anything
Login
Get started
Home
Operating Systems
Operating Systems
0.0
(0)
Rate it
Studied by 0 people
Call with Kai
Knowt Play
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Card Sorting
1/101
There's no tags or description
Looks like no tags are added yet.
Study Analytics
All Modes
Learn
Practice Test
Matching
Spaced Repetition
Name
Mastery
Learn
Test
Matching
Spaced
No study sessions yet.
102 Terms
View all (102)
Star these 102
1
New cards
2
New cards
Operating System (OS)
Software that manages computer hardware, software resources, and provides services to applications.
3
New cards
Kernel
The core part of the OS that directly interacts with hardware and manages system resources.
4
New cards
System Call
A programmatic way for user applications to request services from the kernel.
5
New cards
Shell
The interface (command-line or GUI) that allows users to interact with the OS.
6
New cards
Process
A running instance of a program with its own memory, resources, and execution context.
7
New cards
Thread
The smallest unit of CPU execution within a process; shares resources with other threads in the same process.
8
New cards
Context Switch
The act of saving a process/thread’s state and loading another’s so the CPU can switch tasks.
9
New cards
Interrupt
A signal to the CPU indicating an event that needs immediate attention.
10
New cards
Trap
A software-generated interrupt, often triggered by an error or a system call.
11
New cards
Bootloader
Small program that loads the operating system into memory when a computer starts.
12
New cards
Scheduling
The method by which the OS decides which process/thread gets CPU time.
13
New cards
Preemptive Scheduling
Scheduling where the OS can interrupt a process to give CPU time to another.
14
New cards
Non-preemptive Scheduling
Scheduling where a process runs until completion or it voluntarily yields.
15
New cards
Round Robin Scheduling
CPU scheduling algorithm giving each process equal time slices in order.
16
New cards
Priority Scheduling
Scheduling based on process priority values.
17
New cards
Multilevel Queue Scheduling
Divides processes into multiple queues, each with different scheduling policies.
18
New cards
Multilevel Feedback Queue
Dynamic scheduling where processes can move between queues based on behavior.
19
New cards
Process Control Block (PCB)
Data structure used by OS to store information about a process (state, registers, etc.).
20
New cards
Process States
Possible states of a process: New, Ready, Running, Waiting, Terminated.
21
New cards
Zombie Process
A process that has completed execution but still has an entry in the process table.
22
New cards
User-Level Threads
Threads managed in user space, invisible to the kernel.
23
New cards
Kernel-Level Threads
Threads managed directly by the OS kernel.
24
New cards
Multithreading
Running multiple threads within the same process concurrently.
25
New cards
Concurrency
Multiple tasks making progress by interleaving execution.
26
New cards
Parallelism
Multiple tasks executing at the exact same time on different cores.
27
New cards
Race Condition
Incorrect behavior that occurs when multiple threads access shared data without synchronization.
28
New cards
Critical Section
Code segment that must not be executed by more than one thread at a time.
29
New cards
Mutex (Mutual Exclusion)
A lock used to prevent multiple threads from accessing a resource at the same time.
30
New cards
Semaphore
Synchronization primitive that controls access to resources by multiple processes/threads.
31
New cards
Monitor
High-level synchronization construct combining mutual exclusion and condition variables.
32
New cards
Deadlock
A situation where processes wait indefinitely for resources held by each other.
33
New cards
Four Coffman Conditions
The necessary conditions for deadlock: Mutual exclusion, Hold and wait, No preemption, Circular wait.
34
New cards
Deadlock Prevention
Strategy that ensures at least one Coffman condition never holds.
35
New cards
Deadlock Avoidance
Strategy where the OS carefully allocates resources to avoid unsafe states.
36
New cards
Banker’s Algorithm
Deadlock avoidance algorithm simulating resource allocation to ensure safety.
37
New cards
Deadlock Detection
Method of checking system state to identify deadlocked processes.
38
New cards
Deadlock Recovery
Terminating or preempting processes/resources to break a deadlock.
39
New cards
Starvation
When a process waits indefinitely due to unfair scheduling.
40
New cards
Livelock
Processes keep changing state in response to each other but make no progress.
41
New cards
Safe State
A system state where at least one sequence of resource allocations avoids deadlock.
42
New cards
Memory Management Unit (MMU)
Hardware that translates virtual addresses to physical addresses.
43
New cards
Paging
Memory management scheme dividing memory into fixed-size pages and frames.
44
New cards
Page Table
Data structure mapping virtual pages to physical frames.
45
New cards
Segmentation
Memory divided into variable-sized segments based on program structure.
46
New cards
Virtual Memory
Illusion of a large, continuous memory space, backed by physical RAM and disk.
47
New cards
Swapping
Moving processes in and out of RAM to disk to manage memory.
48
New cards
Page Fault
An exception when a program accesses a page not currently in RAM.
49
New cards
TLB (Translation Lookaside Buffer)
Cache that speeds up virtual-to-physical address translation.
50
New cards
Demand Paging
Loading pages into memory only when they are needed.
51
New cards
Thrashing
Excessive paging activity that drastically reduces performance.
52
New cards
File System
OS mechanism for storing and organizing data on disks.
53
New cards
File Descriptor
Integer handle used by the OS to access an open file.
54
New cards
Inode
Data structure storing metadata about a file (permissions, size, location).
55
New cards
Directory
A special file that contains references to other files.
56
New cards
Mounting
Attaching a file system to the directory tree.
57
New cards
Journaling File System
File system that logs changes before committing them, ensuring crash recovery.
58
New cards
Block
Smallest unit of storage allocation in a file system.
59
New cards
FAT (File Allocation Table)
File system architecture using a table to map file blocks.
60
New cards
NTFS
File system used by Windows with journaling and metadata support.
61
New cards
EXT4
Popular Linux file system with journaling and large file support.
62
New cards
7. I/O and Devices
63
New cards
Device Driver
Software that allows the OS to interact with hardware devices.
64
New cards
Buffering
Temporarily storing data to smooth out speed mismatches between devices.
65
New cards
Spooling
Queuing data for slow devices like printers.
66
New cards
Polling
Checking device status repeatedly to see if it’s ready.
67
New cards
Interrupt-Driven I/O
Device notifies CPU when it’s ready, reducing busy-waiting.
68
New cards
DMA (Direct Memory Access)
Hardware feature allowing devices to transfer data directly to memory without CPU involvement.
69
New cards
Block Device
Hardware device that stores data in fixed-size blocks (e.g., hard disk).
70
New cards
Character Device
Hardware device that transmits data as a stream (e.g., keyboard).
71
New cards
RAID
Redundant array of independent disks; storage method for redundancy and speed.
72
New cards
SSD vs HDD
SSD uses flash memory (faster, no moving parts), HDD uses spinning disks.
73
New cards
Access Control
Mechanism for defining who can access which resources.
74
New cards
Authentication
Verifying the identity of a user or process.
75
New cards
Authorization
Determining what an authenticated user is allowed to do.
76
New cards
Encryption
Transforming data into an unreadable format to protect it.
77
New cards
Privilege Levels (Rings)
Hardware-enforced levels of execution privilege (e.g., kernel mode vs user mode).
78
New cards
Sandboxing
Isolating applications to limit their access to system resources.
79
New cards
Rootkit
Malicious software that hides its presence by modifying the OS kernel.
80
New cards
Buffer Overflow
Exploit where extra input overwrites memory, often leading to code execution.
81
New cards
SELinux
Linux security module enforcing mandatory access controls.
82
New cards
Trusted Computing Base (TCB)
The set of hardware, software, and controls critical to system security.
83
New cards
Virtualization
Technique of running multiple OS instances on the same physical hardware.
84
New cards
Hypervisor
Software/hardware that manages virtual machines (Type 1 = bare metal, Type 2 = hosted).
85
New cards
Containerization
Lightweight OS-level virtualization (e.g., Docker).
86
New cards
Microkernel
Minimal OS kernel handling only core tasks (IPC, scheduling); rest in user space.
87
New cards
Monolithic Kernel
OS kernel where most services run in kernel mode for speed.
88
New cards
Hybrid Kernel
Combination of monolithic and microkernel designs (e.g., Windows NT).
89
New cards
Exokernel
Minimal OS that gives applications direct control over hardware.
90
New cards
Distributed OS
OS that manages resources across multiple networked computers.
91
New cards
Real-Time OS (RTOS)
OS designed to guarantee deterministic timing for critical applications.
92
New cards
Cloud OS
Operating environment designed for cloud computing platforms.
93
New cards
Throughput
Number of processes completed per unit of time.
94
New cards
Latency
Time taken to complete a single task or request.
95
New cards
Turnaround Time
Total time taken for a process from submission to completion.
96
New cards
Response Time
Time between a request and the first response.
97
New cards
Utilization
Percentage of a system resource being effectively used.
98
New cards
Checkpointing
Saving process state so it can be resumed after failure.
99
New cards
Fault Tolerance
Ability of a system to continue operating despite failures.
100
New cards
Load Balancing
Distributing work evenly across processors or servers.
Load more