OSOA MIDTERMS
問題一覧
1
refers to an instance of a program that is being executed. A process contains the program code and its current activity, including the program counter, registers, and variables. Processes are fundamental to multitasking operating systems, as they allow multiple programs to run simultaneously
process
2
A process goes through various states during its execution. These states represent different stages of execution, ranging from being idle to actively using the CPU. Here are the common
process states
3
A process is in the _____ state when it is being created. The operating system allocates resources (e.g., memory) for the process during this stage
new
4
The process is loaded into main memory and is ready to run, but it is waiting for the CPU to become available. Processes in the ready state are waiting for scheduling to get CPU time
ready
5
Once a process is given the CPU, it moves to the _______ state. In this state, the process is actively executing instructions
running
6
A process moves to the _________ state if it cannot proceed until some event occurs, such as waiting for input/output (I/O) operations to complete. For example, if a process is waiting for user input, it becomes blocked until that input is provided.
blocked (waiting)
7
Sometimes a process may be __________ from memory to free up space for other processes. The process is still ready or waiting, but it has been moved to secondary storage (like a hard drive). It remains inactive until it's swapped back into main memory.
suspended (swapped out)
8
Once the process has finished executing, it enters the ________ state. All resources used by the process (memory, files, etc.) are released, and the process is removed from the system's
terminated (exit)
9
After being created, the process is admitted into the ready queue
new-ready
10
When the CPU scheduler selects the process for execution, it moves from ______-_____
ready-running
11
If a process is preempted (interrupted to give another process CPU time), it returns to the ready state.
running-ready
12
Once the event the process was waiting for occurs (e.g., I/O completes), the process moves back to the ready state
blocked-ready
13
When a process finishes its execution, it transitions to the terminated state.
running-terminated
14
interact directly with the user, like applications that are currently being used
foreground processes
15
run without user interaction, often performing system maintenance or other tasks (e.g., a virus scan or system update)
background processes
16
A parent process creates one or more child processes. The child processes can execute independently, but the parent can control or monitor them.
parent and child processes
17
is a process that has completed execution but still has an entry in the process table because its parent hasn't yet read its exit status. It is a defunct process that doesn't use resources, but it is still listed in the process table
zombie process
18
occurs when two or more processes are stuck, each waiting for the other to release resources, resultibg in a cycle of dependency and none of the processes being able to proceed
deadlock
19
what are the 4 causes of deadlock
mutual exclusion, hold and wait, no-preemption, circular wait
20
only one process can cause a resource at a time
mutual exclusion
21
process holding resources are waiting for others
hold and wait
22
resources cannot be forcibly taken a process
no-preemption
23
a cycle processes exist where each is waiting for a resource held by another in a cycle
circular wait
24
Methods in preventing deadlocks
eliminate mutual exclusion, avoid hold and wait, allow preemption, prevent circular wait
25
allow resources to be shared by multiple processes
eliminate mutual exclusion
26
require processes to request all necessary resources at once or release held resources before requiring new ones
avoid hold and wait
27
permit the system to forcibly take resources from process when needed
allow preemption
28
impose a total ordering on resource request to avoid circular dependencies between processes
prevent circular wait
29
2 types of deadlock detection
resource allocation graph (rag), wait-for graph (wfg)
30
it represents the current allocation state of the resource and processes
resource allocation graph (rag)
31
uses graph to represents dependecies between process and waiting resources
wait-for graph (wfg)
32
4 Types of Deadlock Recovery
process termination, resource preemption, priority inversion, rollback
33
identifying and terminationg processes involved freeing up resources
process termination
34
complex method used to solved deadlock by identifying and selecting resource involved in deadlock, then suspending the process
resource preemption
35
real time system method that shifts process priorities to avoid deadlocks
priority inversion
36
database system method that resolves deadlocks by reverting transactions to a previous state
rollback
37
The process of handling a computer's memory resources effectively, involving allocation, tracking, and deallocation of memory space to optimize performance and system stability.
memory management
38
Small, fast storage locations in the CPU for temporary data.
registers
39
Faster memory that stores frequently accessed data to speed up processing,
cache
40
Volatile memory for active programs and data
main memory (ram)
41
Non-volatile storage (eg, HDD, SSD) for long-term data.
secondary storage
42
2 types of allocation
contiguous allocation, dynamic allocation
43
Allocating fixed blocks of memory for processes.
contiguous allocation
44
Allocating variable-sized memory blocks based on process needs.
dynamic allocation
45
Fragmentation (2)
external fragmentation, internal fragmentation
46
Free memory is split into small, non-contiguous blocks
external fragmentation
47
Allocated memory blocks may be larger than necessary
internal fragmentation
48
A technique that allows processes to use more memory than is physically available by utilizing disk space as an extension of RAM.
virtual memory
49
Moving processes between main memory and disk to optimize space and enable multitasking
swapping
50
Entire process swapped out
full swapping
51
Only parts of a process swapped out
partial swapping
52
Prevents one process from accessing another process's memory space, ensuring stability and security.
memory protection
53
An automatic memory management technique that identifies and reclaims memory from objects no longer in use, preventing memory leaks.
garbage collection
54
Associating a file or device directly with a portion of memory, allowing programs to interact with memory as if it were a file
memory mapping
55
The range of memory addresses that a process can use, typically isolated for protection and efficiency
address space
56
A hardware component that translates virtual addresses to physical addresses and enforces memory protection.
memory management unit (mmu)
57
Divides memory into fixed-size partitions for process allocation, leading to potential internal fragmentation
fixed partitioning
58
Allocates variable-sized partitions based on process requirements, reducing internal fragmentation but possibly causing external fragmentation
dynamic partitioning
59
Divides memory into fixed-size pages, allowing non-contiguous allocation and eliminating external fragmentation.
paging
60
Combines paging, and segmentation to allow larger processes to run systems with limited physical memory
virtual memory
61
Optimizes memory by moving processes in and out of memory, facilitating multitasking
swapping
62
Enables programs to read from and write to memory as if interacting with files, streamiining file operations
memory mapping
63
Automatically identifies and reclaims memory occupied by unreferenced objects, preventing leaks and managing memory efficiently
garbage collection
64
Allocates memory blocks that are powers of two, splitting larger blocks imo "buddies" when necessary.
buddy system
65
Loads pages into memory only when required, reducing initial load time and optimizing memory usage.
demand paging
66
Techniques aimed at managing the degree of multiprogramming and optimizing page usage to prevent excessive swapping that degrades performance
thrashing prevention
67
A technique to store frequently accessed data in a small, fast memory area to improve access speed.
caching
Operating Systems and Office Automation
Operating Systems and Office Automation
Micah Tajanlangit · 20問 · 1年前Operating Systems and Office Automation
Operating Systems and Office Automation
20問 • 1年前Micah Tajanlangit
engineering measurements
engineering measurements
Micah Tajanlangit · 28問 · 1年前engineering measurements
engineering measurements
28問 • 1年前Micah Tajanlangit
Uts
Uts
Micah Tajanlangit · 27問 · 1年前Uts
Uts
27問 • 1年前Micah Tajanlangit
SAFETY
SAFETY
Micah Tajanlangit · 37問 · 1年前SAFETY
SAFETY
37問 • 1年前Micah Tajanlangit
Engineering measurements 0.2
Engineering measurements 0.2
Micah Tajanlangit · 31問 · 1年前Engineering measurements 0.2
Engineering measurements 0.2
31問 • 1年前Micah Tajanlangit
ENGINEERING DRAWING
ENGINEERING DRAWING
Micah Tajanlangit · 12問 · 1年前ENGINEERING DRAWING
ENGINEERING DRAWING
12問 • 1年前Micah Tajanlangit
eng. measurement endterm
eng. measurement endterm
Micah Tajanlangit · 6問 · 1年前eng. measurement endterm
eng. measurement endterm
6問 • 1年前Micah Tajanlangit
問題一覧
1
refers to an instance of a program that is being executed. A process contains the program code and its current activity, including the program counter, registers, and variables. Processes are fundamental to multitasking operating systems, as they allow multiple programs to run simultaneously
process
2
A process goes through various states during its execution. These states represent different stages of execution, ranging from being idle to actively using the CPU. Here are the common
process states
3
A process is in the _____ state when it is being created. The operating system allocates resources (e.g., memory) for the process during this stage
new
4
The process is loaded into main memory and is ready to run, but it is waiting for the CPU to become available. Processes in the ready state are waiting for scheduling to get CPU time
ready
5
Once a process is given the CPU, it moves to the _______ state. In this state, the process is actively executing instructions
running
6
A process moves to the _________ state if it cannot proceed until some event occurs, such as waiting for input/output (I/O) operations to complete. For example, if a process is waiting for user input, it becomes blocked until that input is provided.
blocked (waiting)
7
Sometimes a process may be __________ from memory to free up space for other processes. The process is still ready or waiting, but it has been moved to secondary storage (like a hard drive). It remains inactive until it's swapped back into main memory.
suspended (swapped out)
8
Once the process has finished executing, it enters the ________ state. All resources used by the process (memory, files, etc.) are released, and the process is removed from the system's
terminated (exit)
9
After being created, the process is admitted into the ready queue
new-ready
10
When the CPU scheduler selects the process for execution, it moves from ______-_____
ready-running
11
If a process is preempted (interrupted to give another process CPU time), it returns to the ready state.
running-ready
12
Once the event the process was waiting for occurs (e.g., I/O completes), the process moves back to the ready state
blocked-ready
13
When a process finishes its execution, it transitions to the terminated state.
running-terminated
14
interact directly with the user, like applications that are currently being used
foreground processes
15
run without user interaction, often performing system maintenance or other tasks (e.g., a virus scan or system update)
background processes
16
A parent process creates one or more child processes. The child processes can execute independently, but the parent can control or monitor them.
parent and child processes
17
is a process that has completed execution but still has an entry in the process table because its parent hasn't yet read its exit status. It is a defunct process that doesn't use resources, but it is still listed in the process table
zombie process
18
occurs when two or more processes are stuck, each waiting for the other to release resources, resultibg in a cycle of dependency and none of the processes being able to proceed
deadlock
19
what are the 4 causes of deadlock
mutual exclusion, hold and wait, no-preemption, circular wait
20
only one process can cause a resource at a time
mutual exclusion
21
process holding resources are waiting for others
hold and wait
22
resources cannot be forcibly taken a process
no-preemption
23
a cycle processes exist where each is waiting for a resource held by another in a cycle
circular wait
24
Methods in preventing deadlocks
eliminate mutual exclusion, avoid hold and wait, allow preemption, prevent circular wait
25
allow resources to be shared by multiple processes
eliminate mutual exclusion
26
require processes to request all necessary resources at once or release held resources before requiring new ones
avoid hold and wait
27
permit the system to forcibly take resources from process when needed
allow preemption
28
impose a total ordering on resource request to avoid circular dependencies between processes
prevent circular wait
29
2 types of deadlock detection
resource allocation graph (rag), wait-for graph (wfg)
30
it represents the current allocation state of the resource and processes
resource allocation graph (rag)
31
uses graph to represents dependecies between process and waiting resources
wait-for graph (wfg)
32
4 Types of Deadlock Recovery
process termination, resource preemption, priority inversion, rollback
33
identifying and terminationg processes involved freeing up resources
process termination
34
complex method used to solved deadlock by identifying and selecting resource involved in deadlock, then suspending the process
resource preemption
35
real time system method that shifts process priorities to avoid deadlocks
priority inversion
36
database system method that resolves deadlocks by reverting transactions to a previous state
rollback
37
The process of handling a computer's memory resources effectively, involving allocation, tracking, and deallocation of memory space to optimize performance and system stability.
memory management
38
Small, fast storage locations in the CPU for temporary data.
registers
39
Faster memory that stores frequently accessed data to speed up processing,
cache
40
Volatile memory for active programs and data
main memory (ram)
41
Non-volatile storage (eg, HDD, SSD) for long-term data.
secondary storage
42
2 types of allocation
contiguous allocation, dynamic allocation
43
Allocating fixed blocks of memory for processes.
contiguous allocation
44
Allocating variable-sized memory blocks based on process needs.
dynamic allocation
45
Fragmentation (2)
external fragmentation, internal fragmentation
46
Free memory is split into small, non-contiguous blocks
external fragmentation
47
Allocated memory blocks may be larger than necessary
internal fragmentation
48
A technique that allows processes to use more memory than is physically available by utilizing disk space as an extension of RAM.
virtual memory
49
Moving processes between main memory and disk to optimize space and enable multitasking
swapping
50
Entire process swapped out
full swapping
51
Only parts of a process swapped out
partial swapping
52
Prevents one process from accessing another process's memory space, ensuring stability and security.
memory protection
53
An automatic memory management technique that identifies and reclaims memory from objects no longer in use, preventing memory leaks.
garbage collection
54
Associating a file or device directly with a portion of memory, allowing programs to interact with memory as if it were a file
memory mapping
55
The range of memory addresses that a process can use, typically isolated for protection and efficiency
address space
56
A hardware component that translates virtual addresses to physical addresses and enforces memory protection.
memory management unit (mmu)
57
Divides memory into fixed-size partitions for process allocation, leading to potential internal fragmentation
fixed partitioning
58
Allocates variable-sized partitions based on process requirements, reducing internal fragmentation but possibly causing external fragmentation
dynamic partitioning
59
Divides memory into fixed-size pages, allowing non-contiguous allocation and eliminating external fragmentation.
paging
60
Combines paging, and segmentation to allow larger processes to run systems with limited physical memory
virtual memory
61
Optimizes memory by moving processes in and out of memory, facilitating multitasking
swapping
62
Enables programs to read from and write to memory as if interacting with files, streamiining file operations
memory mapping
63
Automatically identifies and reclaims memory occupied by unreferenced objects, preventing leaks and managing memory efficiently
garbage collection
64
Allocates memory blocks that are powers of two, splitting larger blocks imo "buddies" when necessary.
buddy system
65
Loads pages into memory only when required, reducing initial load time and optimizing memory usage.
demand paging
66
Techniques aimed at managing the degree of multiprogramming and optimizing page usage to prevent excessive swapping that degrades performance
thrashing prevention
67
A technique to store frequently accessed data in a small, fast memory area to improve access speed.
caching