JESUS REIGNS CHRISTIAN COLLEGE

COURSE SYLLABUS

COURSE NAME: DISCRETE MATH

COURSE CODE: DM 011

COURSE DESCRIPTION: A course that covers topics on logic including quantifiers, proofs, mathematical induction, sets, relations and functions. It also covers discussion of
algorithms, recursive algorithms, and recurrence relations and their use in the analysis of algorithms, graph theory, trees, and introduction to
automata.
COURSE CREDIT UNITS: 3 units

CONTACT HOURS/TERM: 14 meeting or 42 hours

PLACEMENT: 1st year, 2nd Term

PRE-REQUISITE: College Algebra

CO-REQUISITE:

PROGRAM OUTCOMES: 1. To provide students with a good understanding of the concepts and methods of discrete mathematics, described in detail in the syllabus.
2. To develop the formal methods of logical reasoning by studying symbolic logic in general and logical proofs in discrete mathematics in
particular.
3. To introduce and/or review combinatorial principles and discrete mathematical structures that are central to mathematics, computer
science, and statistics.
4. Ability to communicate effectively.
5. Ability to use techniques, skills and modern information technology tools necessary for IT practices.
6. Ability to identify, formulate, and solve computing problems.
7. Ability to analyze complex computing problems and to apply principles of computing and other relevant disciplines to identify solutions.
8. Ability to apply knowledge of mathematics and science to solve computing problems.
LEVEL OUTCOMES: This course will make students aware of a variety of techniques for approaching and solving real-world problems; students will also develop the
ability to apply these techniques to new problems. Further develop the mathematical concepts and technique which should serve as a preparation
for
more advanced quantitative courses, and to provide a survey of Discrete Mathematics, the study of finite systems, needed in computer science.
COURSE OUTCOMES: Upon completion of the course, the students will be able to:

 Discuss and identify the discrete mathematical structure concepts, given by:
1.1. Set Theory and Logic
1.2. Combinatorics
1.3. Graph theory
1.4. Algebraic systems
 Understand the basic principles of sets and operations in sets
 Prove basic set qualities
 Apply counting principles to determine probabilities
 Demonstrate an understanding of relations and functions and be able to determine their properties
 Model problems in Computer Science using the concepts learned like graphs and trees

LEARNING OUTCOME CONTENT/TOPIC TEACHING STRATEGIES ASSESSMENT

CLASSROOM TA

Upon successful completion of 1. Set Theory

this course, students should be Google Classroom
able to: 1.1 Fundamentals Interactive Lecture
1.2 Set and Subset Discussion Recitation
Define and describe the 1.3 Venn Diagram and Set Operations Mulltimedia Presentation 6hrs. Homework
relationship between sets 1.4 Law of Set Theory Internet Tutorial Quizzes
regarding members, subset and 1.5 Partition of Sets, Power Sets and Product Group Discussion
subsets, equality using proper 1.6 Cardinality of Sets
notation. 1.7 Principles of Inclusion-Exclusion
 2. Logic and Proofs
Use tables and logical operators to
solve problems. 2.1 Propositions and Logical Operations Google Classroom
Translate between narrative 2.2 Law of Logic Interactive Lecture
arguments and propositional 2.3 Truth Table, Equivalence, Implications Discussion Recitation
logic. 2.4 Normal Forms, Predicates and quantifiers Mulltimedia Presentation 6hrs Homework
Prove logical equivalency, 2. 5 Proofs Internet Tutorial Quizzes
contingency, tautology, and Group Discussion
contradictions. LONG EXAM # 1: Set Theory
and Logic
3. Boolean Algebra
Use truth tables and law of Google Classroom
identity, distributive, 3.1 Boolean Functions and Truth Tables Interactive
commutative, and domination. 3.2 Representing Boolean Functions Discussion Lecture
Compute sum-of-product and 3.3 Logic Gates Mulltimedia Presentation Recitation
product-of-sum expansion. 3.4 Minimization of Circuits Internet Tutorial 3hrs. Homework
Convert Boolean expression to Group Discussion Quizzes
logic gate and vice-versa.
Apply Boolean algebra in real-
world scenarios
4. Relations
Google Classroom
Understand how different 4.1 Product set and Partitions Interactive Lecture
elements and variables are 4.2 Relations and Diagraphs Discussion Recitation
connected to each other. 4.3 Properties Relations Mulltimedia Presentation Homework
4.4 Equivalence and Ordering Relations Internet Tutorial Quizzes
Analyze how one quantity 4.5 Computer representation of relations and Graphs. Group Discussion 6hrs.
depends on another. 4.6 Relational Database: An Introduction
 5. Functions
