Misamis University Mu-Ccs-Syl/Ig-Itp2: Office of The Vice President For Academic Affairs

MISAMIS UNIVERSITY Prepared by: Rolysent K.
Paredes Document Code:

Page 1 of 10
Ozamiz City Faculty MU-CCS-SYL/IG-ITP2
Office of the Vice President for Academic Affairs Checked by: Roseclaremath A. Caroro
Revision Date: March 27, 2018 Units:3.0
COLLEGE OF COMPUTER STUDIES Dean
Reviewed by: Dr. Cynthia S. Superable
SYLLABUS/INSTRUCTOR’S GUIDE Revision No.:1 Subject: ITP2
VPAA
Prerequisite: None Co-requisite: None
Descriptive Title: DISCRETE MATHEMATICS
MU-ACA-041/22 March 2018
A. COURSE SYLLABUS DETAILS
COURSE TITLE DISCRETE MATHEMATICS

This course introduces the ideas and techniques used in providing solutions to computing problems and proofs. This course
provides students with a working knowledge on sets, functions and relations; proof techniques; basic logic and graph theory. This
course teaches the students on how to think analytically, logically and mathematically and apply these techniques in solving
problems.
In the attainment of the university’s vision, mission and objectives, this course develop students to become professionally
COURSE DESCRIPTION
competent and socially concerned in exercising the use of the information technology tools with ethical considerations and
standards. Furthermore, it also trains students’ to be globally competitive through understanding the culture, ethnicity and history.
On a larger view, this course promotes the attainment of the university’s core values: honesty, integrity, loyalty and excellence.
At the end of the course, the student is expected to present a portfolio on various computing problem solutions required in the
course.
CREDIT UNITS 3.0
CONTACT HOURS 3 hours per week lecture
PRE-REQUISITE None
None
CO-REQUISITE
COURSE EVALUATION Percentage

MISAMIS UNIVERSITY Prepared by: Rolysent K. Paredes Document Code:
Page 2 of 10
VPAA
Periodical Examinations (Prelim, Midterm, Semifinals & Finals) - 50

Class Standing, Quizzes, Unit Test, Reports, Researches, Involvement/
Recitation/Oral Exam/Discussion, Application, Performance,
Manipulation of Equipment, Exercises and other forms of - 40
practical testing peculiar to the course
Class Participation (using Class Participation Rubric) - 10
Total 100
REFERENCES
Printed:
R1: Biswal, Purna Chandra. Discrete Mathematics and Graph Theory. 3rd edition. PHI Learning. 2013
R2: Epp, Susanna S. Discrete Mathematics. Philippine edition. Cengage Learning. 2012
R3: Krantz, Steven G. Discrete Mathematics Demystified. McGraw-Hill. 2009
R4: Ferland, Kevin. An Introduction to Proofs and Combinatorics. Brooks, Coli. 2009
R5: Rosen, Kenneth H., Discrete Mathematics and its Applications, Sixth Edition, McGraw-Hill Co. Inc., NY, 2008
R6: Stanoyevitch, Alexander. Discrete structures with contemporary applications. 2011
Online:
W1: Permutation Groups. Available at http://www1.spms.ntu.edu.sg/~frederique/lecture7ws.pdf
W2: Sets, Relations and Functions, Sequences, Sums, Cardinality of Sets . Available at http://www.inf.ed.ac.uk/teaching/courses/dmmr/slides/13-14/Ch2.pdf
Page 3 of 10
VPAA
W3: Permutations. Available at http://cs-people.bu.edu/lapets/235/
W4: Counting and Probability. Available at http://math.slu.edu/~freeman/Discrete_Lecture_19.pdf
W5: Online Database for Journals and Research Articles
www.proquest.com
Username : MURESEARCH
Password : MULIBRARY
B. COURSE ALIGNMENT MATRIX
Program Outcomes Course Outcomes Learning Outcomes

