Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
glossary [2016/05/29 19:00] ex_writer |
glossary [2016/06/05 16:15] (current) ex_writer [B] |
||
|---|---|---|---|
| Line 15: | Line 15: | ||
| === B === | === B === | ||
| - | **BCD**: | + | **Binary-coded decimal (BCD)**: "A class of binary encodings of decimal numbers where each decimal digit is represented by a fixed number of bits, usually four or eight." The Bally Arcade uses packed BCD, meaning that each nibble of a byte holds a decimal digit between 0–9 (e.g., $36 = 37D). Numbers between $A–F are considered invalid. ([[wp>Binary-coded decimal]]) |
| **Bootstrap**: A program that coordinates the minimum amount of necessary peripherals to load a larger program into the computer. (SC:113) | **Bootstrap**: A program that coordinates the minimum amount of necessary peripherals to load a larger program into the computer. (SC:113) | ||
| Line 33: | Line 33: | ||
| **Dope vector**: | **Dope vector**: | ||
| - | "A data structure used to hold information about a data object, e.g. an array, especially its memory layout...The dope vector includes an identifier, a length, a parent address, and a next child address."\\ **Source:** [[wp>Dope vector]] | + | "A data structure used to hold information about a data object, e.g. an array, especially its memory layout...The dope vector includes an identifier, a length, a parent address, and a next child address." ([[wp>Dope vector]]) |
| ---- | ---- | ||
| - | === E === | ||
| - | **Endian**: | ||
| - | |||
| - | ---- | ||
| === F === | === F === | ||
| Line 48: | Line 44: | ||
| **Flag**: A bit attached to a word for identification or for the purpose of signaling some condition. Typical microprocessors include carry, zero, sign, overflow, and half-carry status flags. (SC:326) | **Flag**: A bit attached to a word for identification or for the purpose of signaling some condition. Typical microprocessors include carry, zero, sign, overflow, and half-carry status flags. (SC:326) | ||
| - | **Framebuffer**: A framebuffer (frame buffer, or sometimes framestore) is a portion of RAM[1] containing a bitmap that is driven to a video display from a memory buffer containing a complete frame of data. [[wp>Framebuffer]] | + | **Framebuffer**: A framebuffer (frame buffer, or sometimes framestore) is a portion of RAM[1] containing a bitmap that is driven to a video display from a memory buffer containing a complete frame of data. ([[wp>Framebuffer]]) |
| ---- | ---- | ||
| Line 124: | Line 120: | ||
| === R === | === R === | ||
| - | **Reentrant**: A computer program or subroutine that can be interrupted in the middle of its execution and then safely called again ("re-entered") before its previous invocations complete execution.\\ **Source:** [[wp>Reentrancy (computing)]] | + | **Reentrant**: A computer program or subroutine that can be interrupted in the middle of its execution and then safely called again ("re-entered") before its previous invocations complete execution. ([[wp>Reentrancy (computing)]]) |
| **Register**: A memory device directly accessible by the central processor used for the temporary storage of a computer word during arithmetic, logical, or I/O operations. (SC:327–8) | **Register**: A memory device directly accessible by the central processor used for the temporary storage of a computer word during arithmetic, logical, or I/O operations. (SC:327–8) | ||
| Line 135: | Line 131: | ||
| **Scratchpad**: An area of main memory set aside for short and frequently-used calculations. (BS:18) | **Scratchpad**: An area of main memory set aside for short and frequently-used calculations. (BS:18) | ||
| - | **Semaphore**: A variable or abstract data type used for controlling access, by multiple processes, to a common resource in a concurrent system such as a multiprogramming operating system. A trivial semaphore is a plain variable that is changed (for example, incremented or decremented, or toggled) depending on programmer-defined conditions. The variable is then used as a condition to control access to some system resource.\\ **Source:** [[wp>Semaphore (programming)]] | + | **Semaphore**: A variable or abstract data type used for controlling access, by multiple processes, to a common resource in a concurrent system such as a multiprogramming operating system. A trivial semaphore is a plain variable that is changed (for example, incremented or decremented, or toggled) depending on programmer-defined conditions. The variable is then used as a condition to control access to some system resource. ([[wp>Semaphore (programming)]]) |
| **Stack**: A reserved area of several memory locations, the top of which is indicated by the contents of the stack pointer. Memory location are organized as a last-in, first-out file. By looking at particular entries in the stack, the central processor returns to a main program regardless of the depth of nested subroutines. (SC: 28-9) | **Stack**: A reserved area of several memory locations, the top of which is indicated by the contents of the stack pointer. Memory location are organized as a last-in, first-out file. By looking at particular entries in the stack, the central processor returns to a main program regardless of the depth of nested subroutines. (SC: 28-9) | ||
| Line 142: | Line 138: | ||
| **Subroutine**: A program within a program that performs a specific, often-used function. (BS:18) | **Subroutine**: A program within a program that performs a specific, often-used function. (BS:18) | ||
| - | |||
| - | ---- | ||
| - | === T === | ||
| - | |||
| - | ---- | ||
| - | === U === | ||
| ---- | ---- | ||
