| Terms |
Definitions |
|
This type of processor scheduling uses a set of priority levels and assigns a level to each process or thread
|
Priority Based: Explicit Priority
|
|
What type of memory exhibits data remanence but is still volitile and data can be lost if power is turned off
|
Static RAM
|
|
Gates - Resulting output opposite the input (also called inverter)
|
NOT
|
|
Which RAID level is considered Striped with Parity
|
RAID 5
|
|
Files and subdirectories can be contained within multiple directories
|
Graph Directory Structure
|
|
Type of register used for addressing a memory location in the code segment of the memory, where the executable program is stored
|
Code Segment Register
|
|
This can execute concurrently on a single processor or simultaneously on multiple processors
|
Thread
|
|
What type of directory structure cannot have more than one parent
|
Heirarchical
|
|
On a disk, this is a wedge shaped piece of the disk and can span multiple tracks
|
Disk Sector
|
|
On a disk, what is one concentric circle
|
Track
|
|
Gates - HIGH output results if both the inputs are LOW
|
NOR
|
|
Type of register that communicates with I/O devices
|
Input / Output Register
|
|
On the CPU, this accesses program instructions and issues appropriate commands to the ALU
|
Control Unit
|
|
Type of register used to hold the address of the next instruction to be executed.
|
Program Counter Register
|
|
Which RAID level is considered Striped and Mirrored
|
RAID 10
|
|
Type of register that holds the instruction while it is being executed
|
Instruction Register
|
|
Small internal storage locations that hold a single instruction or data item in flip flops
|
Register
|
|
What state is the processor in if it is waiting for access to the CPU
|
Ready
|
|
On a disk, this is a set of track sectors
|
Cluster
|
|
Type of register that is used for addressing stack segment of memory - the memory used to store stack data
|
Stack Segment Register
|
|
The allocation policy that always uses the most-recently freed suitable free block.
|
LIFO Ordered First Fit
|
|
Gates - HIGH output results if one or both inputs are HIGH
|
OR
|
|
In this RAID configuration, if one drive is lost, all data is lost
|
RAID 0
|
|
Disk Scheduling Algorithms - After a request, go to the closest request in the work queue, regardless of direction. Starvation is possible
|
SSTF - Shortest Seek Time First
|
|
In which RAID configuration is the capacity of the array reduced by one disk
|
RAID 5
|
|
What type of memory is read-only and can be erased by ultraviolet light and reprogrammed
|
EPROM
|
|
The allocation policy that always uses the least-frequently freed suitable free block
|
FIFO Ordered first fit
|
|
Type of file system where all files share the same namespace
|
File System Directory Structure
|
|
Which is volatile, SRAM or DRAM
|
Both
|
|
What type of directory structure is also called a tree structure
|
Heirarchical
|
|
Disk Scheduling Algorithms - Operations performed in the order requested - no reordering of work queues. No starvation - every request is serviced
|
FCFS - First Come, First Served
|
|
What state is the processor in if the thread has control of the CPU
|
Running
|
|
Disk Scheduling Algorithms - Go from the outside to the inside servicing requests and then back from the inside to the outside. Repeat
|
SCAN
|
|
In which RAID configuration does the capacity of the array = the capacity of the smallest drive in the array
|
RAID 1
|
|
This is also known as concurrent execution or interleaved execution
|
CPU Sharing
|
|
What does RAID stand for
|
Redundant Array of Inexpensive (or Independent) disks
|
|
The allocation policy that searches the free list from the beginning and uses the first free block large enough to satisfy the request
|
First fit
|
|
Type of memory utilizing flip-flops where the circuit remembers its last position
|
Static RAM
|
|
Keeps track of each process by creating and updating a data structure
|
Process Control Block (PCB)
|
|
Type of register that holds the information on its way to and from the main memory
|
Storage Register
|
|
The allocation policy that always allocates the largest free block
|
Worst fit
|
|
Gates - HIGH output results if both inputs are HIGH
|
AND
|
|
This type of processor scheduling always dispatches the ready thread that has been waiting the longest
|
Priority Based: First come, First served
|
|
When does the running state end
|
When the tread or its parent process terminates unexpectedly or an interrupt occurs
|
|
Which RAID level is considered mirrored only
|
RAID 1
|
|
What type of directory structure can share directories
|
Asyclic
|
|
SRAM has three states, what are they
|
Standby, Reading, Writing
|
|
Type of file access method based on a disk model of a file - File is viewed as a numbered sequence of blocks or records
|
Direct Access
|
|
Disk Scheduling Algorithms - Moves inward servicing requests until there are no more requests in that direction, then jumps to the outermost outstanding request
|
C-LOOK
|
|
This can request and receive hardware resources and operating system services
|
Process
|
|
On the CPU, this controls movement of data to and from CPU registers and other hardware components
|
Control Unit
|
|
A flaw in a system or process whereby the output and/or result of the process is unexpectedly and critically dependent on the sequence of timing of other events.
|
Race Condition
|
|
Gates - HIGH output results if both inputs are not HIGH
|
NAND
|
|
On a disk, this is the intersection of a track and a sector
|
Track Sector
|
|
What type of directory structure can use aliasing
|
Asyclic
|
|
The allocation policy that always allocates from the smallest suitable free block. Suitable allocation mechanisms include sequential fit searching for a perfect fit, first fit on a size-ordered free block chain, segregated fits and indexed fits.
|
Best fit
|
|
What type of memory is Flash memory
|
EEPROM
|
|
What type of memory requires a periodic refresh
|
DRAM
|
|
In what type of directory structure is the hard link the same as the original pointer
|
Asyclic
|
|
Which RAID level combines 3 or more disks in a way that protects agains the loss of any one disk
|
RAID 5
|
|
A unit of executing software that is managed independently by the operating system
|
Process
|
|
A blocked thread is waiting for an event to occur
|
Interrupt processing
|
|
Which RAID level has the best input/output performance
|
RAID 0
|
|
Type of register that points to the data segment of the memory where the data resides
|
Data Segment Register
|
|
Type of register that stores the result of the last processing step of the ALU
|
Accumulator Register
|
|
What type of memory is read-only and can be erased by electrical signals and reprogrammed
|
EEPROM
|
|
In which RAID configuration is the data duplicated across every drive in the array providing full redundancy
|
RAID 1
|
|
On a disk, what is a set of matched tracks
|
Cylinder
|
|
Flat circular platters with metallic coatings that are rotated beneath read/write heads
|
Magnetic Disk
|
|
Gates - HIGH output results if both inputs are the same
|
XOR
|
|
Which RAID level is considered Striped only
|
RAID 0
|
|
Type of file access method based on the tape model of a file - it is the most common mode of access of files
|
Sequential Access
|
|
This is the primary pathway for data transmission among hardware components
|
System bus
|
|
Gates - HIGH output results if one and only one of the inputs is HIGH
|
XOR
|
|
What type of memory typically contains one transistor and one capacitor per data bit
|
DRAM
|
|
A portion of a process that can be scheduled and executed independently
|
Thread
|
|
Disk Scheduling Algorithsm - Like SCAN, but stops moving inwards or outwards when no more requests in that direction exists
|
LOOK
|
|
This type of processor scheduling chooses the next process to be dispatches based on the expected amount of CPU time needed to complete the process
|
Priority Based: Shortest time remaining
|
|
This type of processor scheduling guarantees a minimum amount of CPU time to a thread if the thread makes an explicit request when it is created
|
Real-Time Scheduling
|
|
What state is the processor in if the thread is suspended while an interrupt is being processed
|
Blocked
|
|
Used for choosing a free block to satisfy an allocation request
|
Memory allocation policy
|
|
Disk Scheduling Algorithims - Moves inwards servicing requests until it reaches the innermost cylinder, then jumps to the outside cylinder
|
C-SCAN (Circular SCAN)
|
|
What type of memory does not need to be periodically refreshed
|
Static RAM
|
|
On the CPU, this contains electrical circuits that implement each instruction
|
Arithmetic and Logic Unit (ALU)
|
|
Type of register that holds the location of the next piece of data
|
Address Register
|