PO1: Demonstrate the computing, science and CO1: Analyze mathematical situations involving LO1.1: Calculate the binomial coefficient in getting the
mathematics knowledge and skills appropriate to the IT binomial coefficient proofing techniques, and sets. value in a Pascal triangle.
discipline.
LO1.2: Determine the correctness of a mathematical
PO2: Use IT best practices and standards and their solution by utilizing mathematical induction, direct proof
applications in the global perspective. and indirect proof.
PO3: Demonstrate sound analysis on complex LO1.3: Perform set operations based on the given set
problems, and identifying and defining the computing problems.
requirements and solutions to discipline-related
problems. LO1.4: Illustrate in a Venn diagram representation the
given sets and subsets.
Page 4 of 10
VPAA
CO2: Provide solutions on computing problems related LO2.1: Determine the number of combinations or
to counting principles and matrices. permutations of the given situations that involve
principles of product, sum, subtraction, division, and
pigeonhole.
LO2.2: Utilize matrix arithmetic; transpose matrix,

power matrix and zero-one matrix in solving varied
problems.
CO3: Provide solutions on computing problems related

to mathematical relations and functions. LO3.1: Identify the different properties of a relation.
LO3.2: Perform operations on relations on sets,

equivalence relations and partitions.
LO3.3: Illustrate relations in digraphs.
LO3.4: Analyze the characteristics of One-to-One and

Onto, Inverse, Composite, and Functions as Relations.
LO3.5: Solve problems involving One-to-One and Onto,

Inverse, Composite, and Functions as Relations.
CO4: Provide solution on computing problems related to

graphs. LO4.1: Solve problem situations involving different
types of graph models.
Page 5 of 10
VPAA
LO4.2: Solve problem situations involving isomorphic

graphs.
LO4.3: Solve problem situations involving graph

connectivity.
LO4.4: Solve problem situations involving shortest path

algorithms.
Page 6 of 10
VPAA
(PRELIM: 13.5 Hours)
Teaching Learning Activities Resources/

Learning Outcomes Content TA Assessment
Classroom References
LO1.1: Calculate the Binomial Coefficient 3 hrs  Slide presentation  Pen-and-paper R1 p. 78
binomial coefficient in - Pascal Triangle  Interactive discussion assessment R5 pp. 366 – 367
getting the value in a Pascal  Graded output R6
triangle. presentation W5
LO1.2: Determine the Proof Techniques 3 hrs

correctness of a - Mathematical Induction
mathematical solution by - Direct Proof
utilizing mathematical - Indirect Proof
induction, direct proof and
indirect proof.
LO1.3: Perform set Sets 6 hrs  Slide presentation  Pen-and-paper R1 pp. 1 – 36; 45 –
operations based on the - Subsets  Interactive discussion assessment 70
given set problems. - Set Operations  Graded output R3 pp. 23 – 40
- Venn Diagram presentation R4 pp. 69 - 93
LO1.4: Illustrate in a Venn R5 pp. 263 – 279
diagram representation the R6
given sets and subsets. W2
W3
PRELIM EXAMINATION
Page 7 of 10
VPAA
(MIDTERM: 13.5 Hours)

LO2.1: Determine the Counting Principles 6 hrs  Slide presentation  Pen-and-paper R1 pp. 71 – 131;
number of combinations or - Product Rule  Interactive discussion assessment 569 – 625
permutations of the given - Sum Rule  Graded output R3 pp. 105 – 134
situations that involve - Subtraction Rule presentation R4 pp. 303 – 357;
principles of product, sum, - Division Rule 364 – 410
subtraction, division, and - Pigeonhole Principle R5 pp. 335 – 385
pigeonhole. - Permutation R6
- Combination W1
W3
W4
W5
LO2.2: Utilize matrix Matrix 6 hrs  Slide presentation  Pen-and-paper R3 pp. 135 – 162
arithmetic; transpose - Matrix Arithmetic  Interactive discussion assessment R1 pp. 246 – 254
matrix, power matrix and - Transpose and Power  Graded output R6
zero-one matrix in solving Matrices presentation W5
varied problems. - Zero-One Matrices
MIDTERM EXAMINATION
Page 8 of 10
VPAA
(SEMI FINAL: 13.5 Hours)

LO3.1: Identify the Relations 6 hrs  Slide presentation  Pen-and-paper R1 pp. 205 262
different properties of a - Properties of a Relation  Interactive discussion assessment R2 pp. 205 – 262
relation. - Relations on Sets  Graded output R3 pp. 51 – 66
- Equivalence Relation and presentation R4 pp. 222 – 294
LO3.2: Perform operations Partition R5 pp. 519 – 587
on relations on sets, - Digraphs R6
equivalence relations and W2
partitions. W5
LO3.3: Illustrate relations

