Reyes Kier Christian

Republic of the Philippines
University of Cabuyao
(Pamantasan ng cabuyao)
COLLEGE OF COMPUTING STUDIES
Katapatan Mutual Homes, Brgy. Banay-banay, City of Cabuyao, Laguna 4025
CSP102 – Discrete
Structures 2
A.Y. 2023 – 2024 / 1st SEMESTER
KIER CHRISTIAN F, REYES
2CS-B
Table of Content
I. Vision/Mission of UC (PnC)
II PEOs of the Program
III. SOs addressed by the course
IV. OBTLP or Courses Syllabi/Outline
V. Answered Prelim Assessment Tasks (lecture/lab)
VI. Learning Reflection
VII. Answered Midterm Assessment Tasks (lecture/lab)
VIII. Learning Reflection
IX. Answered Finals Assessment Tasks (lecture/lab)
X. Learning Reflection
XI. Overall Course Learning Reflection
XII. Suggestions/Recommendation
I. Vision/Mission of UC (PnC)
Vision
An institution of higher learning in Region IV, developing globally-competitive and value-laden professionals
and leaders instrumental to community development and nation building.
Mission
An institution of higher learning committed to equip individuals with knowledge, skills and values that will
enable them to achieve professional goals & provide leadership and service for national development.
II. PEOs of the Program
Three to five years after graduation, the Bachelor of Science in Computer Science alumni shall:
1. be employed in the field of computing;
2. possess globally competitive skills;
3. demonstrate personal dignity and integrity; and
4. engage in community development or nation building.
III. SOs addressed by the course
Student I/L E/P D/O

Outcomes Map SO Apply knowledge of computing fundamentals, knowledge
Addressed by 1. of a computing specialization, and mathematics, science, /
the Course and domain knowledge appropriate for the computing
specialization to the abstraction and conceptualization of
computing models from defined problems and
requirements
/
SO Identify, analyze, formulate, research literature, and
2. solve complex computing problems and requirements
reaching substantiated conclusions using fundamental
principles of mathematics, computing sciences, and
relevant domain disciplines.
IV. OBTLP or Courses Syllabi/Outline
Teaching and
Intended Learning Instructional Assessment
Week Topics Learning
Outcomes (ILO) Material Tasks (AT)
Activities (TLA)
PnC Mission and  Describe the Lecture Module Seatwork
Vision different counting
Program theories Problem-Based Written Quiz
Outcomes, Course  Analyze different Learning (PBL)
Outcomes counting problems Case Study
Course Orientation and apply Group
and Policies appropriate theory to Discussion
OBE Orientation solve it.
Associated CILOs: CILO1
Counting Theory
- Additive
Principle
1-2
- Multiplicati
ve
Principle
- Pigeonhol
e Principle
- Permutatio
ns
- k-
permutatio
n
Probability  Describe the Lecture Module Seatwork

- Properties properties of
- Probabillity probability Problem-Based Written Quiz
Axioms  Explain the concept Learning (PBL)
- Conditional of conditional
Probability probability Group
- Baye’s Theorem  Analyze and Discussion
3-4
compute the
probability based
on a given scenario
Associated
CILOs:
CILO2
Algorithms  Describe the Lecture Module Seatwork

- properties of an
Propertie algorithm Problem-Based Written Quiz
s of  Recognize the Learning (PBL)
Algorith different time
ms complexities Group
- using Big O Discussion
Example Notation
s of  Determine the
Algorith complexity of a
ms given algorithm
- Linear Associated CILOs:
Search CILO3
- Binary
5
Search
- Greedy
Algorith
ms
- Growth
of
Function
s
-
Complex
ity of
Algorith
ms
Prelim Examination
7-8 Recursive Define recursion Lecture Module Written Quiz
Algorithms and its
- characteristics in Problem-Based
Recursion the context of Learning (PBL)
- algorithm design
Recursive  Apply recursive Group
Function thinking to Discussion
- decompose
Recursive complex problems
Formula into simpler
using subproblems
Arithmetic  Design recursive
algorithms for
various problem
Sequence domains.
- Associated CILOs: CILO3
Recursive
Formula
using
Geometric
Sequence
Recurrence  Define recurrence Lecture Module Written Quiz

Relations relations and their
- Linear role in modeling Problem-Based
- Non- sequential Learning (PBL)
Homogen processes.
eous  Distinguish between Group
Generating homogeneous and Discussion
Functions non-homogeneous
9
recurrence relations.
 Solve basic linear
