exit()
fork()
kill()
wait()
Sequential access
Direct access
Random access
Rotational access
Paging
Segmentation
Fragmentation
Swapping
Contiguous allocation
Linked allocation
Indexed allocation
All of the above
Windows
Linux
RTOS
Android
Kernel
Shell
Memory Manager
Scheduler
Speed up network traffic
Provide file management
Protect against unauthorized network access
Fragment large files
Memory management
Process management
Application software development
File management
Keyboard
Mouse
CPU
Printer
Encryption
Defragmentation
Multi-threading
A network encryption protocol
A program that appears harmless but contains malicious code
A method to speed up I/O operations
A security patch
All services inside the kernel
Minimal services in the kernel and most in user space
Only hardware communication
Extensive service drivers
P1, P2, P3, P1, P1, P1, P1, P1
P1, P2, P3, P1, P1, P1, P1
P1, P2, P3, P1, P1, P1
P2, P3, P1, P1, P1
Deadlock
Buffer overflow
Disk fragmentation
Context switching
Role-based access control
Public key encryption
Digital signatures
Process isolation
The hardware interface layer
The user interface
The core part that manages system resources
A type of application software
High CPU utilization
Low context switching
High context switching overhead
Starvation
Programmed I/O
Interrupt-driven I/O
DMA (Direct Memory Access)
Synchronous I/O
Phishing
Man-in-the-middle
DDoS (Distributed Denial of Service)
Ransomware
Users are given minimal resources
Programs should have minimal access necessary for functioning
Access rights should be least restrictive
No user is privileged in the system
Shortest Job First
Round Robin
First-Come, First-Served
Priority Scheduling
Monolithic
Microkernel
Hybrid kernel
Network kernel
The page is found in memory
The page is not found in memory
There is an I/O operation
The process terminates
Deadlock prevention
Deadlock detection
Deadlock avoidance
Deadlock resolution
LRU
Round-Robin
FIFO
SSTF
Preloaded into memory
Loaded only when needed
Always available in the cache
Not used
Arrange the following scheduling algorithms from lowest to highest priority in terms of process execution speed:
1️⃣ First-Come, First-Served (FCFS)
2️⃣ Round Robin
3️⃣ Shortest Job First (SJF)
4️⃣ Priority Scheduling
1 → 2 → 3 → 4
2 → 1 → 4 → 3
4 → 3 → 1 → 2
3 → 2 → 1 → 4
Seek time
Rotational latency
Transfer time
Disk access time
Best fit
Worst fit
First fit
Low CPU utilization
Long turnaround time
Priority inversion
Backups
Firewalls
Hashing algorithms
Virtual memory
FCFS
SCAN
C-SCAN
Prevention of unauthorized access
Controlled sharing of resources
Efficient CPU usage
Isolation between processes
An illusion of more memory than physically exists
The portion of physical memory that is virtualized
An extension of secondary storage
Used only in distributed systems
CPU scheduling
Resource allocation
Protection policies
Device Manager
File Manager
RAM
ROM
Hard Disk
Cache
Virtual Memory
None of the above
Running
Ready
Terminated
Blocked
Efficient CPU scheduling
Overlapping of input/output and CPU processing
Time-sharing in a multiprogramming system
Mutual exclusion
Circular wait
Hold and wait
Allow circular wait
Allow hold and wait
Request all resources at once
Enable mutual exclusion