Infotech Development Systems Colleges, Inc.

Natera Corner P. Timog Street, Dunao Ligao City 4504

Telephone No. (052) 431-0473 Fax No. (052) 742-5657

IDSC VISION

A College in the heart of the Third District that leads in educating highly trained graduates who can be
leaders in contributing to people empowerment, poverty alleviation and good citizenship in their communities
in particular and the country in general.

IDSC MISSION
To offer educational opportunities to potential community who can help in the intellectual, social, spiritual
and economic advancement of the community and country by offering state of the art facilities for advanced
and specialized programs in Education, Business Administration, Hospitality Management and Information
Technology.
IDSC GOALS
1. Act as academic agent of change towards the development of human and material resources in the
community.
2. Provide curricular programs responsive to the national and international standards of excellence which
allow graduates to be employable locally and internationally.
3. Effectively select students who can become dynamic leaders in the fields of education, business
administration, hospitality management and information technology, imbued with passion for the social,
economic and spiritual upliftment of the community.
4. Develop faculty, staff and students who can have a strong concern and involvement in global and national
issues that affect the well-being of the community and the country.

PROGRAM DESCRIPTION:

The Bachelor of Science in Information Technology (BSIT) program is a four-year degree program which
focuses on the study of computer utilization and computer software to plan, install, customize, operate,
manage, administer and maintain information technology infrastructure. It likewise deals with the design and
development of computer-based information systems for real-world business solutions.

The program prepares students to become IT professionals with primary competencies in the areas of systems
analysis and design, applications development, database administration, network administration, and systems
implementation and maintenance.

The program also requires a Capstone project. It should be in the form of an IT applications development as a
business solution for an industry need.

PROGRAM OUTCOMES:

1. Students have the ability to hold progressively more responsible positions in the IT field, including
positions that are supervisory or managerial in nature.
2. Students have the ability Engage in life-long learning and professional development.
3. Communicate effectively as an IT professional with users, peers, and higher management.
4. Work effectively on teams, whether as a participant or as a leader.
5. Demonstrate ethical behavior as an IT professional and sensitivity to the impact of technology on
society.

OBE COURSE SYLLABUS (Fundamentals of Database) 1

 Infotech Development Systems Colleges, Inc.
Natera Corner P. Timog Street, Dunao Ligao City 4504
Telephone No. (052) 485-2369 Fax No. (052) 485-2338

COURSE SYLLABUS

Course Title : DISCRETE MATHEMATICS

COURSE CODE :
COURSE CREDIT : 3 UNITS
PROGRAM : BSIT
Year Level/Sem :
Google Classroom Code :
Google Meet link :

COURSE DESCRIPTION

This course is concerned with the study of objects, which are finite in number and typically computable. At a
computational level one seeks efficient algorithms and formulas for the listing and counting of the objects. Specific
topics to be covered are mathematical logic, program correctness, and methods of proof, set theory relation, and
mathematical induction, counting principles, functions recurrence relations, matrices of relations, graph theory and tree.
Topic includes functions, relations’ and sets of basic logic, proof techniques, basic of counting and introduction to digital
logic and digital systems. This subject will introduce the student to the concepts and techniques of discrete
mathematical structure that are used in the theory and application in computer science.

COURSE LEARNING OUTCOMES:

At the end of the course, the students are expected to:

(CO 1) Demonstrate critical thinking, analytical reasoning, and problem-solving skills
(CO 2) Apply appropriate mathematical and statistical concepts and operations to interpret data and to solve
problems
(CO 3) Identify a problem and analyze it in terms of its significant parts and the information needed to solve it
(CO 4) Formulate and evaluate possible solutions to problems, and select and defend the chosen solutions
(CO 5) Construct graphs and charts, interpret them, and draw appropriate conclusions

COURSE CONTENT:

Week Intended Learning Topic/Course Content Teaching/Learning Student Output Evaluation

Outcome Activity Task

ILO 1 – Imbibe the 1.IDSC Vision, Mission Class orientation The student Recitation
1 vision, mission and and Goals Discussion should be able to
goals of IDSC, the commit to
college objectives 2. CIT Objectives memory the IDSC
and the program’s Vision, Mission
overview 3. Course Overview and Goals

