CEBU INSTITUTE OF TECHNOLOGY – UNIVERSITY

N. Bacalso Avenue, Cebu City, Philippines

COLLEGE OF COMPUTER STUDIES

Course Number : CSIT112

Descriptive Title : Discrete Structures 1
Number of Units/ Credits : 3 units
Number of Hours : 54 hours
Pre-requisite : none
Co-requisite : none
Course Description : This course is a survey and development of the theoretical tools suitable for algorithmic applications and the mathematics needed for success in computer
science. As such, the course will address a variety of topics, including propositional and predicate logic, proof techniques, mathematical induction, set theory, relations, functions, matrices and
determinants, and counting principles.

CIT UNIVERSITY
CIT Graduate Attributes Code CIT Graduate Outcomes
VISION STATEMENT
WE ENVISION TO BE A Act in accordance with moral and ethical principles personally and
Ethical and values-driven IO1
TOP Philippine University in 2025 professionally
TRUSTED EDUCATION PROVIDER OUTCOMES-BASED INSTITUTION OF PEOPLE-ORIENTED ORGANIZATION
RESEARCH AND LEARNING Competent and Technology- Apply knowledge of science, mathematics, and technology in life and
IO2
oriented professional practice
MISSION STATEMENT
Critical thinker and problem
We GEAR for Life. IO3 Practice creative and critical thinking skills in solving real-life problems
solver
CIT commits to:
Guide learners to become industry-preferred and life ready professionals
Conduct research, create new things, and act capably in complex
Empower people for knowledge generation and creativity Innovative IO4
situations
Accelerate community development
Respond proactively to a fast-changing world
Effective communicator IO5 Communicate effectively in spoken, written, visual, and other forms
CORE VALUES
 CULTURE OF EXCELLENCE A commitment to go beyond the ordinary; steadfast in delivering
Work productively as an individual or as a member or leader of a multi-
data-driven, value-optimized and client-centric service Team player and manager IO6
disciplinary and multi-cultural team
 INTEGRITY Uncompromising adherence to moral and ethical principles
 TEAMWORK Promoting a culture of collaboration and empowerment/ Commitment to
purposeful collaboration to advocate for innovative solutions Lifelong learner IO7 Engage in lifelong learning for personal and professional development
 UNIVERSALITY Regard for the welfare of people and nature/ Respect for all and
stewardship of God's creation / Promotion of common good of, by and for all

STATEMENT OF CORE COMPETENCY Use, develop, and integrate knowledge and skills across disciplines for
Well-rounded citizen IO8
Science & Technology is a way of academic life among administrators, faculty, and students. In the nation building and effective global citizenship
design, administration, and implementation of curricular programs, technology is embedded,
articulated, and actuated.
College of Computer Studies
CCS Graduate
CCS Code CCS Graduate Outcomes
Attributes
Vision

A leading Center of Excellence in Computing Education Computing

Act in recognition of professional, social, and
Professionalism and CCS1
Mission ethical responsibility
Ethics

To provide quality industry-standard computing education

Modern Tool Usage CCS2 Utilize modern computing tools
Goal
To produce values-driven, industry-preferred and competent computing professionals through:
proficient, supportive and highly-trained faculty; appropriate facilities; programs and pedagogy
responsive to the community; as well as a culture that encourages Creativity, Innovation, and Analyze complex problems, and identify and
Team-work Problem Analysis CCS3 define the computing requirements needed to
design an appropriate solution

Bachelor of Science in Computer Science (BSCS)

The BS Computer Science program includes the study of computing concepts and theories, Design/
Design and develop computing solutions using a
algorithmic foundations and new developments in computing. The program prepares students to Development of CCS4
system-level perspective
design and create algorithmically complex software and develop new and effective algorithms for Solutions
solving computing problems.

The program also includes the study of the standards and practices in Software Engineering. It
prepares students to acquire skills and disciplines required for designing, writing and modifying Effectively communicate orally and in writing
software components, modules and applications that comprise software solutions. Communication CCS5
using both English and Filipino

