introduction to counting techniques Flashcards

1
Q

deals with the
occurrence of a random
event. It has been
introduced in Math to
predict how likely
events are to happen or
the measure of the
likelihood of an event to
occur.

A

probability

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

How is probability
used to make
predictions

A

P(A) = number of favorable outcomes to A / total number of possible outcomes

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

helps to organize and visualize
the different possible outcomes

  • used to represent the
    probability of occurrence of
    events without using
    complicated formulas
A

tree diagram

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

4 ways we can use tree diagram

A
  • Brainstorming
    possible outcomes of
    a scenario
  • Problem-solving
    and root-cause
    analysis
  • Anticipating
    potential workflow
    issues
  • Indicating
    hierarchy of tasks
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

3 advantages of using tree diagram

A
  • Better decision-
    making - Enhanced

troubleshooting

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

Can we always use a tree diagram for organized counting?

A

Often we can use organized counting methods like
tree diagrams, lists, charts, and Venn diagrams to
help us count the possibilities in a given situation.

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

If an event can occur in m different ways,
and another event can occur in n different
ways, then the total number of occurrences
of the events is m · n.

A

basic counting principle

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

When do we use the counting principle?

A

When the choice that is to be made are independent of each other.

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

How do you find the number of outcomes of an event?

A

You simply take the number of choices or possible
outcomes and then multiply them together.

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

The product of all the positive integers
from n to 1, denoted by a special symbol
n! (read as “n factorial”).

A

factorial notation

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

If n is a non-negative integer,
0! = ?

A

1

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

n! = (n-1)! n where

A

n≥1.

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

is an arrangement of objects in a specific order.

A

permutation

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

When do we use the permutation?

A

Permutations are used when order/sequence
of arrangement is needed (where the order of

the data matters).

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

Advantages or benefits of permutation

A
  • To count the
    number of ways
    for determine
    arrangement
  • Distinguishing
    for one
    arrangement to
    another
    arrangement
  • To determine
    the number of
    sequence of
    letters and
    numbers
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Can we always use permutation for

organized counting?

A

No, because there are many Fundamental
Counting Principle problems that cannot be
solved with the permutation formula.

17
Q

formula for permutation if isa ra ka kuan given

A

nPn = n!

18
Q

formula for permutation if duha given

A

nPr = n!/(n-r)!

19
Q

n is the

A

total number of objects

20
Q

r is the

A

number of objects taken from n

21
Q

The number of permutations of n objects
taken n at a time where one object is
repeated S1 times, another is repeated
S2 times, and so on, is

A

permutation with repetition

22
Q

permutation with repetition formula

A

P = n!/s1!s2!s3!…sk!