Understand how different Google Classroom Lecture
elements and variables are 5.1 Basic Definitions Interactive Recitation
connected to each other. 5.2 Operation on Function Discussion Homework
5.3 Pigeon-Hole Principles Mulltimedia Presentation Quizzes
Analyze how one quantity 5.4 Countable and Uncountable Sets Internet Tutorial 4hrs
depends on another. Group Discussion MT/LONG EXAM # 2: Boolean
Algebra, Relation and Function
6. Graph Theory
Understand and explain the basic
concepts of graph theory. Apply 6.1 Graphs and Graph Models Google Classroom
and analyze the basic of 6.2 Graph Terminology and Special Types of Graphs Interactive Lecture
mathematical logic. Evaluate 6.3 Representing Graphs and Graph Isomorphism Discussion Recitation
some real time problems. 6.4 Connectivity Mulltimedia Presentation 6hrs. Homework
6.5 Euler and Hamilton Paths. Internet Tutorial Quizzes
Group Discussion
6.6 Shortest-Path Problems.
LONG EXAM # 3: Graph Theory
6.7 Planar Graphs
6.8 Graph Coloring
7. Trees
Understand and explain the basic Google Classroom
concepts of Trees and be able to 7.1 Introduction to Trees Interactive Lecture
construct efficient algorithm. 7.2 Application of Trees Discussion Recitation
7.3 Tree Traversal Mulltimedia Presentation Homework
7.4 Spanning Tree Internet Tutorial Quizzes
7.5 Minimal Spanning Tree Group Discussion 4hrs.

Create efficient and effective 8. Algorithm Google Classroom Lecture

algorithms for solving specific Interactive Recitation
problems.  8.1 Algorithm Discussion Homework
 8.2 The Growth Functions Mulltimedia Presentation 3hrs. Quizzes
 8.3 Complexity of Algorithm Internet Tutorial
Group Discussion
 FINAL EXAMINATION

LEARNING ENVIRONMENT:  Classroom (in-person)

 Online
CLASSROOM POLICIES:  Cellular phones should be placed in silent mode during the conduct of the class.
 Regular attendance and class participation are required. A student who is absent for more than four (4) times and has failed to drop the
course on the dropping date will be given a grade of 5.0.
 There will be NO SPECIAL LONG EXAM for any long exam missed except for a very rational reason and if sick, with the presentation of
medical certification signed by attending physician and parent consent. You are only allowed to miss one long exam. Score for that missed
exam will be taken from the score garnered from the final exam (double-the-final). Other exams missed will be given a raw score of 0
points.
 Student is expected to do their own project/problem sets. Each one may discuss project concepts with classmates but do not discuss specific
details nor do any joint work, either in pieces or in entirety, by any means. These are forms of cheating and will be sanctioned accordingly.
Cheating will not be tolerated. An automatic grade of 5.0 will be given to any student caught cheating.
 On projects/problem sets, the grade will be reduced by 10% of the total score for every day late submission. Deductions will continue to
accrue until the project is finally submitted. On the other hand, early submissions will be given a (10% of the score earned) x no. of days
earlier than the deadline date (no more than 30%).
 In order to qualify for exemption in taking the final exam, the student must satisfy all of the following:  Must have an average of 85% or
better from his/her long exams, and no failed/missed exam;  Must have a current standing (partial) of 60% or better, prior to final
examination week. Grade is not more than 2.00.
 No make-up class exercises, seatworks, and quiz will be given.
 The student shall not leave class for any reason, including taking/making phone calls unless it is truly an emergency or illness. Such
activity is also distracting and has underlying interpretations.

COURSE REQUIREMENTS:  Exams

 Quizzes
 Hand-On Activities
 Project
 Attendance
 Recitation

RESOURCES:  Books
 Internet Tutorials
 Multimedia Presentation
REFERENCES:  Introduction to Discrete Mathematics (Wikipedia)
 Discrete Mathematics and Its Applications 7th Edition by Kenneth Rosen
 Discrete Mathematics (8th Edition), Richard Johnsonbaugh, 2017
 https://math.libretexts.org/Bookshelves/Combinatorics_and_Discrete_Mathematics

INSTRUCTOR Mr. Allan Dominguez

INFORMATION: Faculty

CLASS SCHEDULE

GRADING SYSTEM Major Examination – ( MIDTERM & FINALS ) 40%

Class Standing 60%
( Recitation , Attendance , Quizzes, Laboratory Activities, etc. )

Final Grade = Midterm Grade (40%) + Final Computed Grade (60%)

COURSE REQUIREMENTS: Attendance -

3 Long Exams -
Projects/Problem Sets -
Class Exercises, Quizzes, Seatworks, etc. -
Finals -
Total = 100%