470
Relations, Functions, and Matrices
c h a p t e R 5 Review
teRmInologY
ABA routing number (p. 437)
add to a database (p. 375)
addition modulo n (p. 343, p. 438)
addition of matrices (p. 449)
AES (Advanced Encryption
Standard) (p. 431)
antisymmetric relation (p. 332)
array (p. 448)
asymmetric encryption (p. 431)
augmented matrix (p. 453)
big oh (p. 417)
big theta (p. 413)
bijection (p. 390)
binary relation from S to T (p. 330)
binary relation on a set S (p. 329)
binary relation on S × T (p. 330)
blind key (p. 368)
block (p. 339)
block cipher (p. 429)
Boolean and (logical and) (p. 458)
Boolean matrix (p. 458)
Boolean matrix multiplication
(A × B) (p. 458)
Boolean or (logical or) (p. 458)
Caesar cipher (p. 428)
Cantor’s theorem (p. 401)
cardinality of a relation (p. 366)
cardinality of a set (p. 401)
ceiling function (p. 386)
chain (p. 338)
chaining (p. 426)
ciphertext (p. 428)
circular left shift (p. 430)
closure of a relation (p. 334)
codomain (p. 383)
collision (p. 425)
commutative diagram (p. 391)
composition function (p. 391)
composite primary key (p. 367)
conceptual model (p. 365)
congruence modulo 4 (p. 343)
congruence modulo n (p. 343)
critical path (p. 359)
cryptographic hash function
(p. 434)
cryptography (p. 428)
cryptology (p. 428)
data integrity (p. 375)
database (p. 365)
degree of relation (p. 366)
delete from a database (p. 375)
derangement (p. 396)
DES (Data Encryption Standard)
(p. 429)
diffusion (p. 429)
dimensions of a matrix (p. 446)
disjoint cycles (p. 395)
domain (p. 383)
elementary row operations (p. 454)
entities (p. 365)
entity integrity (pp. 367, 375)
entity-relationship diagram (E-R
diagram) (p. 365)
entity-relationship model (p. 365)
equal functions (p. 387)
equal matrices (p. 447)
equivalence class (p. 339)
equivalence relation (p. 339)
equivalent sets (p. 401)
floor function (p. 386)
foreign key (p. 368)
function (p. 383)
Gaussian elimination (p. 454)
greatest element (p. 338)
hash function (p. 424)
hash table (p. 425)
Hasse diagram (p. 336)
identity function (p. 392)
identity matrix (p. 451)
identity permutation (p. 396)
image (p. 383)
immediate predecessor in a partial
ordering (p. 336)
intractable problem (p. 417)
inverse function (p. 393)
inverse of a matrix (p. 452)
invertible matrix (p. 452)
International Standard Book
Number (ISBN) (p. 435)
join (p. 370)
least element (p. 338)
linear equation (p. 447)
linear probing (p. 425)
little oh (p. 417)
load factor (p. 427)
main diagonal (p. 447)
many-to-many relation (p. 330)
many-to-one relation (p. 330)
mapping (p. 383)
master theorem (p. 418)
matrix (p. 446)
matrix of coefficients (p. 447)
maximal element (p. 338)
metadata (p. 366)
minimal element (p. 338)
modify a database (p. 375)
modulo function (p. 386)
multiplication of matrices (p. 450)
n-ary relation on
S 1 × S 2 × c × S n (p. 330)
node (p. 337)
one-to-many relation (p. 330)
one-to-one (injective) function
(p. 389)
one-to-one relation (p. 330)
one-way encryption (p. 434)
onto (surjective) function (p. 388)
order of magnitude (p. 413)
partial ordering (p. 336)
partially ordered set (poset)
(p. 336)
partition (p. 339)
permutation function (p. 394)
PERT chart (p. 357)
plaintext (p. 428)
poset (p. 336)
predecessor in a partial ordering
(p. 336)
preimage (p. 383)
primary key (p. 367)
private key encryption (p. 431)
project (p. 369)
public key encryption (p. 431)
range (p. 388)
referential integrity (p. 375)
reflexive closure (p. 334)
reflexive relation (p. 332)
relational algebra (p. 372)
Relations, Functions, and Matrices
c h a p t e R 5 Review
teRmInologY
ABA routing number (p. 437)
add to a database (p. 375)
addition modulo n (p. 343, p. 438)
addition of matrices (p. 449)
AES (Advanced Encryption
Standard) (p. 431)
antisymmetric relation (p. 332)
array (p. 448)
asymmetric encryption (p. 431)
augmented matrix (p. 453)
big oh (p. 417)
big theta (p. 413)
bijection (p. 390)
binary relation from S to T (p. 330)
binary relation on a set S (p. 329)
binary relation on S × T (p. 330)
blind key (p. 368)
block (p. 339)
block cipher (p. 429)
Boolean and (logical and) (p. 458)
Boolean matrix (p. 458)
Boolean matrix multiplication
(A × B) (p. 458)
Boolean or (logical or) (p. 458)
Caesar cipher (p. 428)
Cantor’s theorem (p. 401)
cardinality of a relation (p. 366)
cardinality of a set (p. 401)
ceiling function (p. 386)
chain (p. 338)
chaining (p. 426)
ciphertext (p. 428)
circular left shift (p. 430)
closure of a relation (p. 334)
codomain (p. 383)
collision (p. 425)
commutative diagram (p. 391)
composition function (p. 391)
composite primary key (p. 367)
conceptual model (p. 365)
congruence modulo 4 (p. 343)
congruence modulo n (p. 343)
critical path (p. 359)
cryptographic hash function
(p. 434)
cryptography (p. 428)
cryptology (p. 428)
data integrity (p. 375)
database (p. 365)
degree of relation (p. 366)
delete from a database (p. 375)
derangement (p. 396)
DES (Data Encryption Standard)
(p. 429)
diffusion (p. 429)
dimensions of a matrix (p. 446)
disjoint cycles (p. 395)
domain (p. 383)
elementary row operations (p. 454)
entities (p. 365)
entity integrity (pp. 367, 375)
entity-relationship diagram (E-R
diagram) (p. 365)
entity-relationship model (p. 365)
equal functions (p. 387)
equal matrices (p. 447)
equivalence class (p. 339)
equivalence relation (p. 339)
equivalent sets (p. 401)
floor function (p. 386)
foreign key (p. 368)
function (p. 383)
Gaussian elimination (p. 454)
greatest element (p. 338)
hash function (p. 424)
hash table (p. 425)
Hasse diagram (p. 336)
identity function (p. 392)
identity matrix (p. 451)
identity permutation (p. 396)
image (p. 383)
immediate predecessor in a partial
ordering (p. 336)
intractable problem (p. 417)
inverse function (p. 393)
inverse of a matrix (p. 452)
invertible matrix (p. 452)
International Standard Book
Number (ISBN) (p. 435)
join (p. 370)
least element (p. 338)
linear equation (p. 447)
linear probing (p. 425)
little oh (p. 417)
load factor (p. 427)
main diagonal (p. 447)
many-to-many relation (p. 330)
many-to-one relation (p. 330)
mapping (p. 383)
master theorem (p. 418)
matrix (p. 446)
matrix of coefficients (p. 447)
maximal element (p. 338)
metadata (p. 366)
minimal element (p. 338)
modify a database (p. 375)
modulo function (p. 386)
multiplication of matrices (p. 450)
n-ary relation on
S 1 × S 2 × c × S n (p. 330)
node (p. 337)
one-to-many relation (p. 330)
one-to-one (injective) function
(p. 389)
one-to-one relation (p. 330)
one-way encryption (p. 434)
onto (surjective) function (p. 388)
order of magnitude (p. 413)
partial ordering (p. 336)
partially ordered set (poset)
(p. 336)
partition (p. 339)
permutation function (p. 394)
PERT chart (p. 357)
plaintext (p. 428)
poset (p. 336)
predecessor in a partial ordering
(p. 336)
preimage (p. 383)
primary key (p. 367)
private key encryption (p. 431)
project (p. 369)
public key encryption (p. 431)
range (p. 388)
referential integrity (p. 375)
reflexive closure (p. 334)
reflexive relation (p. 332)
relational algebra (p. 372)