PRE-TEST
COUNTING TECHNIQUES
Learning competency
Using the Addition and Multiplication Principles to Count Elements of a Set
Learning competency
Differentiating Between a Combination and a Permutation of Objects
Learning competencies
Learning competency
Learning competency
Learning competency
Learning competency
Learning competency
PROBABILITY
Learning competency
Learning competency
Learning competency
Learning competency
Learning competency
Learning competency
Learning competency
Learning competency
MID-TEST
NUMBER THEORY
Learning competency
Proving Properties of Divisibility of Integers
Learning competency
Illustrating Prime and Composite Integers and the Fundamental Theorem of Arithmetic by Formulating the Prime Factorization of Positive Integers
Learning competency
Computing the GCD and LCM of Two Positive Integers by Prime Factorization and the Euclidean Algorithm
Learning competency
Solving Linear Diophantine Equation Using the Euclidean Algorithm
Learning competency
Illustrating Congruence Modulo m and Its Properties
Learning competency
Performing Arithmetic Operations and Solving Linear Equations Modulo m
Learning competency
Solving Problems Involving Modular Arithmetic (UPC codes, ISBN, Luhn’s Algorithm for credit card number verification)
NETWORKS AND GRAPHS
Learning competency
Illustrating Elements of a Graph (Vertices/Nodes, Edges/Arcs) and the Different Types Of Graphs (Simple, Directed, Complete, Bipartite, Connected, Path, Cycle, Tree, Regular, Etc.)
Learning competency
Exploring Some Real-life Situations where Graphs are Utilized
Learning competency
Differentiating Between Eulerian and Hamiltonian Paths/Circuits
Learning competency
Applying Euler’s Theorem to Determine the Existence of Eulerian Paths and Circuits
Learning competency
Applying Dirac’s Condition for the Existence of Hamiltonian Circuits
Learning competency
Identifying Eulerian and Hamiltonian Circuits and Paths in a Connected Graph
Learning competency
Explaining Spanning Trees and their Significance
Learning competency
Applying Breadth-First Search (BFS) and Depth-First Search (DFS) Algorithms to Find Spanning Trees in a Connected Graph
Learning competency
Applying Different Methods to Find Shortest Paths (Dijktra’s Algorithm, Floyd-Warshall Algorithm)

