discrete math Flashcards

1
Q

unordered collectrion of OBJECTS

A

SET

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

OBJECTS THAT BELONG TO A SET IS CALLED?

A

ELEMENTS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

THE IDENTIFIER OF A GROUP OF OBJECT TO BE CALLED A SET

A

{} CURLY BRACKETS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

3 WAYS TO RESPRESENT THE ELEMENTS IN A SET

A

DESCRIBE THE ELEMENTS
LIST THE ELEMENTS
IDENTIFIER TO REPRESENT THE ELEMENTS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

2 SPECIAL SETS

A

UNIVERSAL SET- SET OF ALL THE OBJECTS UNDER DISCUSSION.
EX– U=(1,2,3,4,5}
NULL SET- SET CONTAINING NO ELEMENTS THAT IS PART OF THE UNIVERSAL SET
Φ={}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

4 RELATIONSHIPS OF SETS

A

EQUALITY= 2 SETS ARE SAID TO BE EQUAL IF AND ONLY IF THEY HAVE THE SAME DISTINCT ELEMENTS
(NO. OF ELEMENTS DOES NOT FACTOR TO EQUALITY)
A=C

SUBSET= ALL ELEMENTS OF A SET ARE ALSO ELEMENTS OF ANOTHER SET.
D⊆A

PROPER SUBSET=F SET 2 CONTAINS AT LEAST 1 ELEMENT THAT IS NOT PRESENT IN SET 1
⊂⊂⊂⊂⊂⊂⊂

DISJOINT- IF 2 SETS HAVE NO COMMON ELEMENTS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

5 OPERATIONS ON SET

A

INTERSECTION ∩

UNION U [similar elements does not repeat]

DIFFERENCE (-) or () elements that are is set 1 but
nott in set 2 (remove similar sets)

SYMMEETRIC DIFFERENCE- DIFFERENCE OF THE UNION AND INTERSECTION OF TWO SETS
A∆B= (AUB)-(A∩B)

COMPLEMENT- DIFFERENCE OF THE UNIVERSAL SET AND A SPECIFIC SET.
(A^C OR A’ )

you can illustrate these in a venn diagram

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

A SET OF RELATION BETWEEN TWO SETS WHERE IT MAPS THE ELEMENTS OF SET A WITH ONE AND ONLY ONE ELEMENTS OF SET B

A

FUNCTION-

A function is a relation in which each possible input value leads to exactly one output value. We say “the output is a function of the input.” The input values make up the domain, and the output values make up the range.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

in a function, what do you call the SET of actual inputs where the codomain is paired with a domain.

A

RANGE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

3 TYPES OF FUNCTION

A

INJECTIVE - (1TO1 FUNCTION) EACH ELEMENT OF THE SET B ARE PAIRED WITH A DISTINCT ELEMENT IN SET A

SURJECTIVE- (ONTO) ALL ELEMENTS OF THE CODOMAIN ARE PAIRED WITH AN ELEMENTS IN THE SET A
BIJECTIVE (ONE TO ONE & ONTO) ALL ELEMENTS OF THE SET B ARE PAIRED WITH A DISTINCT ELEMENT IN SET A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

2 OPERATIONS OF FUNCTIONS ONLY APPLICABLE FOR FUNCTIONS

A

INVERSE FUNCTION
Y=F(X) —> X=G(Y)

COMPOSITION FUNCTION- APPLYING ONE FUNCTION TO THE RESULT OF ANOTHER FUNCTION
F(G(X)) — EX

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

SHAPE THAT REPRESENT THE UNIVERSAL SET

A

RECTANGLE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

SHAPE THAT REPRESENT THE SUBSET OF A UNIVERSALSET

A

CIRCLE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

product of two sets in pairs that contains all ordered pairs

A

CARTESIAN PRODUCT “product”

A X B =

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

A SUBSET OF THE CARTESIAN PRODUCT

A

RELATION

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

5 PROPERTIES OF RELATION

A

REFLEXIVE - ALL ELEMENTS OF A RELATION SHOULD have (a,a) of every (a) that is an element of set A;

ex; A={1,2,3}, then R is reflexive if (1,1)(2,2), & (3,3) all exist in the relation

IRREFLEXIVE- No any (a,a) pair in the relation

SYMMETRIC- [a pair is symmetric if (a,b) & (b,a) exist in the relation]. a relation can be alled symmetric relation if all the elements are symmetric.

ANTISYMMETRIC- all “symmtric” pairs should satisfy (a=b) to be called antisymmetric relation.

TRANSITIVE- if (a,b) & (b,c) are elements in the relation. then (a,c) is an element of the relation.
ex: {(1,1)(2,1)(1,2)} is trasitive since;
if 12 is AB, then BC can be= 21, so that AC=11 which all exists in the relation
note- you just need to use all elements in pairing for it to be transitive.