OS
In cloud computing, is a ______ cloud available to anyone via the Internet?
Public
Private
Restricted
Hybrid
When structuring the OS using the ______ approach, does it rely on LKM to link additional services?
Monolithic
Layered
Micro-kernel
Modules
When structuring the OS using the ______ approach, are all nonessential components implemented as system programs?
Monolithic
Layered
Micro-kernel
Modules
Can structuring the OS using the ______ approach result in poor performance?
Monolithic
Layered
Micro-kernel
Modules
______ refers to the use of high-speed memory to hold a copy of recently accessed data.
Caching
Speedup
Fetching
Booting
What is the term for the ratio of the speedup with N processors compared to a single processor?
Tipo
Equal
More Than
Less Than
In a system where two or more nodes are running applications and monitoring each other, what is this scenario commonly referred to?
Symmetric
Bot-stand-by
Asymmetric
Client-server
Which system can have only one job (process) in memory at a time?
Batch
Multi-programming
Time-sharing
Multitasking
How is a system described when it consists of physically separate computer systems networked together?
Batch
Multiprocessor
Clustered
Distributed
In which state is a process if it is waiting to be assigned to a processor?
Back
Running
Waiting
Ready
What does context switch save the current context of the current process in?
Stack
Heap
PCB
Queue
In which process is the sending process blocked until the message is received?
Synchronous send
Asynchronous send
Synchronous receive.
Asynchronous receive.
In a multi-threaded process, what do threads not share?
Code
Data
Stack
Files
In which multi-threading model do all other threads block if one thread blocks?
One-to-many
One-to-one
Many-to-one
Many-to-many
What type of thread cancellation allows the target thread to periodically check if it should be canceled?
Asynchronous
Deferred
Thread pool
Implicit thread
What is a segment of code, in which the process may be accessing and updating shared data?
Entry section
Exit section
Critical section
Remainder section
What is a deadlock condition that means at least one resource must be held in a non-shareable mode?
Mutual exclusion
Hold and wait
No preemption
Circular wait
Deadlock... Ensures that at least one of the necessary conditions for a deadlock to occur cannot hold.
Avoidance
Prevention
Detection
Recovery
Which is a non-preemptive CPU scheduling algorithm?
SJF
Priority
FCFS
RR
In CPU scheduling, how can waiting time be calculated by subtracting what from the turnaround time?
Response time
Arrival time
Completion time
Burst time
The priority-based CPU scheduling algorithm suffers from the starvation problem, and one solution is...
Feeding-based recovery
Aging
Synchronization
Preemption
Which algorithm allocates the smallest hole in memory that is big enough to hold the process?
First-fit
Best-fit
Worst-fit
Last-fit
What occurs when the allocated memory is slightly larger than the requested memory?
Overflow
Compaction
Internal fragmentation
External fragmentation
Which memory allocation approach does not suffer from external fragmentation?
Contiguous allocation
Paging
Segmentation
Segmentation with paging
An operating system consists of ... .... And system programs.
A kernel
Application programs
Hardware programs
Firmware programs
... Locates the kernel, loads it into memory, and starts its execution.
The operating system
The bootstrap program
The loader
The dispatcher
........ Refers to reading an instruction from memory and storing it in the CPU's instruction register.
Fetch
Decode
Execute
Encode
...... Ensures that an update to a cache is reflected immediately in other caches.
Cache update
Cache reflection
Cache decoding
Cache coherency
In multiprocessor systems, ....... Means that the failure of one processor will not halt the system.
Increased throughput
Economy of scale
Increased reliability
Workflow
In ........, one node is in hot standby mode, monitoring the active server.
Asymmetric clustering
Symmetric clustering
Asymmetric processing
Symmetric processing
In dual-mode operation, privileged instructions can execute only in
Asymmetric mode
Application mode
Kernel mode
User mode
In ........, the CPU switches between jobs frequently to allow for multitasking.
Batch systems
Multiprogramming systems
Timesharing systems
Bulk systems
........ Is a collection of physically separate computer systems that are networked together.
A distributed system
A cluster system
A multiprocessor system
A multicore system
........ Delivers computing as a service, and users pay based on usage.
Cloud computing
Peer-to-peer computing
Client-server computing
Batch computing
...... Has well-defined, fixed time constraints.
A distributed system
A single-processor system
A multiprocessor system
A real-time system
The operating system provides application programmers with ....... To invoke services.
DMA
RPC
IPC
API
........ System calls support open, close, read, write, reposition file operations.
Process control
File management
Device management
Information maintenance
........ System calls support get time/date and set time/date operations.
Process control
File management
Device management
Information maintenance
Using the ....... Makes the OS difficult to implement and extend.
Monolithic approach
Layered approach
Micro-kernel approach
Hybrid approach
Using the ....... Removes all nonessential components from the kernel and implements them as system programs.
Monolithic approach
Layered approach
Micro-kernel approach
Hybrid approach
In a process, the ....... Contains the temporary variables.
Text section
Data section
Heap section
Stack section
A process is said to be in a ....... State if it is being created.
New
Running
Waiting
Ready
Context switch saves the current context of the current process into its
IPC
RPC
DMA
PCB
A ....... Process shares data with other executing processes.
Independent
Cooperating
Batch
Interactive
....... Contains processes waiting for a certain event to occur.
Ready queue
Wait queue
Device queue
System queue
....... Is a process that can receive messages from a mailbox.
User
Owner
Sender
Receiver
In ....... addressing, both sender and receiver processes must name each other.
Multicore
Cluster
Asymmetric
Symmetric
....... Involves the distribution of tasks across multiple cores.
Data parallelism
Data distribution
Task parallelism
Task distribution
In the one-to-one model, thread management is done by
The operating system
A thread library
RPC mechanisms
IPC mechanisms
In the ....... model, the entire process will block if a thread makes a blocking system call.
Many-to-one
One-to-one
Many-to-many
One-to-many
....... Is a synchronous version of the thread pool.
Blocking send
Blocking receive
Implicit fork-join
Explicit fork-join
In ....... cancellation, the target thread periodically checks whether it should terminate.
Deferred
Cascading
Synchronous
Asynchronous
The ....... Is a segment of code in which the process may be accessing and updating shared data.
Entry section
Exit section
Critical section
Remainder section
....... Is a deadlock condition, and it means that at least one resource must be held in a non-shareable mode.
Mutual exclusion
Hold and wait
No preemption
Circular wait
Deadlock ....... Ensure that at least one of the necessary conditions for a deadlock to occur cannot hold.
Avoidance
Prevention
Detection
Interruption
....... instructions, such as Test-and-Set, execute as one uninterruptible unit.
Blocking
Privileged
Automatic
Atomic
A binary semaphore behaves similarly to
Mutex locks
Race condition
Waiting locks
Signal locks
Process execution ends with a .......
Device burst
I/O burst
CPU burst
Operating system burst
The ....... Gives control of the CPU to the process selected for execution.
CPU scheduler
Dispatcher
Bootstrap program
CPU register
....... Scheduling allows for stopping a running process before it completes its CPU burst.
Preemptive
Non-preemptive
Round-robin
Asynchronous
The ....... Contains the length of the addresses allocated to the process.
Base register
Relocation register
Limit register
Page-table base register
....... Is a contiguous allocation method that produces the smallest leftover hole.
First fit
Best fit
Worst fit
Next fit
Paging divides the physical memory into blocks of the same size called
Pages
Frames
Blocks
Segments
Memory compaction is a possible solution for the ....... problem.
External fragmentation
Internal fragmentation
Swapping
Segmentation
Referencing a page that is not currently in memory results in
A deadlock
A page fault
Page starvation
Page fragmentation
If there is no frame in memory, a ....... Algorithm can be used to select a victim frame.
Page-fault
Page-fragmentation
Page-replacement
Page-starvation
In ....... Frame allocation, the number of memory frames allocated to a process depends on its size.
Equal
Priority
Dynamic
Proportional
....... Processes information in the file in order, one record after the other.
Sequential access
Direct access
Random access
Relative access
The ....... Records information (e.g., name, location, size, and type) for all files on a volume.
Device directory
Volume scanner
File locator
Random-access list
To condense the length of the file access-control list, many systems classify users into owner, group, and
Cooperator
Universe
Coordinator
Subgroup
{"name":"OS", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"In cloud computing, is a ______ cloud available to anyone via the Internet?, When structuring the OS using the ______ approach, does it rely on LKM to link additional services?, When structuring the OS using the ______ approach, are all nonessential components implemented as system programs?","img":"https://www.quiz-maker.com/3012/images/ogquiz.png"}