in digraphs.
LO3.4: Analyze the Functions 6 hrs  Slide presentation  Pen-and-paper R1 pp. 205 – 262
characteristics of One-to- - One-to-One and Onto  Interactive discussion assessment R2 pp. 154 – 204
One and Onto, Inverse, Functions  Graded output R3 pp. 51 – 66
Composite, and Functions - Inverse Function presentation R5 pp. 133 – 146
as Relations. - Composite Function R6
- Functions as Relations W5
LO3.5: Solve problems
involving One-to-One and
Onto, Inverse, Composite,
and Functions as Relations.
SEMIFINAL EXAMINATION
Page 9 of 10
VPAA
(FINAL: 13.5Hours )

LO4.1: Solve problem Graph 12 hrs  Slide presentation  Pen-and-paper R1 pp. 263 – 335
situations involving - Graph Models  Interactive discussion assessment R3 pp. 163 – 182
different types of graph - Types of Graphs  Graded output R4 pp. 415 – 489;
models. - Graph Isomorphism presentation 497 – 551
- Graph Connectivity  Case study R6
LO4.2: Solve problem - Shortest Path Problem W5
situations involving
isomorphic graphs.
LO4.3: Solve problem

situations involving graph
connectivity.
LO4.4: Solve problem

situations involving shortest
path algorithms.
FINAL EXAMINATION
Page 10 of 10
VPAA
Prepared by: Checked by:
ROLYSENT K. PAREDES, DIT ROSECLAREMATH A. CARORO, DIT

Faculty Dean
Verified by:
VILMA N. DINGLASA
University Librarian
Reviewed by:
CYNTHIA S. SUPERABLE, DScN

VPAA

Misamis University Mu-Ccs-Syl/Ig-Itp2: Office of The Vice President For Academic Affairs

Uploaded by

Copyright:

Available Formats

Misamis University Mu-Ccs-Syl/Ig-Itp2: Office of The Vice President For Academic Affairs

Uploaded by

Document Information

Original Title

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

Misamis University Mu-Ccs-Syl/Ig-Itp2: Office of The Vice President For Academic Affairs

Uploaded by

Copyright:

Available Formats

MISAMIS UNIVERSITY Prepared by: Rolysent K.

Paredes Document Code:

A. COURSE SYLLABUS DETAILS

COURSE TITLE DISCRETE MATHEMATICS

CONTACT HOURS 3 hours per week lecture

COURSE EVALUATION Percentage

Periodical Examinations (Prelim, Midterm, Semifinals & Finals) - 50

R3: Krantz, Steven G. Discrete Mathematics Demystified. McGraw-Hill. 2009

R6: Stanoyevitch, Alexander. Discrete structures with contemporary applications. 2011

W3: Permutations. Available at http://cs-people.bu.edu/lapets/235/

W4: Counting and Probability. Available at http://math.slu.edu/~freeman/Discrete_Lecture_19.pdf

W5: Online Database for Journals and Research Articles

B. COURSE ALIGNMENT MATRIX

Program Outcomes Course Outcomes Learning Outcomes

LO2.2: Utilize matrix arithmetic; transpose matrix,

CO3: Provide solutions on computing problems related

LO3.2: Perform operations on relations on sets,

LO3.3: Illustrate relations in digraphs.

LO3.4: Analyze the characteristics of One-to-One and

LO3.5: Solve problems involving One-to-One and Onto,

CO4: Provide solution on computing problems related to

LO4.2: Solve problem situations involving isomorphic

LO4.3: Solve problem situations involving graph

LO4.4: Solve problem situations involving shortest path

(PRELIM: 13.5 Hours)

Teaching Learning Activities Resources/

LO1.2: Determine the Proof Techniques 3 hrs

(MIDTERM: 13.5 Hours)

Teaching Learning Activities Resources/

(SEMI FINAL: 13.5 Hours)

Teaching Learning Activities Resources/

LO3.3: Illustrate relations

Teaching Learning Activities Resources/

LO4.3: Solve problem

LO4.4: Solve problem

Prepared by: Checked by:

ROLYSENT K. PAREDES, DIT ROSECLAREMATH A. CARORO, DIT

CYNTHIA S. SUPERABLE, DScN

You might also like