stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
OS midterm review revised Flashcards | StudBud
Explore
/
OS midterm review revised
67. What is an I/O module?
64. What are reusable resources?
OS midterm review revised
69 terms
·
StudBud Administration
·
4 plays
Imported from external platform
Flashcards
69 cards
F
Practice quiz
P
Host live
L
Questions
69
Answers
1
64. What are reusable resources?
Disk Space
Time Slice
Memory
CPU
2
67. What is an I/O module?
Allocates RAM
Controls CPU operations
Manages device communication
Handles user inputs
3
13. What is multiprogramming?
Programs run one after another
Programs are executed on different cores
Multiple programs run simultaneously
Programs execute in order
4
43. What is the difference between paging and segmentation?
Paging uses non-contiguous memory
Paging uses fixed-size blocks
Segmentation uses variable-sized blocks
Segmentation uses fixed blocks
5
69. What does MTTF mean?
Minimum Task Time Factor
Max Time to Finish
Memory Task Timing Factor
Mean Time to Failure
6
36. What is the difference between a mutex and a binary semaphore?
A mutex can lock multiple resources
A mutex is faster than a semaphore
A mutex is owned by a process, while a semaphore is OS-controlled
A binary semaphore works on multiple processes
7
52. Why is memory management important?
It schedules I/O operations
It improves storage efficiency
It speeds up the CPU
Handles relocation, protection, sharing, and organization
8
62. What is virtual memory in computing?
Memory that is non-volatile
Memory only for permanent storage
Memory that uses disk space as RAM
Memory shared between processes
9
34. What is mutual exclusion?
Ensuring only one process accesses a resource
Running processes in parallel
Allocating memory blocks to processes
Executing the highest-priority process first
10
29. What is a thread?
The smallest unit of execution
A function in a process
A larger process
A memory block
11
55. What is a frame in paging?
A virtual memory block
A cache block
A memory address
A fixed-size block of physical memory
12
58. What is swapping in memory management?
Moving processes between RAM and storage
Managing threads
Exchanging cache blocks
Switching CPU processes
13
56. What is segmentation?
Dividing memory into cache blocks
Dividing memory into fixed-size blocks
Organizing memory by processes
Dividing memory into logical units
14
41. What is internal fragmentation?
Unused memory in cache
Wasted space in I/O devices
Wasted memory between processes
Wasted memory inside allocated blocks
15
44. What is the purpose of compaction in memory management?
Swapping pages to disk
Improving memory speed
Reducing fragmentation
Expanding available memory
16
70. What is the main memory?
Secondary storage
Primary storage for active data
Cache memory
Memory for CPU only
17
47. What does a memory management unit (MMU) do?
Translates virtual addresses to physical addresses
Handles I/O requests
Allocates CPU time
Tracks running processes
18
5. What does a system bus do?
Allocates memory
Executes programs
Connects CPU, memory, and devices
Manages threads
19
16. What is round-robin scheduling?
Assigns equal CPU time to each process
Handles processes with priority
Executes the shortest process first
Executes processes in order
20
1. Which of the following is an element of a computer system?
Hard drive
CPU
Cache
Printer
21
7. What is the purpose of the program counter (PC)?
Manages memory
Holds the address of the next instruction
Processes CPU instructions
Stores data
22
50. What is an absolute address?
A physical memory location
A virtual address
A calculated address
An address in cache
23
61. What is a page frame?
An I/O block
A CPU register
A fixed-size block of physical memory
A virtual memory block
24
53. What is the advantage of unequal-size partitions in fixed partitioning?
Reduces internal fragmentation
Minimizes CPU load
Maximizes external fragmentation
Increases process speed
25
14. What is a process?
A file in the system
A program in execution
A background service
A memory block
26
23. What does preempting a process mean?
Holding the process for I/O
Permanently stopping the process
Temporarily halting it for another process
Terminating the process
27
11. What is the primary objective of OS design?
Task scheduling
Efficiency
Networking
Security
28
35. What is a binary semaphore?
A semaphore that controls CPU usage
A semaphore used for scheduling
A semaphore used for I/O handling
A semaphore that takes values 0 or 1
29
33. What are competing processes?
Processes that cooperate
Processes that share memory
Processes running on multiple CPUs
Processes requiring exclusive resources
30
25. What is the difference between an interrupt and a trap?
Interrupts happen only in user mode
Interrupts are hardware-triggered, traps are software-triggered
Traps are CPU-triggered, interrupts are memory-based
Traps occur due to memory overflow
31
46. What is a page fault?
The CPU halts
Occurs when a required page is not in memory
The page is lost
A memory block is corrupted
32
37. What is a deadlock?
Processes waiting indefinitely for resources
Processes competing for I/O
Processes sharing memory blocks
CPU overload causes failure
33
19. What is a distributed OS?
Manages multiple computers as one system
Handles only I/O tasks
Manages processes on a single machine
Handles multi-core CPUs
34
66. What is a safe state in deadlock terms?
No deadlock can occur
Memory used optimally
Processes never block
CPU allocation maximized
35
54. What does virtual memory do?
Improves CPU performance
Expands available memory beyond physical RAM
Handles I/O scheduling
Increases processing speed
36
60. What is a suspended process?
A completed process
A halted process waiting for an event
A terminated process
A running process
37
22. What is the initial state of a process?
New
Running
Ready
Blocked
38
18. What is multithreading?
Multiple threads execute within a single process
Threads run on multiple CPUs
Threads are stored in cache
Threads are part of the hardware
39
38. What is the banker’s algorithm used for?
CPU load balancing
Memory fragmentation
Process scheduling
Deadlock avoidance
40
68. What is a process image?
Data at base address
Complete set of data for process
A thread stack
A CPU instruction
41
42. What is external fragmentation?
Unused memory in cache
Memory allocated to background tasks
Free memory scattered in non-contiguous blocks
Memory blocks not assigned to processes
42
31. What does a semaphore manage?
Process scheduling
Access to shared resources
Memory allocation
Interrupt handling
43
17. What is a monolithic kernel?
Kernel handles only CPU processes
Services run in user space
User applications handle all services
All OS services run in kernel space
44
59. What does FCFS stand for in process scheduling?
Fastest Completion First
First Come First Serve
First Cache First Swap
First Completed First
45
4. Which memory type is the fastest in the hierarchy?
Main Memory
Secondary Memory
Cache Memory
Auxiliary Memory
46
65. What defines an absolute address?
A relative address
The physical memory location
A non-fixed address
A calculated address
47
15. What does time slicing do?
Handles I/O scheduling
Divides CPU time among processes
Allocates memory equally
Switches between user and kernel modes
48
20. What does an instruction trace show?
The memory allocation log
The sequence of instructions executed
The CPU load
The I/O requests log
49
57. What is the purpose of address binding?
Allocating memory to processes
Sharing memory between processes
Mapping logical to physical addresses
Controlling I/O access
50
8. What does DMA allow?
Allocates CPU time
Executes I/O commands
Devices access memory without CPU
Manages memory in real-time
51
45. What is a virtual address?
A storage address
An address generated by the CPU
A physical memory location
A memory block
52
24. What is process spawning?
Holding a process for execution
Allocating memory
Creating a new process
Terminating a process
53
51. What does the relocation process do?
Adjusts memory addresses for program execution
Handles page faults
Swaps memory blocks
Allocates I/O resources
54
63. How does paging work?
Allocates memory equally
Uses cache to extend RAM
Divides memory into fixed-size blocks
Divides memory by process size
55
48. What does a page table map?
Virtual addresses to physical memory
Processes to threads
Processes to CPU cycles
Programs to memory blocks
56
6. What is a cache miss?
Memory is overloaded
Data is not found in cache
Data is found in memory
Data is corrupted
57
12. What is the kernel of an OS responsible for?
Managing system resources
Displaying user interfaces
Handling web requests
Executing user programs
58
26. What does the Process Control Block (PCB) store?
Process information for the OS
The program's execution state
Instructions for memory allocation
System settings
59
32. What is a race condition?
Processes’ outcomes depend on timing
Processes share memory blocks
Processes run simultaneously
Processes run faster
60
30. Why is thread switching cheaper than process switching?
Threads do not require memory allocation
Processes run independently
Threads share resources
Threads are faster
61
3. What is the purpose of an interrupt?
Schedule tasks
Signal the CPU for attention
Manage memory
Execute I/O
62
10. What is spatial locality?
Storing data on disk
Accessing different memory blocks
Accessing data near recently accessed memory
Prefetching data into cache
63
2. Which register holds the next instruction’s address?
Instruction Register
Memory Register
Stack Pointer
Program Counter
64
28. What does a mode switch involve?
Switching between threads
Starting a new process
Allocating more memory
Switching between user and kernel modes
65
9. What is temporal locality?
Optimizing data access
Re-accessing the same data repeatedly
Accessing different pages
Storing data on disk
66
27. What is the role of a dispatcher?
Handles I/O devices
Switches the CPU to the next process
Allocates memory to the process
Handles interrupts
67
40. How can hold-and-wait be prevented?
Processes run independently
Processes request all resources at once
Processes release all resources
Processes are suspended
68
39. What is one condition for deadlock?
Low CPU usage
High memory fragmentation
Hold and Wait
Preemptive scheduling
69
21. How is a process different from a program?
A program is always running
A process is stored in memory
A process is a system call
A process is a running program