homogeneous
recurrence relations
using characteristic
equations.
10 - 11 Graph Theory  Apply advanced Lecture Module Seatwork

- What is graph theory
a concepts in solving Problem-Based Case Study
Graph? real-world problems Learning (PBL)
- Directed  Determine Written Quiz
and properties of Group
Undirect different types of Discussion
ed graphs
Graphs  Solve problems
- Other involving graph
Types of coloring, matching,
Graphs and covering.
- Properti Associated CILOs: CILO1
es of
Graphs
- Euler
Circuits
and
Walks
- Hamilto
n Cycles
and
Paths
- Bipartite
Graphs
- Graph
Coloring
- Directed
Graphs
Midterm Examination
Network Models  Explain the Lecture Module Seatwork
- Shortest importance of
Path network models in Problem-Based Written Quiz
- Minimum modeling Learning (PBL)
Spanning interconnected
Tree systems. Group
- Network  Determine the Discussion
Flow connectivity of a
13 Social Network graph
 Apply graph
traversal algorithms
to solve problems
related to
connectivity and
pathfinding.
Trees  Define key Lecture Module Seatwork

- General terminology
Trees related to Problem- Case Study
- Directed trees, Based
Trees including Learning (PBL) Written Quiz
- Ordered root, node,
Trees parent, child, Group
- Properties leaf, depth, Discussion
of Trees height, and
- Rooted subtree.
Trees  Apply tree
14 - 15 - Path traversal
Length of techniques
a Vertex  Implement
- Binary different
Trees operations in
- Binary a binary
Search search tree
Trees Associated CILOs:
- Minimum CILO1
Spanning
Trees
-
Computational  Define Lecture Module Written Quiz

Geometry computational
- Convex geometry and its Problem-Based
Hulls significance in Learning (PBL)
- Voronoi various fields
Diagrams  Identify real-world Group
- Delaunay applications of Discussion
16 -
Triangulati computational
17
ons geometry
- Geometric  Apply geometric
Intersectio algorithms in solving
n real-world problems
- Graph Associated CILOs:
Drawing CILO1
Algorithms
Final Examination
V. Answered Prelim Assessment Tasks (lecture/lab)
Prelim Quizzes (Quiz 1 & 2)

Prelim Examination
VI. Learning Reflection
Learning Reflection in Prelim
This period gives us a fresh rewind to our previous topic in 1 st year which is permutation and probability. It
introduces interesting topics such as Baye’s Theorem, Pigeonhole Principle, and many more. I learned that Baye’s
Theorem is something like when you’re trying to figure out the probability of a something happening based on other
info or based on the provided new info. It’s like trying to update your guess with new information that is provided
currently. I also learned different types of algorithms which the binary search, linear which is I already encounter
during my 1st year period, and there’s also greedy algorithm – which is basically an algorithm to find an optimal
solution but it's always finding the optimal solution given that it has no reference or idea to the nodes or object that
it skipped.
Prelim period introduces us and give us a starter which will accommodate us for the next topics which is
harder than this.
VII. Answered Midterm Assessment Tasks (lecture/lab)
Midterm Quiz
Midterm Examination
VIII. Learning Reflection
Learning Reflection in Midterm

During the midterm, our professor introduces us about recursive and bunch of algorithms that we can
implemented in different applications. The topic is a great throwback of our junior year topics about arithmetic and
geometric sequence. Throughout the learning, I was able to create my own recursive formulas and learned how it’s
useful in the context of mathematics and programming also. I also learned about the recurrence relations, it
somehow relates to homogenous differential equation by the fact that both relied between current and past states.
Recurrence relation is like a instruction that tells how to generate this sequence of numbers. It’s like finding the next
number based on the ones before it or precedence. Next topic, I learned about the graphs although I already
encountered graphs in LeetCode, giving me a recap for the topic is such a huge help. Our professor taught us the
concepts behind bipartite graph and explain each property and different types of graphs.
Lessons during the midterm are quite interesting and big helpful through my self-game project on which I’m
trying to apply a recursive approach through a snippet of code and thanks to these lessons it kind of give me a
heads up and a big illustration to come up with a solution.
IX. Answered Finals Assessment Tasks (lecture/lab)
Finals Quizzes 1 & 2

