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