DISCRETE STRUCTURE 2

(CS 20)
SYLLABUS
 CHRIST THE KING COLLEGE DE MARANDING, INC.
MARANDING, LALA, LANAO DEL NORTE
COMPUTER SCIENCE DEPARTMENT

COURSE SYLLABUS
1ST SEMESTER A.Y. 2023-24

A. CKCM VMGO
CKCM VISION/MISSION We are a Catholic Diocesan learning institution globally recognized for excellence in evangelization, education research, community service and
an agent of peace and environment protection and produces highly competitive God-centered graduates.
GOALS/OBJECTIVES Christ the King College de Maranding aims to:
a. Make Christian Living (CL)/ Religious Studies (RS) as a core of the curriculum
b. Teach, lead and form students to become agents of the new evangelization
c. Strengthen one’s faith through active participation in the Basic Ecclesial Community (BEC), interfaith dialogue, sacraments, devotions,
retreats, recollections, and other religious-related activities.
d. Educate students to readily respond to the needs of the times with creativity and commitment
e. Inculcate social responsibility/stewardship to care for the environment
f. Preserve Filipino culture and values as citizens of our country
g. Integrate Christian values and practice in all instructions and activities with emphasis on the core values of Love, Excellence, Peace, and
Service
h. Adapt teaching pedagogies such as ICT-based instructions, Outcome-Based Education and other innovations
i. Provide high academic standards through comprehensive, integrative course of studies immersed in Christian Spirituality

B. DEPARTMENT GOALS
Computer Science is the study on the concepts and theories, algorithmic foundations, implementations and application and computing solutions.
Goals and Objectives:
1. Students will develop problem-solving and critical thinking skills and use these skills to solve complex computing problems.
2. Students will acquire a working knowledge of the theoretical foundations of computer science.
3. Students will acquire both a working knowledge and a theoretical understanding of the professional practice and formal methodologies of development of large
software projects.
4. Students will acquire communication and interpersonal skills necessary to perform effectively in a technical environment.
 C. COURSE INFORMATION
Course Number -
CS 20 – Discrete Structure 2 (Graphs, Trees, Matrices, Combinatorics, Recurrences)
Descriptive Title
Course Credits 3 Units
Course Component 3 Hours/ Week; 54Hours/ Semester
Course Description This course is an introduction to programming which will provide the students logic and design skills solving
computer problems through the use of conventional techniques such as flowcharting and pseudo-coding. It also
focuses on the implementation, testing and debugging programs through the use of programming constructs.
This course is an introduction to programming which will provide the students logic and design skills solving
computer problems through the use of conventional techniques such as flowcharting and pseudo-coding. It also
focuses on the implementation, testing and debugging programs through the use of programming constructs.
This course is an introduction to programming which will provide the students logic and design skills solving
computer problems through the use of conventional techniques such as flowcharting and pseudo-coding. It also
focuses on the implementation, testing and debugging programs through the use of programming constructs.
Discrete Structures (or Discrete Mathematics) is a foundational course in computer science and mathematics that deals with objects or structures that are
fundamentally discrete rather than continuous.
Learning Outcomes At the end of this course, the students will be able to:
Knowledge
1. Understand the basic definitions, terminologies, and types of graphs, as well as their representations.
2. Grasp the different types of trees, their properties, and their applications in computer science and algorithms.
3. Recognize the importance of matrices in representing data structures like graphs and understand the basic operations and their properties.
Skills
1. Acquire the ability to traverse, analyze, and determine properties of graphs using algorithms like Dijkstra's, Kruskal's, and Floyd-Warshall.
2. Acquire skill to construct, traverse, and manipulate various tree structures, ensuring properties like balance are maintained.
3. Exercise proficiency in performing matrix operations, solving systems of linear equations, and applying matrices in discrete structures.
Values
1. Cultivate a mindset that seeks to break down complex problems into simpler, more manageable components.
2. Value the importance of precise definitions, rigorous proofs, and thorough analysis in the realm of discrete mathematics.
3. Recognize the importance of collaborative problem solving, sharing insights, and learning from peers.
Prerequisite CS 12 – Discrete Structure 1 Co-requisite
Reference/s Required Reading (Textbook)
Discrete Mathematics and its Applications
by: McGraw Hill Education
Other Supplemental
Materials
Course Requirements  The students should attend classes and take well-organized notes.
  There will be a short quiz or actual application at the end of every discussion/ topic, which will serve as evaluation.
 Hands-on Activities are essential in this subject.
 Oral participation in every discussion counts.
