College of Computer Sciences

Course Code: DS 101 Faculty: Prof. C.Y.P

Course Title: Fundamental Concepts of Mathematics Consultation Hour: 3:30-4:30/MWF
Credit Units: 3 units
Course Description:
This course covers sets, principles of logic, methods of proof, relations, functions, integers, binary operations, complex
numbers, matrices and matrix operations, and an introduction to mathematical systems.
Course Outcomes:
At the end of the course, the learners will be able to:
 Know the basic terms, symbols and formulas to be applied in the fundamental concepts of mathematics.
 Understand the significance of sets, principles of logic, methods of proof, relations, functions, integers and
binary operations.
 Solve problems involving complex numbers, matrices and matrix operations and mathematical systems.

TIME TOPICS Learning Outcome/s Methodologies/Strategies Resources Assessment

 At the end of the learning
experience, learners will be
able to:

WEEK 1  SPC and College of  Recognize and accept  Interactive Discussion SPC and College of Evaluative tools
Computer Sciences the vision, mission and  One-on-one approach Computer Sciences such as:
to Vision, Mission, Core core values of SPC and through exercises Vision, Mission, Core
Values, Philosophy, the Philosophy and  Group Sharing Values, Philosophy,  Recitation
WEEK 2 Goals and Objectives. objectives of the responses Goals and Objectives.  Exercises
 Basic definitions and department.  Peer Teaching  Quiz
rotation  Define Salient Textbooks- Discrete  Test
 Set operations, terminologies about mathematics and its
algebra of sets sets and basic rotation applications.
 Venn Diagram about sets
 Counting properties  Identify set operations
of finite sets and algebra of sets.
 Solve problems by
applying the counting
properties of finite
sets.

TIME TOPICS Learning Outcome/s Methodologies/Strategies Resources Assessment

 Principles of Logic At the end of the
 Statements, learning experience,
WEEK 3 logical learners will be able  Interactive Discussion SPC and College of Evaluative tools
connectives to:  One-on-one approach Computer Sciences such as:
to  Validity, Truth  Recognize through exercises Vision, Mission, Core
Tables. statements  Group Sharing Values, Philosophy,  Recitation
WEEK 5  Tautologies and logical responses Goals and Objectives.  Exercises
 Quantifiers connectives,  Peer Teaching  Quiz
validity and Textbooks- Discrete  Test
truth tables. mathematics and its
 Understand applications.
the
principles of
logic in
tautologies
and
quantifiers.

PRELIMINARY EXAMINATION

TIME TOPICS Learning Outcome/s Methodologies/Strategies Resources Assessment

 Methods of Proof At the end of the learning
 Direct Proof experience, learners will be
 Indirect proof able to:  Interactive Discussion SPC and College of Evaluative tools
 Proof by  Differentiate direct  One-on-one approach Computer Sciences such as:
WEEK 6 specialization and proof from indirect through exercises Vision, Mission, Core
division into proof.  Group Sharing Values, Philosophy,  Recitation
to cases.  Evaluative responses Goals and Objectives.  Exercises
 Mathematical mathematical  Peer Teaching  Quiz
WEEK 7 induction statements using proofs Textbooks- Discrete  Test
by specialization and mathematics and its
division into case applications.
 Solve problems using
mathematical
inductions
Relations  Define relations
 Definition  Identify
WEEK 8  Equivalence equivalence SPC and College of
relations relations,  Interactive Discussion Computer Sciences Evaluative tools
to  Equivalence equivalence classes  One-on-one approach Vision, Mission, Core such as:
classes and and partitioning. through exercises Values, Philosophy,
WEEK 10 partitioning.  Evaluate  Group Sharing Goals and Objectives.  Recitation
 Partial Ordering mathematical responses  Exercises
problems by partial  Peer Teaching Textbooks- Discrete  Quiz
ordering. mathematics and its  Test
applications.

MIDTERM EXAMINATION
 TIME TOPICS Learning Outcome/s Methodologies/Strategies Resources Assessment
Functions At the end of the learning
 Injections, experience, learners will
surjection, be able to:  Interactive Discussion SPC and College of Evaluative tools
bijection  Identify injections,  One-on-one approach Computer Sciences such as:
WEEK 11  Image, inverse surjection and through exercises Vision, Mission, Core
image bijection  Group Sharing Values, Philosophy,  Recitation
to  Inverse function  Differentiate responses Goals and  Exercises
 Cardinal number image and inverse  Peer Teaching Objectives.  Quiz
WEEK 12 of a set image  Test
 Counting  Explain inverse Textbooks- Discrete
principles function, cardinal mathematics and its
 Countable and number of a set, applications.
uncountable sets counting principles
and countable and
uncountable sets
Integers  Define integers  Interactive Discussion SPC and College of Evaluative tools
 Divisibility  Understand  One-on-one approach Computer Sciences such as:
WEEK 13  Division divisibility, division through exercises Vision, Mission, Core
Algorithm algorithm and  Group Sharing Values, Philosophy,  Recitation
to  Euclidean Euclidean responses Goals and  Exercises
Algorithm algorithm  Peer Teaching Objectives.  Quiz
WEEK 15  Fundamental  Apply the  Test
Theorem of fundamental Textbooks- Discrete
Arithmetic theorem of mathematics and its
Arithmetic in applications.
solving problems
about integers.

SEMI – FINAL EXAMINATION

TIME TOPICS Learning Outcome/s Methodologies/Strategies Resources Assessment
 Binary Operations At the end of the  Interactive Discussion SPC and College of Evaluative tools
 Definitions learning experience,  One-on-one Computer Sciences such as:
 Modular learners will be able approach through Vision, Mission,
Operation to: exercises Core Values,  Recitation
 Operations  Define Binary  Group Sharing Philosophy, Goals  Exercises
on matrices Operations responses and Objectives.  Quiz
WEEK 16  Operations and modular  Peer Teaching  Test
on Complex operations. Textbooks- Discrete
to numbers  Solve mathematics and its
problems applications.
WEEK 18 Introduction to using the
Mathematical operations
Systems on matrices
 Semi group and complex
 Group numbers.
 Ring  Define and
 Field distinguish
mathematical
systems such
as semi-
group, group,
ring and field

FINAL EXAMINATION
References:

 Rosen, Kenneth H (2019) - Discrete mathematic and applications. 8th Ed. New York; McGraw Hill.
 Johnsonbaugh, Richard (2018) - Discrete Mathematics, 8th Ed. London; Pearson.
 Malik, D.S. (2014) – Discrete Mathematical Structures: Theory and application. Andover; Cengage Learning
 Sirug, Winston S. (2014)- College Algebra. Manila, Mindshapers.

Grading System:

Class Standing consisting of: 60%

Quizzes 25%
Recitation 15%
Course Requirement 10%
Attendance and Decorum 10%
Extra and Co-Curricular Activities 10%
Periodical Examinations 40%
Total 100%
 APPROVAL SHEET

Prepared by: Noted by:

Faculty Chief Librarian

Recommending Approval: Approved by:

Dean, College of Business Administration VP for Academic Affairs

Date: ________________________