Individual & Team Work effectively and independently in multi-

Bachelor of Science in Information Technology (BSIT) CCS6
Work disciplinary and multi-cultural teams
The BS Information Technology program includes the study of the utilization of both hardware and
software technologies involving planning, installing, customizing, operating, managing and
administering, and maintaining information technology infrastructure that provides computing Articulate and discuss the latest developments in
Life-Long Learning CCS7
solutions to address the needs of an organization. the specific field of practice

The program prepares graduates to address various user needs involving the selection,
development, application, integration and management of computing technologies within an Knowledge for
Apply computing and other knowledge domains to
organization. Solving Computing CCS8
address real-world problems
Problems
Course Learning Outcomes (CLO):

At the end of the course, the students are able to: P.O. / S.O. Code Links

CLO1.Appreciate the importance of the course in relation to the goals and objectives of the program, the College and the University CCS7

CLO2.Perform the operations associated with Sets, Functions and Relations, and relate these operations to computer programming CCS8

CLO3.Construct sound arguments in propositional and predicate logic by applying appropriate rules of inference given sample intelligent CCS3
software

CLO4.Construct valid mathematical proofs using mathematical induction, direct proof and proof by contradiction to simplify programs and CCS3
prove program correctness

Course Outline:

Intended Learning Outcome (ILO) CLO1 CLO2 CLO3 CLO4 Content Teaching Learning Assessment Time Frame
Activities (TLA) Tools/ Tasks
ILO1. Observe class policies and 1.1 CIT and CCS VMGO - Lecture Recitation
guidelines 1 1 1 - Discussion Board Works 12
1.2 Course Syllabus / Outline Quizzes
ILO2. Appreciate the importance of the Assignments
course content in relation to software 1.3 Class Policies and Requirements
development
1.4 Logic
ILO3. Apply formal methods of symbolic
propositional and predicate logic. 1.5 Propositional Equivalences

ILO4. Describe how formal tools of 1.6 Predicates and Quantifiers

symbolic logic are used to model
algorithms and real life situations.

ILO5. Use formal logic proofs and logical

reasoning to solve problems such as
puzzles.

ILO6. Demonstrate understanding on the

truth values and English translations of
quantified statements.

ILO1. Show what makes up a correct 2.1 Rules of Inference

mathematical argument. 3 3 3 - Lecture Recitation 10
2.2 Rules of inference for quantified - Interactive Board Works
statements Discussion Quizzes
 Intended Learning Outcome (ILO) CLO1 CLO2 CLO3 CLO4 Content Teaching Learning Assessment Time Frame
Activities (TLA) Tools/ Tasks
ILO2.Demonstrate the tools in - Problem Solving Assignments
constructing mathematical arguments. 2.3 Methods of Proving Theorems

ILO3.Illustrate how to use the methods of 2.4 Proof by Mathematical Induction

proof to verify that programs are correct,
making inferences in artificial intelligence.

ILO4. Show examples of proof by

mathematical induction.
ILO1. Explain with examples the basic 3.1 Sets - Lecture Recitation
terminology of sets, functions, and 3 3 - Interactive Board Works
relations. 3.2 Set Builder Notations Discussion Quizzes 18
- Problem Solving Assignments
ILO2. Perform the operations associated 3.3 Set Operations And Identities
with sets, functions, and relations.
3.4 Computer Representation of Sets
ILO3. Relate practical examples to the
appropriate set, function, or relation 3.5 Functions
model, and interpret the associated
operations and terminology in context. 3.6 Relations

ILO1. Discuss the basic concepts of 4.1 Sequences and Summations - Lecture Recitation
sequences and summations 3 3 3 - Interactive Board Works 4
4.2 The Growth of Functions Discussion Quizzes
ILO2. Demonstrate how to formulate rules - Problem Solving Assignments
for specific sequences

ILO3. Illustrate counting of events using

summations.

ILO4. Show how to use the different