Grading System Class Standing 70%: 30% Quizzes, Assignment 10%, Participation 10%, Project 10%, Attendance/Behavior 10%
Major Exam 30%
Total 100%
Teacher Name: IVY M. JAMERO
Class Schedule: WED 1:00 – 4:00 PM
Room: COM LAB 2
Consultation Hours: TF 8:00 – 10:00 am
Room: CONSULTATION OFFICE

D. COURSE OUTLINE
TIME FRAME
OUTLINE
Weeks No. of Hours
PRELIM 1-4 12Hrs
Week 1 – Introduction to Graphs
 Definition, basic terminology, types of graphs
 Representing graphs (adjacency matrix, adjacency list)
 Graph traversals (BSF, DFS)
 Connected components, graph isomorphism

Week 2 – Graphs Algorithms (Part 1)

 Shortest path problem, Dijkstra’s algorithm
 Minimum spanning tree, Kruskal’s algorithm
 Prim’s algorithm
 Topological sorting

Week 3 – Graph Algorithms (Part 2) & Advanced Concepts

 Floyd-Warshall algorithm
 Graph coloring, Euler’s formula
 Hamiltonian and Eulerian paths and cycles
 Week 4 – Graph Application and Assessment
 Applications in computer science, network design, etc.
MIDTERM
Week 5 – Introduction to Trees
 Definition, types of trees
 Binary trees, tree traversal methods
 Balanced trees, AVL trees
 B-Trees, applications in databases

Week 6 – Spanning Trees & Advanced Tree Concept

 Spanning trees, properties
 Algorithms for spanning trees
 Decision trees, applications in machine learning
 Tree-based data structures (e.g., heaps)

Week 7 – Introduction to Matrices

5-9 15Hrs
 Definition, basic operations (addition, multiplication)
 Determinant, inversion
 Systems of linear equations
 Eigenvalues and eigenvectors

Week 8 – Matrices in Discrete Structures

 Adjacency matrices and graph representation
 Incidence matrices
 Matrix applications in transformations
 Special types of matrices (diagonal, orthogonal, etc.)

Week 9 – trees and Matrices Assessment

 Review Sessions
 Assessment/Test on Trees and Matrices
SEMI-FINAL 10-14 15Hrs
Week 10 – Basic Combinatorics
 Introduction, counting principles
 Permutations
  Combinations
 Pigeonhole principle

Week 11 – Advanced Combinatorics

 Binomial theorem, Pascal’s triangle
 Inclusion-Exclusion principle
 Generating functions
 Combinatorial proofs
Week 12 – Introduction to Recurrences
 Definition, basic examples
 Linear recurrences
 Divide and conquer recurrences
 Methods of solving: iteration

Week 13 – Advanced Recurrences

 Master theorem
 Generating functions in recurrences
 Characteristic equations
 Non-linear recurrences

Week 14 – combinatorics & Recurrences Assessment

 Review sessions
 Assessment/Test on Combinatorics and Recurrences
FINAL 15-18 12Hrs
Week 15 – Integration of Topics
 Cased studies combining graphs, trees, matrices, combinatorics, and recurrences
 Advanced applications in computer science

Week 16 – advanced Topics (based on class interest and pace)

 Topics can include game theory, Ramsey theory, advanced graph theory, etc.

Week 17 – Review and Final Project

 Comprehensive review of all topics
 Students work on a final project or presentation
 Week 18 – Final Assessment and Course Closure
 Final project presentations
 Final Exam
Total 18 Weeks 54Hrs

E. LEARNING PLAN

PRELIM
Course Intended Learning Teaching and Learning Assessment Tasks/
Learning Content References/Resources
Outcome Activities Tools
At the end of the class the students  Definitions, terminologies, and types  Lecture  Quiz Required Reading (Textbook)
will be able to: of graphs.  Hands-on workshop  Group Discrete Mathematics and its
 Graph representations.  Group discussion presentation Applications
 Understand the fundamental  Graph algorithms: BFS, DFS,  Examination by: McGraw Hill Education
concepts of graphs, their Dijkstra's, Kruskal's, etc.
types, properties, and
algorithms.

