Discrete Mathematics for Computer Science

(Romina) #1

Terms Meaning Section


Functions

F: X --- Y Function with dom. X and codom. Y 4.1.2


y = F(x) Image of x under F 4.1.2

F-1(y) Inverse image of y 4.1.2

F-'(Y) Inverse image of the set Y 4.1.2

FIB Restriction of function F to domain B 4.1.6

.Tx Family of functions with dom. and codom. 4.2
equal X
GoF Composition of functions F and G 4.3.1

G(F(x)) = G o F(x) Image of x under composition 4.3.1

F+G Sum of functions F and G 4.3.3
Fm/ni Ceiling function 4.1
Lm/nj Floor function 4.1

F•G Product of functions F and G 4.3.3

IFl Absolute value of function F 4.3.3

F/G Quotient of functions F and G 4.3.3

k to 1 k to 1 property of functions 4.6.1

0.d 1 .d 2.. .di-di ... d. Repeating decimal 4.6.3

Aleph nought-IN 1 4.8.1

Analysis of Algorithms
O(F) Order of F 5.1.1
e Equivalence relation on order sets 5.1.2
polynomial Function of the form ao + + anxn 5.1.3
exponential Function of the form a b 5.1.4
logarithmic Function of the form logy (x) 5.1.4

Graph Theory

G = (V, E) Graph with vertex set V and edge set E 6.1.1
deg(v) Degree of vertex v 6.1.1
di, d 2 , .... d. Degrees of the vertices of a graph 6.1.
K. Complete graph on n vertices 6.1.1
Km,n Complete bipartite graph on m 6.1.1
and n vertices
G 1 U G2 Union of graphs G 1 and G 2 6.1.2

G, 1 n G 2 Intersection of graphs G 1 and G 2 6.1.2

G Complement of graph G 6.1.2
Qn Hypercube on n vertices 6.1.2
Tr(k) Trail of length k 6.3
Pn Path of length n 6.3
Cn Cycle with n vertices 6.3
Free download pdf