Republic of the Philippines

POLYTECHNIC UNIVERSITY OF THE PHILIPPINES

College of Engineering
Department of Computer Engineering

Course Title : DISCRETE MATHEMATICS

Course Code : COEN 3313

Course Credit : 3 units

Pre-Requisite : MATH 2013 (COLLEGE ALGEBRA)

Course Description : This course is an introduction to the mathematical structures and concepts used in computing: sets, mathematical induction, ordered sets, Boolean algebras, predicate
calculus, graphs, trees and relations. Formal and informal theories and corresponding mathematical proofs are also taught.

Institutional Learning Outcomes Program Outcomes Course Objectives

1. Creative and Critical Thinking
2. Effective Communication
3. Strong Service Orientation
4. Community Engagement
5. Adeptness in the Responsible Use of Technology
6. Passion to Life-Long Learning
7. High Level of Leadership and Organizational Skills
Use of contemporary problem solving in the analysis, design, and evaluation After completing the course, the student
of computer and software systems, including system integration and must be able to:
implementation.
Communicate effectively with the computing community and with society at
large (in local and international scenes) about engineering activities by  Understand the important concepts of
being able to comprehend and write effective reports, design documentation, discrete mathematics such as sets,
make effective presentations, and give and understand clear instructions. mathematical induction, Boolean
Share expertise in literacy, productivity, and livelihood technology to the algebras, predicate calculus, graphs,
adopted community number theory, counting theory,
probability, trees and relations.
Use the techniques, skills and modern computer engineering tools necessary
for engineering practice.
Engage in life-long learning and an understanding of the need to keep current
of the developments in the specific field of practice.
Knowledge and understanding computer engineering and management  Learn to apply these concepts to solve
computational problems in various
principles as a member and a leader in a team, to manage projects and in
domains
multidisciplinary environment.

8. Sense of Personal and Professional Ethics Recognition of professional, social, and ethical responsibility
9. Sense of Nationalism and Global Responsiveness The broad education necessary to understand the impact of computer
engineering solutions in global and societal context.
COURSE PLAN

Week Topic Learning Outcomes Methodology Resources Assessment

Orientation
Week 1 Class orientation Familiarize student on Outcome-Based Course Syllabus None
Discussion of course goals, Education Review of the syllabus,
expected outcomes, course learning activities and
policies and grading system Orient the student on the course assessment
Assigning of Groups and syllabus, grading system and
Officers classroom rules Getting to know activity

Mathematical Reasoning
Week 2 - 4
 Propositions and
tautologies
 Logical Connectives and
Truth tables
 Proposition Algebra
 Rule of Inference
 Direct and Indirect Proof
 Mathematical Induction
Express statements with the precision
of formal logic Quiz
Rosen, Kenneth H.
Analyze arguments to test their validity Discrete Mathematics and its
Assignment
Lecture/Discussion Applications. 6th edition
Prove a formula using mathematical
induction Recitation
Class Activity http://mathworld.wolfram.com
Prove statements using direct and /topics/DiscreteMathematics.html
indirect methods
Relate each major topic in Discrete
Mathematics to an application area in
computing

Quantification Theory
Week 5 – 6 Predicate and Quantifiers http://mathworld.wolfram.com Quiz
Rules of quantified statements Lecture/Discussion /topics/DiscreteMathematics.html
Negating a quantified Board Work
statement Class Activity
Arguments of quantified forms Assignment
Euler Diagrams

Set Theory
Week 7 - 8 Apply the basic properties and http://mathworld.wolfram.com Quiz
 Sets and Membership
Algebra of sets
Methods of Proof in set theory
Cartesian Product Sets
Application of Set Theory
Week 9
Week 10 - 11 Relations and Functions
Concepts of functions and
relations
Pictorial Representation of
Relations
Composition of Relations and
Matrices
Types of relations
Graphs
Week 12 - 13
Concept of graphs
Types of graphs
Degree of Vertex
Path and connectivity
Labeled and weighted graphs
operations related to sets Lecture/Discussion /topics/DiscreteMathematics.html
Board Work
Apply to sets the basic properties and
operations related to relations and Class Activity Kolman, Bernard Oral Recitation
function Discrete Mathematical
Structures
MIDTERM EXAMINATION
http://mathworld.wolfram.com
/topics/DiscreteMathematics.html Long Quiz
Understand the concepts of
Lecture/Discussion
functions and relations
Assignment
Kolman, Bernard
Draw a graph from a given relation Recitation/Board work Discrete Mathematical
Recitation
Structures
Compute the composition of Class Activity
relations using matrices
Identify the different types of
relations
Understand the concepts of graphs Lecture/Discussion http://mathworld.wolfram.com Short Quiz
/topics/DiscreteMathematics.html
Class Activity Assignment
Identify the various types of graph
and their uses Recitation/Board work Kolman, Bernard Drill Exercise
Discrete Mathematical
Structures
Compute for the path using the
weighted and Labeled graph
 Applications of graph

Week 14 -15 Trees

Understand the concept of Binary Tree Short Quiz
Concept of Binary tree Lecture/Discussion Rosen, Kenneth H.
Familiarize with the different Discrete Mathematics and its Assignment
Terminologies about Binary terminologies used in binary tree Recitation/Board work Applications. 6th edition
tree
Drill Exercise
Identify the various tree traversal Class Activity
Tree Traversal Algorithm algorithm

Constructing a Binary Search Draw a binary search tree (BST) from a

Tree given list of integers

Week 16 -17 Boolean Algebra

Basic definitions and Truth

table Understand the importance of Boolean Lecture/Discussion
Algebra in the field of computing Short Quiz
Recitation/Board work
Law of Duality
Rosen, Kenneth H.
Class Activity Assignment
Identify the different fundamental Discrete Mathematics and its
Boolean Laws and Boolean laws and theorems Applications. 6th edition
Theorems Drill Exercise

Canonical and Standard Differentiate the Canonical form from

forms of Boolean Standard form of writing Boolean
expression expressions

Simplification of Boolean Simplify Boolean expression into its

expression using Boolean simplest form using Boolean Algebra
Algebra

Construction of Logic
Diagrams from a given Draw the equivalent Logic Diagram of a
Boolean function given Boolean function
 Week 18 FINAL EXAM

COURSE GRADING SYSTEM:

Midterm Grade Final Grade
Lecture: 70% Lecture: 70%

Midterm Grade Final Grade

 Class Standing (60%)  Class Standing (60%)

45% Long Quiz (Average of 3 Quizzes) 40% Long Quiz (Average of 3 Quizzes)

25% Seatwork, Assignments, Recitations (Class Participation) 25% Seatwork, Assignments, Recitations (Class Participation)

35% Short Quizzes 35% Short Quizzes

 Midterm Examination (40%)  Final Examination (40%)

Lab: 30% Lab: 30%

Midterm Grade Final Grade

 Class Standing (60%)  Class Standing (60%)

40% Laboratory Exercises / Machine Problems 40% Laboratory Exercises / Machine Problems

35% Project 35% Project

25% Practical Exam 25% Practical Exam

Midterm Examination (40%)  Final Examination (40%)
Passing Mark: 75%
Passing Mark: 75%

Prepared by: Noted by:

ENGR. JULIUS S. CANSINO ENGR. JULIUS S. CANSINO

Name of Faculty Chairperson
Approved by:

ENGR. GUILLERMO O. BERNABE

Dean

DR. MANUEL M. MUHI

Vice President for Academic Affairs