MIDTERM
Course Intended Learning Teaching and Learning Assessment Tasks/
Learning Content References/Resources
Outcome Activities Tools
At the end of the class the students  Tree definitions, types, and  Lecture  Quiz Required Reading (Textbook)
will be able to: properties.  Hands-on workshop  Group Discrete Mathematics and its
 Matrix definitions, operations, and  Group discussion presentation Applications
 Master the concepts of tree properties.  Examination by: McGraw Hill Education
data structures and matrix  Applications of trees and matrices in
operations, and understand computer science.
their applications in discrete
structures.

SEMI-FINAL
 Course Intended Learning Teaching and Learning Assessment Tasks/
Learning Content References/Resources
Outcome Activities Tools
At the end of the class the students  Basic and advanced combinatorial  Lecture  Quiz Required Reading (Textbook)
will be able to: principles.  Hands-on workshop  Group Discrete Mathematics and its
 Introduction to recurrence relations  Group discussion presentation Applications
 Grasp the foundational and and methods to solve them.  Examination by: McGraw Hill Education
advanced principles of
combinatorics and recurrence
relations, and apply them in
problem-solving.

FINAL
Course Intended Learning Teaching and Learning Assessment Tasks/
Learning Content References/Resources
Outcome Activities Tools
At the end of the class the students  Integration of graphs, trees,  Lecture  Quiz Required Reading (Textbook)
will be able to: matrices, combinatorics, and  Hands-on workshop  Group Discrete Mathematics and its
recurrences.  Group discussion presentation Applications
 Integrate knowledge from all  Advanced topics based on class  Examination by: McGraw Hill Education
topics, explore advanced interest.
 Final project
discrete structures concepts, presentation
and demonstrate mastery
 Case studies
through a final assessment.

 POLICIES

1. 3 consecutive 15 minutes late equivalent to 1 absence

2. 3 consecutive absences without valid reasons, equivalent to drop
3. Cellphone must be in silent mode during classes hours
4. Students wearing improper School uniform are not allowed to enter in the classroom
5. No permit no exam policy must be followed
6. A special exam will be given to a student who failed to take it, provided that he has a valid reason and can present a receipt from the Finance Office.

 RUBRICS
Group Presentation Rubric

Criteria Excellent (5) Good (4) Satisfactory (3) Needs Improvement (1-2)

Demonstrates a deep
understanding of the topic; all Demonstrates a good Shows basic understanding with Lacks understanding; many
Content Understanding information is accurate. understanding with minor errors. some misconceptions. inaccuracies present.
Presentation is well-structured, Presentation is organized with Presentation has a basic structure Presentation is disorganized and
Organization & Flow logical, and flows smoothly. minor jumps in flow. but lacks flow. disjointed.
Engages audience effectively; clear Engages audience with some minor Moderate engagement; some Lacks engagement; heavily reliant
Engagement & Delivery articulation and strong delivery. lapses in delivery. reading from slides. on reading slides.

F. INSTITUTIONAL OUTCOMES OF CKCM GRADUATES

Graduate Attributes Performance Indicator

a. God-centered individual imbued with a social training, good spirit and will power to  Model of Christian faith and values in the community
live the Faith and be a Christian witness in the community;
b. Able to attain excellence in evangelization by proclaiming and living out the word of  Evangelize the word of God through words and actions
God;
c. A worthy and responsible citizen of the Philippines who is aware and proud of his/her  Practice nationalism by using Filipino products
collective national identity and able to contribute meaningfully to the development of  Takes pride in his national and ethnic identity by speaking his dialect and practice
Filipino society both at the local and national levels as an agent of peace; Filipino customs and traditions.
d. Global Citizen who recognizes and respects the dignity of all humanity, respects and  Concerned with problems outside the home, community and country
appreciates diversity, and cares about the problems that affect the world and the  Conduct research for the common good.
common good through research;
e. Good Person, imbued with a balanced personality, with its mark being a proper  Possess pleasing personality with desirable values.
balance between the interior and exterior self (things outside self), and an awareness  Presents himself/herself in a dignified manners both in and out of campus.
of the dignity of self and others in a highly competitive world;  Respects the dignity of others.
f. Competent and Committed Graduate, one equipped with the necessary knowledge,  Holistic individual who applies his knowledge, skills and values in improving his quality
skills and values demanded of his profession and committed to the application of of life and those of other stakeholders.
these for service to the community by uplifting their quality of life, by evangelization  Help in the evangelization by participating in literacy programs and extension
and by providing literacy programs; activities.
g. Responsible Citizen, one with an awareness of his relations with, and responsibilities  Relates well with local and global society by performing his responsibilities such as
to the local and global society and commitment to its improvement through the paying taxes and voting wisely.
exercise of professional competence and dedication;
  Use his/her professional competence and dedication in performing his responsibilities
