Exam 3 Flashcards

1
Q

How do you find the sum of the nth row?

A

2^n

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

What is row 0 of pascals triangle

A

1

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

what is row 1 of pascals triangle

A

1 1

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

what is row 2 of pascals triangle

A

1 2 1

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

what is row 3 of pascals triangle

A

1 3 3 1

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

what is row 4 of pascals triangle

A

1 4 6 4 1

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

what is row 5 of pascals triangle

A

1 5 10 10 5 1

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

what is row 6 of pascals triangle

A

1 6 15 20 15 6 1

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

what is row 7 of pascals triangle

A

1 7 21 35 35 21 7 1

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

what is row 8 of pascals triangle

A

1 8 28 56 70 56 28 8 1

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

How do you find the # of subsets that an asset with n elements has?

A

2^n

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

What is a powerset

A

set of all subsets

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

What does a ∩ b mean

A

Intersection. The intersection of two sets is a new set that contains all of the elements that are in both sets.

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

what does a ∪ b mean

A

The union of two sets is a new set that contains all of the elements that are in at least one of the two sets. The union is written as A ∪ B or “ A or B ”.

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

What does B’ mean

A

everything that is not inside B

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

How do you find the number of bit strings in length n?

A

2^n

17
Q

How do you find the number of bit strings of length n that contain an exact amount of #? (length 9 with exactly 5 1s and 4 0s)

A

ex: do 9 nCr 5 (length 9 with exactly 5 1s and 4 0s)

18
Q

What does 3! mean

A

321 (6 permutations)

19
Q

What is the formula for permutations

A

n! = n(n-1)(n-2_..(3)(2)(1)

20
Q

How do you calculate the number of permutations assuming 2 people must be adjacent (a group of 5 people but A and B need to be adjacent)

A

1 (1,2) 2 3 4

4!2! = 48

21
Q

How do you calculate the number of permutations assuming 2 people cannot be adjacent (a group of 5 people but A and B cannot be adjacent)

A

You take the compliment (total - opposite)

5!-4!-2!

22
Q

What is the formula for the compliment

A

total - opposite

23
Q

How do you calculate the number of permutations assuming 3 people must be adjacent (a group of 5 people but A and B and C need to be adjacent)

A

3!3!

5-3 = 2 + 1 (1 group of 3)) x (amount that needs to be together

24
Q

When calculating in a horse race with 9 horses, how many ways can the top 3 finish?

A

Use nPr so 9p3 = 504

of permutations of n things taken # at a time

25
Q

What if each 0 in a length 9 bit string must be immediately followed by a 1? (4 zeros)

A

a (01) b (01) c (01) d (01) e
(9-4*1(4 groups of 01)) is c (5,1)
5 letters (a,b,c,d,e) with 1 combination of 01 because it can only ever be 1 combo regardless of position