2 ILO 1- Identify the 1. Speaking Interactive Class define the

discrete mathematics Mathematics Discussion purpose of Written Exam
universal
ILO 2 – Describe the conditional
a. Variables
importance of statement
b. The Language of
Discrete
Mathematics Sets
c. The Language of
Relation and
Functions

OBE COURSE SYLLABUS (Fundamentals of Database) 2

3 ILO 1- Know the 1. The Logic of Interactive Class Identify the Written exam
different Compound Discussion different data
propositional logic Statements Logical forms used
in computing.
ILO 2 – Be familiar
a. Logical Form and
with the propositional
logic Logical Equivalence
b. Conditional
Statement
c. Valid and Invalid
Arguments

a.

4 ILO 1- Know the a. Application: Digital Interactive Class Identify the Written exam
different Logic Circuits Discussion different data
propositional logic b. Application: Logical circuit used
in computing.
Number Systems and
ILO 2 – Be familiar with
Circuits for Addition
the propositional
logic

5 ILO 1- Identify 1. The Logic of Group Discussion Identify the types Oral exam
Predicate Logic of Compound of Fallacy in logic
Quantified Statements Statements and correct them Written Exam

a. Predicates and
ILO 2- Recognize the
Predicates in each Quantified
Quantified Statements Statements I
b. Predicates and
Quantified
Statements II
c. Statement with
Multiple Quantifiers
d. Arguments with
Quantified
Statements
a.
PRELIMINARY EXAMINATION

6 ILO 1- Identify 1.Elementary Number Interactive Class Identify the proper Group report
elementary number Theory and Methods Discussion basic number
theory and methods of Proof theory
of proof
a. Direct Proof and
ILO 2- Differentiate
Counterexample
the features of each
number theory I: Introduction
b. Direct Proof and
Counterexample
II: Rational
Numbers
c. Direct Proof and
Counterexample
III: Divisibility
d. Direct Proof and
Counterexample
IV: Division into
Cases and the
Quotient-
Remainder

OBE COURSE SYLLABUS (Fundamentals of Database) 3

 Theorem

7 ILO 1- Identify e. Direct Proof Interactive Class Identify the proper Written exam
elementary number and Discussion other number
theory and methods Counterexamp theory
of proof
le V: Floor and
Ceiling
ILO 2- Differentiate
the features of each f. Indirect
number theory Arguments:
Contradiction
and
Contraposition
g. Indirect
Arguments:
Two Classical
Theorems
h. Application:
Algorithms

8 ILO 1- Identify 1. Sequences, Interactive Class Identify the data Written exam
different sequences Mathematical Discussion and apply Math
and mathematical Induction and Induction
induction
Recursion
ILO 2- Differentiate
the features of each a. Sequences
sequences b. Mathematical
Induction 1
c. Mathematical
Induction II
d. Strong
Mathematical
Induction and the
well-ordering
principle for the
integers

9 ILO 1- Identify e. Application: Interactive Class Identify the data Written exam
different sequences Correctness of Discussion and apply
and mathematical Algorithms Mathematical
induction Iterations
f. Defining
Sequences
ILO 2- Differentiate
the features of each Recursively
sequences g. Solving
Recurrence
Relation by
Iteration
h. Second-Order
Linear
Homogenous
Recurrence
Relations with
Constant
Coefficients
i. General
Recursive
Definitions and
Structural

OBE COURSE SYLLABUS (Fundamentals of Database) 4

 Induction

10 ILO 1- Analyze the Set 1 Set Theory Interactive Class Identify the Basic Written exam
Theory Discussion Set theory and
a. Set Theory: apply
ILO 2- Differentiate mathematical
Definitions and the
the Set Theory proof in Algorithm
Element Method
of Proof
b. Properties of
Sweets
c. Disproof’s,
Algebraic Proofs,
and Boolean
Algebra
d. Boolean Algebras,
Russel’s Paradox,
and the Halting
Problem

