- A
absorption

access time

acyclic graphs

algorithm

AND

arc of a directed graph

arguments

array

artifacts

ASCII

aspect ratio

associativity

asynchronous applications

average

axioms

- B
bandwidth

BCD

biased exponents

biconditional

binary addition

binary number system

binary operator

binary subtraction

binary to decimal conversion

BIOS

bit

Boolean Algebra

boundedness

branch of a tree

bridge edge of a graph

bus

byte

- C
cartesian products of sets

clock time

codec

collision

color depth

commutativity

compilers

complement of a set

complements

complete graphs

conjunction

connected graph

connectivity of a graph

contradiction

constructive dilemma

cross products of sets

cut point of a graph

cycle

cycle of a graph

cycle time

cylinder of a hard disk

- D
data structure

data transfer rate

decimal to binary conversion

decimal to hexadecimal conversion

degree of a vertex

DeMorgan's Laws

denormalization

depth of a vertex in a tree

deterministic

diameter of a graph

difference of sets

dimension of an array

dimension of a quantity

directed graphs

directory tree

disconnected graph

disjoint sets

disjunction

disjunctive syllogism

disk geometry

distance between two vertices

distribution

double buffering

double integer

duality

dynamic range

- E
EBCDIC

edge of a graph

elements of sets

empty set

enumeration

equivalence

exclusive or

exabyte

exahertz

exponential distribution

exportation

- F
factorial

FCFS head scheduling

finite state machines

fixed point arithmetic

floating point arithmetic

floating point examples

floating point formats

Floating Point Unit

FLOPS

frequency

- G
Gaussian Distribution

gigabyte

gigahertz

graphs

- H
HD

Hertz

heuristics

hexadecimal number system

hexadecimal to decimal conversion

histogram

- I
IDE disks

idempotence

identities

IEEE

implication

improper subset

indegree of a vertex in a directed graph

infinity

interlaced video

intersection of sets

inversely proportional

inversion

involution

I/O bound

isomorphism

- J
JPEG

- K
kilobyte

kilohertz

- L
labeled graphs

latency

leading zero

leaf of a tree

least significant digit

lines (of video resolution)

linked list

Linux

logical operators

logic gates

long integer

loop in a graph

- M
Markov Processes

masking

mathematical sophistication

matrix elements

matrix representation of directed graphs

maximum absolute deviation

maximum percentage deviation

mean

megabyte

megahertz

microsecond

millisecond

MIPS

modus ponens

modus tollens

most significant digit

MP3

MPEG

MPEG 1

MPEG 2

MPEG 4

- N
nand gate

nanosecond

NaNs

negation

non-deterministic

nor gate

Normal Distribution

normalization

normalization of a distribution

NOT

null set

- O
octal number system

octet

ones complement

operator precedence

OR

outdegree of a vertex in a directed graph

outer products of sets

overflow

overrun

- P
parallel bus

parameters

parity

path in a graph

path names

path through a directed graph

PCI

petabyte

petahertz

picosecond

pipelined CPU

pixel

planar graphs

Poisson Distribution

precision

premises

products of sets

progressive video

proper subset

properties of logical operators

properties of set operators

proportionality

propositions

- q
queue

- R
RAM

range

reflexivity

register

representation error

resolution

root directory

rooted trees

- S
sample

sample depth

sample rate

SATA disks

SCSI bus

SCAN head scheduling

SCSI disks

sector of a hard disk

SEEK head scheduling

seek time

semi-path in a directed graph

semi-walk in a directed graph

serial bus

set builder notation

set equivalence

set operations

sets

short integer

sign bit

signed integers

significand

sink vertex in a directed graph

sixteens complement

source vertex in a directed graph

spanning trees

sparse array

speed

standard deviation

state table for a finite state machine

state transitions in a finite state machine

strongly connected directed graph

sum of products form

syllogism

symmetry

- T
tautology

terabyte

terahertz

text file considerations

throughput

topological invariant

topological objects

track of a hard disk

transitivity

transposition

trees

truncation

truth table

twos complement

types of graphs

- U
unary operator

underflow

underrun

unilaterally connected directed graph

union of sets

uniqueness of the complement

units of quantities

universal set

unsigned integers

USB

utilization

- V
vector

Venn Diagrams

vertex of a graph

video RAM

virtual memory addresses

- W
walk in a graph

walk through a directed graph

weakly connected directed graph

weight of a vertex or edge

- X
XOR

Go to: Title Page Table of Contents

©2013, Kenneth R. Koehler. All Rights Reserved. This document may be freely reproduced provided that this copyright notice is included.

Please send comments or suggestions to the author.