absorption
acyclic graphs
algorithm
and
arc of a directed graph
arguments
ASCII
associativity
average
axioms
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
cartesian products of sets
clock time
color depth
commutativity
compilers
complement of a set
complements
complete graphs
conjunction
connected graph
connectivity of a graph
contradiction
cross products of sets
cut point of a graph
cycle
cycle of a graph
cycle time
cylinder of a hard disk
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
diameter of a graph
difference of sets
dimension of a quantity
directed graphs
directory tree
disconnected graph
disjoint sets
disjunction
disk geometry
distance between two vertices
distribution
double integer
duality
EBCDIC
edge of a graph
elements of sets
empty set
enumeration
equivalence
exclusive or
exponential distribution
finite state machines
fixed point arithmetic
floating point arithmetic
floating point examples
floating point formats
Floating Point Unit
FLOPS
frequency
Gaussian Distribution
gigabyte
gigahertz
graphs
Hertz
heuristics
hexadecimal number system
hexadecimal to decimal conversion
histogram
IDE disks
idempotence
identities
IEEE
implication
improper subset
indegree of a vertex in a directed graph
infinity
intersection of sets
inversely proportional
inversion
involution
isomorphism
JPEG
kilobyte
kilohertz
labeled graphs
leading zero
leaf of a tree
least significant digit
lines (of video resolution)
Linux
logical operators
logic gates
long integer
loop in a graph
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
nand gate
nanosecond
NaNs
negation
nor gate
Normal Distribution
normalization
not
null set
octal number system
octet
ones complement
operator precedence
or
outdegree of a vertex in a directed graph
outer products of sets
overflow
parameters
parity
path in a graph
path names
path through a directed graph
PCI
picosecond
pixel
planar graphs
Poisson Distribution
precision
premises
products of sets
proper subset
properties of logical operators
properties of set operators
proportionality
propositions
RAM
range
reflexivity
representation error
resolution
root directory
rooted trees
sample
SCSI
sector of a hard disk
semi-path in a directed graph
semi-walk in a directed graph
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
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
tautology
terabyte
text file considerations
throughput
topological invariant
topological objects
track of a hard disk
transitivity
trees
truncation
truth table
twos complement
types of graphs
unary operator
underflow
unilaterally connected directed graph
union of sets
uniqueness of the complement
units of quantities
universal set
unsigned integers
USB
utilization
Venn Diagrams
vertex of a graph
video RAM
walk in a graph
walk through a directed graph
weakly connected directed graph
weight of a vertex or edge
Go to: Title Page Table of Contents
©2002, 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.