notations for describing the growth of
functions
ILO1. Demonstrate the applications of 5.1 The Well Ordering Property - Lecture Recitation
mathematical induction to computer 3 2 3 - Interactive Board Works 4
science. 5.2 Proof by Mathematical Induction Discussion Quizzes
- Problem Solving Assignments
ILO2.Show examples of proof by (Advance Topic)
mathematical induction. 5.3 Second Principle of Mathematical
Induction
ILO3. Define sequences, functions, and
sets using recursion. 5.4 Recursive Definition and Recursive
Algorithms
 Intended Learning Outcome (ILO) CLO1 CLO2 CLO3 CLO4 Content Teaching Learning Assessment Time Frame
Activities (TLA) Tools/ Tasks
ILO4. Illustrate the proof of correctness of
programs. 5.5 Program Correctness

ILO1. Demonstrate the algorithms for - Lecture Recitation

solving different types of problems, e.g. 2 2 2 (Advance Topic) - Interactive Board Works 1
finding the largest number, etc. 6.1 Algorithms Discussion Quizzes
- Problem Solving Assignments
ILO2. Illustrate the development of 6.2 Complexity of Algorithms
algorithms for finding the greatest
common divisor of two integers, etc. 6.3 The Integers and Division

ILO3. Demonstrate the analysis of the 6.4 Integers and Algorithms

complexity of algorithms.

ILO4. Discuss the basic concepts of

number theory, the study of integers
ILO1. Demonstrate the applications of - Lecture Recitation
number theory in hashing functions, the 2 2 2 (Advance Topic) - Interactive Board Works 1
generation of pseudorandom numbers, 7.1 Applications of Number Theory Discussion Quizzes
and shift ciphers. - Problem Solving Assignments

ILO2.Use a method for performing

arithmetic with large integers and
cryptosystem

ILO3.Show how to solve systems of linear

congruence modulo pairwise relatively
prime integers
ILO1. Describe the basic matrix arithmetic (Advance Topic) - Lecture Recitation
that will be used in algorithms. 2 2 2 8.1 Introduction to Matrices - Interactive Board Works 1
Discussion Quizzes
ILO2. Demonstrate the use of 8.2 Matrix Arithmetic - Problem Solving Assignments
determinants in solving systems of linear
equations. 8.3 Determinants

8.4 Solution of equations using

determinants

ILO1. Describe the basic counting (Advance Topic) - Lecture Recitation

techniques 2 2 2 9.1 The basics of Counting - Interactive Board Works 1
Discussion Quizzes
ILO2. Explain and use the pigeonhole 9.2 The Pigeonhole Principle - Problem Solving Assignments
principle
 Intended Learning Outcome (ILO) CLO1 CLO2 CLO3 CLO4 Content Teaching Learning Assessment Time Frame
Activities (TLA) Tools/ Tasks
9.3 Permutations and Combinations
ILO3. Illustrate counting of elements of
permutations and combinations

ILO4. Compute permutations and

combinations of a set, and interpret the
meaning in the context of the particular
application.

ILO1. Explain finite probability, the (Advance Topic) - Lecture Recitation

probability of combinations of events, and 2 2 10.1 Discrete Probability - Interactive Board Works 1
probabilistic reasoning. Discussion Quizzes
10.2 Probability Theory - Problem Solving Assignments
ILO2. Compute and explain the
assignment of probability, conditional
probability, independence of events,
random variables, and expected values.
ILO1. Show how to solve counting (Advance Topic) - Lecture Recitation
problems where elements may be used 2 2 11.1 Generalized Permutations and - Interactive Board Works 1
more than once. Combinations Discussion Quizzes
- Problem Solving Assignments
ILO2. Demonstrate how to solve counting 11.2 Generating Permutations and
problems in which some elements are Combinations
indistinguishable

Legend: Whether the CLO is addressed by the content/topic.

1 – Slightly Addressed 2 – Moderately Addressed 3 – Substantially Addressed

Instructional Resources/ Textbook

References:

PRINTED RESOURCES

[1] K. H. Rosen, Discrete Mathematics and Its Applications. 8th ed. New York, N.Y. : McGraw-Hill, 2019. 511 R7226 2019

