[go: up one dir, main page]
Scribd
Upload
68 views2 pages

Discrete Structures Reviewer

The document is a review guide for a Discrete Structures examination covering counting principles, permutations, combinations, set theory, relations, and graph theory. It includes formulas and examples for calculating outcomes in various scenarios, such as arranging items and selecting teams. Additionally, it provides problem-solving practice related to sports team selection and creating a phone passcode.

Uploaded by

chescamheyreyes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views2 pages

Discrete Structures Reviewer

The document is a review guide for a Discrete Structures examination covering counting principles, permutations, combinations, set theory, relations, and graph theory. It includes formulas and examples for calculating outcomes in various scenarios, such as arranging items and selecting teams. Additionally, it provides problem-solving practice related to sports team selection and creating a phone passcode.

Uploaded by

chescamheyreyes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Discrete Structures Reviewer – 2nd Periodical Examination

Part A: Multiple Choice Review

Counting Principles & Probability

1. The fundamental counting principle states that if one event can occur in "m" ways and another
in "n" ways, the total possible outcomes = m × n.

2. Permutations (order matters):

o Formula: P(n, r) = n! / (n - r)!

o Example: Arranging 3 out of 5 bands → P(5,3) = 5! / (5 - 3)! = 60

3. Combinations (order does not matter):

o Formula: C(n, r) = n! / [r!(n - r)!]

o Example: Choosing 3 students from a group of 7 → C(7,3) = 35

Permutation & Arrangements

1. Rearranging Letters:

o Unique letters: Use n!

o Repeating letters: n! / (repeating factor)!

o Example: “APPLE” → 5! / 2! = 60

2. Digits in a number:

o Without repetition: P(n, r)

o With repetition: n^r

o Example: 3-digit number using 0-9 → 10 × 10 × 10 = 1000

Set Theory & Relations

1. Types of Relations:

o One-to-One: Each input has a unique output.

o Many-to-One: Multiple inputs map to the same output.

o One-to-Many: One input has multiple outputs.

o Many-to-Many: Multiple inputs and outputs.

2. Equivalence Relation Conditions:

o Reflexive (a = a)

o Symmetric (a = b → b = a)
o Transitive (a = b, b = c → a = c)

3. Functions vs. Relations:

o Every function is a relation, but not all relations are functions.

Graph Theory

1. Digraphs: Directed graphs with arrows.

2. Basic Graph Elements:

o Vertices (nodes)

o Edges (connections)

Part B: Problem-Solving Practice

1. Sports Team Selection:

o A basketball coach needs to pick 3 players from a group of 6 to form a lineup where
position matters.

o How many different ways can he arrange the players?

o Hint: Since order is important, think about how many choices are available for each
position.

2. Phone Passcode:

o A phone requires a 5-digit passcode using numbers 0-9, but no number can be
repeated.

o How many different passcodes can be created?

o Hint: Start by determining how many options you have for the first digit, then the next,
and so on.

You might also like