1/157
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
Window Graphing System
A system that implements graphical user interfaces with user interface controls and illustrations.
File Tables
Structures used to hold information about the existence of files.
I/O status information
Information associated with the input/output state.
Interrupts
External events that operate independently.
Application Binary Interface (ABI)
Standard binary portability between programs.
Program counter
The address of the next instruction to be executed.
Job
A single program and a numerous sequenced setup process.
Linux Operating System
A free open-source variant of the UNIX operating system.
Process Control Information
Additional information the operating system needs to control processes.
User Mode
A less-privileged execution mode of an operating system.
Security Reference Monitor
Enforces access validation and audit generation.
I/O tables
Structures that manage input/output devices in a computer system.
Exit State
The state when a process is released from the pool of executable processes.
Multi-programmed Batch System
A system that processes multiple programs simultaneously.
Application Binary Interface
A collection of machine language instructions for binary portability.
True about process attributes
They consist of processor register information.
True about time-sharing systems
They allow multiple users simultaneous access to the system.
True about Android system
It is a Linux-based system originally designed for mobile phones.
Not True about serial processing
It allows the processor to handle multiple jobs simultaneously.
True about a trap in process switching
It relates to errors generated within the currently running process.
Not attributed to a process during program execution
The same identifier to each process.
Not described a process
It is a storage data structure.
True about kernel mode as an execution mode
It allows software to control the processor, its instructions and registers.
True about Windows operating systems
It operates the core OS software separately from application-oriented software.
Not an operating system service as a compiler interface
Management of virtual addresses, physical memory, and paging files.
True about halt instruction in process termination
It generates an interrupt to alert the OS that a process has been completed.
True about simple batch system
They process jobs in bulk.
True about process identification
It involves unique numeric identifiers.
Not an OS function
Extension of system functionality and running background user-mode activity.
Solaris
An operating system that implements a combined approach.
Race Condition
A situation where multiple threads read and write shared data.
Unblocked
This operation moves blocked threads into the ready queue for execution.
Hold and wait
This condition is prevented by requiring all resources simultaneously.
Responsive
Multithreading allows a program to continue running even if some part is blocked.
Resource allocation graph
A tool to characterize resource allocation to processes.
Condition Variable
Used to block a process or thread until a specific condition is met.
Multithreading
The ability of an OS to support concurrent paths of execution within a single process.
Binary semaphore
A semaphore that only takes the values zero and one.
Base Priority
The lower limit of a thread's dynamic priority.
Distributed Processing
The management of multiple processes executing on distributed systems.
Multicore System
Affects application design and performance with multiple threads.
Alert Status
Indicates whether a waiting thread may execute an asynchronous call.
Combined Approach
Runs multiple threads in parallel on multiple processors.
Monitor
A programming construct that encapsulates variables and initialization code.
All Process Threads share the same address space
Where both resources and threads arrangement exist.
Processes may exit while holding resources
Not a restriction in implementing deadlock avoidance.
Ability to communicate with each other
Not an OS concern due to concurrency.
Conflicting needs for resources by processes
Not true about concurrency.
Separated OS software from application
Not true about multithreading.
Aborting external deadlock process
Not a recovery method in deadlock detection.
Counting semaphore
This semaphore takes values greater than one.
Schedule thread whenever a process is blocked
Not a benefit of multithreaded programming.
A resource is not preempted
A condition must be present for deadlock to occur.
They encompass the ability to load multiple runnable programs
Not true about deadlock.
Infinite loop execution
Not true about the monitor mechanism.
Kernel maintains context information for the process
Not true about the combined approach.
Thread management code not needed on the application level
Not an advantage of user-level threads.
Application that processes binary data
Not a multithreaded application.
Web browser displaying images
Not attributed to threads.
Waiting Time
Criterion is the sum of time spent waiting in the ready queue.
Simple paging
Technique that divides memory into equal-sized frames.
Job queue
Contains all processes in the system.
Shortest remaining time first
An algorithm selecting process with smallest execution time.
Execution Time
Time required for process execution by the CPU.
Medium term Scheduler
Handles swapped-out processes in scheduling.
Virtual Memory Paging
Partition method that processes like segmentation without fragmentation.
Round Robin
Algorithm generating clock interrupts at periodic intervals.
Physical Addresses
Generated by the loader when a program is loaded into main memory.
Swapping
Also known as memory compaction.
Throughput
Measures how much work is performed by the processor.
Best-Fit
Placement algorithm choosing the block closest to requested size.
Simple Segmentation
Technique that divides each process into segments.
Virtual Memory
Gives processes and the kernel a private view of main memory.
True about long term Scheduling
Also known as job scheduler.
Not a requirement of memory management
Selecting a task or job to be dispatched.
Shortest remaining time first algorithm
Describes estimated processing time for selection.
NOT virtual memory characteristic
Provides fast access at a relatively high cost.
True about turnaround time
Difference between finish time and arrival time.
Fairness in scheduling
Means processes should be treated the same.
NOT considered a scheduling criterion
The average rate of placement algorithms.
True about response time
Time from request submission until response is received.
NOT TRUE about memory management
It holds data that is not in use.
NOT TRUE about virtual memory segmentation
It is similar to simple paging.
True about dynamic partitioning
It has no internal fragmentation.
True about fixed partitioning
Only produces minimal operating system overhead.
True about simple paging
May cause small amount of internal fragmentation.
Shortest job first algorithm
Best approach to minimize waiting time.
NOT TRUE about process scheduling
Divides CPU time among active processes and threads.
Input/output (I/O) devices
Hardware devices that manage input, deliver output, or process data.
Human-readable devices
Devices that communicate with computer users, like keyboards.
Machine-readable devices
Devices that communicate with electronic equipment, like sensors.
Communication devices
Devices that connect with remote devices, like modems.
Data transfer rate
Amount of digital data moved within a specific time.
Application
Specific use of a device depending on its purpose.
Control complexity
Difficulty level in operating a device.
Unit of transfer
Indicates whether data is transferred as a stream.
Data representation
Encoding scheme used by devices, including character codes.
Error conditions
Nature of errors that occur in I/O devices.
Device controllers
Components that act as interfaces between devices and drivers.
Device driver
Software module that integrates with the operating system.