[2] Theory, Practice and Techniques in Discrete Mathematics. New York, NY: 3G E-Learning LLC, 2018. 511.1 T3433 2018

[3] B. Kolman, R. Busby and S. Ross. Discrete Mathematical Structures. London: Pearson, 2014. 511.6 K834 2014

[4] K. Patrai, Discrete structures. New Delhi: S. K. Kataria & Sons, 2012. 0040151 P274 2012

[5] A. Stanoyevitch, Alexander, Discrete Structures with Contemporary Applications. Boca Raton, FL: CRC Press, 2011. 004.0151 St25 2011

[6] K. H. Rosen, Discrete Mathematics and Its Applications. Boston: McGraw-Hill Higher Education, 2007. 511 R722 2007

ONLINE RESOURCES

[1] S. Sridharan and R. Balakrishnan, Discrete Mathematics: Graph Algorithms, Algebraic Structures, Coding Theory, and Cryptography. CRC Press, 2020. [E-book]
Available: ZLibrary.

[2] S. Sinha, Discrete Mathematical Algorithm, and Data Structure. Leanpub.com, 2020. [E-book] Available: ZLibrary.

[3] B. V. Senthil and H. Duta. Discrete Mathematical Structures: A Succinct Foundation (Mathematics and Its Applications: Modelling, Engineering, and Social Sciences).
Taylor & Francis Ltd, 2019. [E-book] Available: ZLibrary.

[4] V. Diekert, M. Kufleitner, G. Rosenberger, U. Hertrampf, Discrete Algebraic Methods : Arithmetic, Cryptography, Automata and Groups. Berlin: De Gruyter, 2016.
[E-book] Available: EBSCOHOST.

[5] M. Smid, Discrete Structures for Computer Science: Counting, Recursion, and Probability, 2016. [E-book] Available: ZLibrary.

[6] S. B. Gupta, Discrete Mathematics and Structures. 6th ed. Laxmi Publications Pvt Ltd., 2015. [E-book] Available: EBSCOHOST.

[7] J.L. Gersting, Mathematical Structures for Computer Science: Discrete Mathematics and Its Applications. W.H. Freeman and Company, 2014. [E-book]
Available: ZLibrary.

[8] N. Mansour, Search Algorithms and Application. IntechOpen, 2011. [E-book] Available: DOAB.
 I hereby certify that the references cited above are available in the Learning Resource and Activity Center.

MRS. RAINERA C. BOHOLST

University Librarian

Internet Sources:
https://www.coursera.org/search?query=discrete%20mathematics&
https://www.codecademy.com/learn/discrete-math
https://www.edx.org/learn/discrete-mathematics
https://calcworkshop.com/discrete-math/

Course Requirements:

Class Attendance
Lecture / Clasroom Activities Notebook
Major Examinations(Preliminary, Midterm, Pre-finals & Finals)
Assignments
Quizzes
Seatworks / Homeworks / Boardworks /
Group Activity

Grading System:

FG (Final Grade) = transmuted FS

MG (Midterm Grade) = transmuted MS
FS (Final Score) = (Lec1 + Lec2) / 2
MS (Midterm Score) = Lec1
Lec1 (Lecture Score (start to midterm)) = 0.4*CS1 + 0.2*PE + 0.4*ME
Lec2 (Lecture Score (midterm to finals) ) = 0.4*CS2 + 0.2*PFE + 0.4*FE

where:
CS1 = Class Standing during midterm period
 (quizzes, homework, seatwork, reports)
CS2 = Class Standing after the midterm period
PE = Prelim Exam
ME = Midterm Exam
PFE = Pre-final Exam
FE = Final Exam

Syllabus Revision:

Version Adapted : October 2018

Revisions Made : November 8, 2023

Prepared by : Elmer A. Maravillas, PhD.

Updated by : Catherine N. Arellano

Adapted by :

Approved by : Prof. Cherry Lyn C. Sta. Romana

Dean, College of Computer Studies