Final Examination
X. Learning Reflection
Learning Reflection for Finals
In the Final period, topics become so much interesting, with the introduction of computational geometry and
network models it motivates me to study more since it has the same topics in one my finished course in Coursera.
Computation geometry introduces me to topics such as Convex hull which is like finding the smallest rubber band
you can stretch around a bunch of nails and also I encountered the mathematical area of it and learned that it can
be implemented using algorithms such as Graham Scan and Jarvis March. Graham scan which is I said
earlier is like placing a rubber band to the outermost of the nails then the Jarvis March is same goal with Graham
scan but instead of sorting it selects the smallest counterclockwise angle. It also introduces to the sweep line
algorithm and Geometric Intersection which showcase the point of intersection formula.
To conclude, finals topics seems more interesting than the others by the fact it has so many applications
like collision detections in game development which is probably we encounter later year.
XI. Overall Course Learning Reflection
In this semester, I learned bunch of helpful topics and algorithms, some are already taught during my junior
year and other I already encountered throughout my journey in skill improvement. Prelim gave me a recap about
permutations and probability and also introduce me to algorithms which is similar to our prelim topics in Data
Structure and Algorithms. Midterm, we learn about recursive, the uniqueness of it and how it can be applied to
other applications. Along with that we learn about the recurrence relations, the difference between homogeneous
and non-homogeneous and also, we learn graphing- the types of it and difference between Euler and Hamiltonian.
Finals introduce us to network models on we tackle different algorithms. We learned different greedy algorithms
which is the Dijkstra algorithm and Kruskal Algorithm. I also learned Maximum Flow and how it can be implemented
using the Bellman- Ford algorithm. Lastly, we encounter binary tree which is by far we already know and learned
during our non-linear lessons in Data Structures and Algorithms. Next is we learned interesting concepts like the
computational geometry topics like convex hulls, visualizing Voronoi diagrams and Delaunay Triangulations.
I must say, Discrete Structures 2 tackles different topics which is somehow more interesting for me than the
first prerequisite of the said course subject. Although it kind of seem sad when different holidays or school events
limit us from learning but at the same time, I’m grateful that I kind of coped with that since I have a lot of time to
read Discrete Structures books and learned different graphing algorithm through the use of C++ tutorials in
“VisuAlgo”. I certainly confident, that my learnings through this course subject will be useful through the next years
and also when challenging myself though Leetcode projects.
XII. Suggestions/Recommendation
During the semester, I got good grades which reflects that my professor really taught us everything deep down
through the materials but I was kind of hoping that activities and quizzes during this semester needs to be more.
Since many students and also, I might fail the first activity or even the quiz there’s nothing to help us to alleviate
that failed points other than the examination which give us a reminder that we need somehow to perfect or get a
high score. Although it sounds motivating but each of us have different capacity. Some of us excel in terms of
mental computation and other just is relying to what they’re learning.
I hope that if this is possible, we can somehow add more activities to help students who are struggling
behind lessons or to their shifts to actually feel that there is hope or another opportunity to them to prove their
willingness to pass this subject. If it’s only possible, by far my experience for this semester gives me a hope or a
motivation to study more of mathematical concepts behind computer science.

Reyes Kier Christian

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Reyes Kier Christian

Uploaded by

Copyright:

Available Formats

Republic of the Philippines

II PEOs of the Program

III. SOs addressed by the course

IV. OBTLP or Courses Syllabi/Outline

V. Answered Prelim Assessment Tasks (lecture/lab)

VI. Learning Reflection

VII. Answered Midterm Assessment Tasks (lecture/lab)

VIII. Learning Reflection

IX. Answered Finals Assessment Tasks (lecture/lab)

XI. Overall Course Learning Reflection

II. PEOs of the Program

III. SOs addressed by the course

Student I/L E/P D/O

IV. OBTLP or Courses Syllabi/Outline

Probability  Describe the Lecture Module Seatwork

Algorithms  Describe the Lecture Module Seatwork

Recurrence  Define recurrence Lecture Module Written Quiz

10 - 11 Graph Theory  Apply advanced Lecture Module Seatwork

Trees  Define key Lecture Module Seatwork

Computational  Define Lecture Module Written Quiz

V. Answered Prelim Assessment Tasks (lecture/lab)

Prelim Quizzes (Quiz 1 & 2)

VI. Learning Reflection

Learning Reflection in Prelim

VII. Answered Midterm Assessment Tasks (lecture/lab)

VIII. Learning Reflection

Learning Reflection in Midterm

IX. Answered Finals Assessment Tasks (lecture/lab)

Finals Quizzes 1 & 2

Learning Reflection for Finals

XI. Overall Course Learning Reflection

You might also like