MIDTERM EXAMINATION

11 ILO 1- Analyze the 1 Functions Interactive Class Compute for the Written exam
Different Discussion functions in
Mathematical a. Functions Defined relation to two
Functions sets that
on General Sets
associates each
b. One-to-One and
ILO 2- Differentiate elements
the features of each Onto, Inverse
functions Functions

12 ILO 1- Analyze the 1 Functions Group Apply binary Oral

Different presentation relations presentation
Mathematical c. Composition of
Functions
Functions
d. Cardinality with
ILO 2- Differentiate
the features of each Applications to
functions Computability

13 ILO 1- Identify the 1. Relations Interactive Perform Relation Case Study

degree Relation Discussion in binary
a. Relation on sets
ILO 2- Understand the b. Reflexivity,
certainty in a relation Symmetry, and
Transitivity
c. Equivalent
Relations

14 ILO 1- Identify the 2. Relations Interactive Perform Relation Graded

degree Relation Discussion in cryptography output
e. Modular
ILO 2- Understand the Arithmetic with Perform the Written exam
certainty in a relation Applications to necessary RDBMS
Cryptography Security
f. Partial Order
relations

SEMI FINAL EXAMINATION

OBE COURSE SYLLABUS (Fundamentals of Database) 5

15 ILO 1- Identify the 1. Counting Group Discussion Analyze each Work project
steps in Counting and permutation in
Probability a. Introduction counting
b. Possibility Trees and
ILO 2- Recognize the the Multiplication Rule
importance of c. Counting Elements of
probability Disjoint Set: The
Addition Rule
d. The Pigeonhole
Principle

16 ILO 1- Identify the 1. Counting Group Discussion Analyze each Graded

steps in Counting and combinatorics and output
Probability e. Counting Subsets of a probability
Set Written exam
ILO 2- Recognize the f. r-Combinations with
importance of Repetition Allowed
probability g. Pascal’s Formula and
the Binomial theorem
h. Conditional
Probability, Baye’s
Formula, and
Independent Events

17 ILO 1- Identify the 1. Graphs Group Discussion Analyze the Work project
series of dependence
unconnected point a. Graph’s definitions Graph
and basic properties
ILO 2- Recognize b. Trails, Path, and
importance of Graph Circuits
c. Isomorphisms of
Graphs

18 ILO 1- Identify the 1. Trees Group Discussion Analyze the Work project
series of nodes in dependence Tree
binary a. Rooted tree
b. Spanning Trees and
ILO 2- Recognize Shortest paths
importance of Tree

FINAL EXAMINATION

REFERENCE BOOKS/MATERIALS:

1. Susanna Epp, Discrete Mathematics with Applications, 4th Edition. Cengage, 2011.

2. Mano Morris M, et.al. Digital Design with an Introduction to Verilog HDL, 6th edition. Pearson, 2013.
3. Kenneth H. Rosen, Discrete Mathematics and its Application, 7 th edition
4. Norman L. Biggs, Discrete Mathematics
5. C.L.Liu, Elements of Discrete Mathematics, 2 nd edition, TMH 2000
COURSE REQUIREMENTS:

Quizzes
Assignments
Projects
Periodic exam

GRADING SYSTEM:

OBE COURSE SYLLABUS (Fundamentals of Database) 6

The School follows a cumulative grading system:
(Preliminary rating x 0.30) + (Midterm rating x 0.70) = Midterm Grade
(Midterm Grade x 0.30) + (Semi-final rating x 0.70) = Semi-final Grade
(Semi-final Grade x 0.30) + (Final rating x 0.70) = Final Grade

Grade Components

Periodic Examination 30%

Quizzes 25%
Class Standing (Assignment ,
Projects, Class Participation,
45%
Course Requirement and
Deportment)
FINAL GRADE 100%

Prepared by : Checked by : Approved by:

MARNEIL ALLEN G. SANCHEZ, MIT ERWIN S. BENITEZ, MM, MIT JOSE A. RONCESVALLESM MSCrim
Instructor Department Head President

OBE COURSE SYLLABUS (Fundamentals of Database) 7