Week 2 Flashcards

1
Q

what are 2 important features of a sequence

A

. Order does matter
(1,2,3) , (1,3,2) are different

.Repeated occurences matter
(H,E,L,L,O) , (H,H,H,E,L,L,O), (H,E,L,O) all different

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

What is a tuple

A

a finite sequences

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

What does the k in k tuple represent

A

the length of the tuple

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

What does it mean when two tuples are equal

A

. They have the same length
. Corresponding elements are the same

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

What is an ordered pair

A

A two tuple

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

What is a cartesian products of sets ( eg of A and B )

A

All the ordered pairs (x,y) where x exists in a and y exists in B

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

What is a relation of A to B

A

A subset of the cartesian product (A x B)

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

What are the 2 ways to represent a relation

A

. directed graph
. 0 -1 matrix

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

What is important to look out for in a 0-1 matrix

A

The order horizontally is the same as the order vertically

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

What does it mean by reflexive

A

. every element has a loop
.(a,a) exists in R for every element a where a exists in A

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

What are examples of reflexive relations

A

<= , >= , = , divisibility

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

What does irreflexive mean

A

.There are no loops at all
. ( a,a ) does not exist in R for evey element a that exists in set A

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

what are examples of irreflexive relations

A

<, > , not equal to

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

symmetric

A

when a,b exist in A
If (a,b) exists in relation so does (b,a)
. all arrows are reversible

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

antisymmetric

A

if (a,b) exists in R (b,a) cannot exist in R unless a =b ( a loop)
. arrows are not reversible unless it is a loop

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

assymetric

A

even if a = b ( so it loops) this is not allowed
if (a,b) exists in R (b,a) cannot

17
Q

transitive

A

if (a,b) exists in R and (b,c) exists in R then (a,c) must exist in R

18
Q

what is the transitive closure

A

smallest transitive relation on A that contains R ( R is original)

19
Q

what is an equivalence relationship

A

.reflexive
. symmetric
.transitive

eg ( = is an equivalence relationship)

20
Q

what is a partial order

A

. reflexive
. transitive
.anti symmetric

21
Q
A