as a CKCM graduate.
h. Environmental Protector, one who is aware of his/her relation to the environment,  Concerned with protecting the environment and care of Mother Earth by practicing
conscious in the care of Mother Earth by creating awareness, preservation of natural solid waste management and care of natural resources.
resources and a committed steward of God’s creations;
i. Instrument of God’s love, one who is compassionate to others unconditionally;  Allows himself/herself to be an instrument of God’s love by showing compassion to all
and showing unconditional love.

G. PROGRAM OUTCOMES
PROGRAM
GRADUATE ATTRIBUTES PROGRAM OUTCOMES PERFORMANCE INDICATOR
OUTCOMES CODE
Apply knowledge of computing fundamentals, knowledge of a Completed and successfully defended
computing specialization and mathematics, science and domain capstone project/thesis in line with the
knowledge appropriate for the computing specialization to the curriculum
Knowledge for solving computing problems CS 001
abstraction and conceptualization of computing models from
defined problems and requirements which creates an engaging,
motivating, intellectually stimulating learning experience.
Identify, analyze formulate, research literature and solve experience Documented Software / hardware
complex computing problems and requirements reaching requirements specification following
Problem / Development of solutions CS 002 substantiated conclusions using fundamental principles of computing Industry Standards
mathematics, computing science and relevant domain discipline that
centered in living out Christs’ values
Design / Development of solutions An ability to apply mathematical foundation, algorithmic principles Designed and developed a computing
and computer science theory in the modeling and design of solution using object-oriented approach
computer- based system in a way that demonstrates comprehension
CS 003 of the tradeoff involved in design choices. Knowledge and
understanding of information security issues in relation to design
and promotes the process of acquiring right values, skills and
behavior
Knowledge and understanding of information security issues in
CS 004 relation to the design, development and use of information
systems
CS 005 Design and evaluate solutions for complex computing
problems, and design and evaluate systems, components, or
processes that meet specified needs with appropriate
 considerations for public health and safety, cultural and
societal, and environmental considerations
Create, select, adapt and apply appropriate techniques resources Used of Integrated Development
and modern computing tools to complex computing activities with Environment
Modern tool usage CS 006
an understanding of the limitation and have the courage to inculcate
social responsibility in order to accomplish common goal
Function effectively as an individual and as a member or leader in Worked in a group to develop a machine
Individual & teamwork CS 007 diverse teams in multidisciplinary settings which commits to bring project
forth authentic love and understanding
Communicate effectively with the computing community and with Presented a proposed solution in class or in a
society at large about complex computing activities be being able to public forum
Communication CS 008 comprehend and write effective reports, design documentation,
make effective presentations and give and understand clear
instruction which create motivating learning experience
An ability to recognize the legal, social ethical and professional issues
involved in the utilization of computer technology and be guided by Immersed / exposed in an actual working
Computing professionalism and ethics CS 009
the adoption of appropriate professional, ethical and legal practices environment in industry
take the risks and act role model to others
Recognize the need, and have the ability to engage in independent
learning for continual development as a computing professional that Created a report on a conducted
Life-long learning CS 010
immersed good values and bring forth truthfulness in strengthening independent learning activity
Christian Education

H. COURSE MAP – CURRICULUM MAP

PRE- CS CS CS CS CS CS CS CS CS CS
COURS UNIT
COURSE TITLE REQUISIT LEARNING OUTCOMES 00 00 00 00 00 00 00 00 00 01
E CODE S
E 1 2 3 4 5 6 7 8 9 0
LO Solve real-world computing problems that require mapping to
1 permutations, combinations of a set, and modular arithmetic
Discrete LO Compute the event probabilities using counting and Bayes
CS 20 CS 12 3 2 Theorem of a sample computing problem. I I I I
Structure 2
LO Solve equations involving recurrences and relate them to
3 recursive algorithm.
Legend: I – Introduce P – Practiced skills with supervision D – Demonstrated skills, without supervision
Prepared by: Recommending Approval: Approved by:

NEIL VINCENT B. CANAMA MARJON D. SENARLO LYDIE D. PADERANGA, Ph.D.

Instructor Program Head VP, Academic Affairs