DMC COLLEGE FOUNDATION, INC.

College of Computer Studies

Center of Development in I.T. Education

COURSE SYLLABUS

Course Title Discrete Mathematics

Course Code IT 11/ACT 12
Course Credit IT 11/ACT 12 – 3 units
Prerequisite
Professor LEMUEL D. PANGILINAN
E-mail Address [email protected]
Consultation Schedule Day Time Room
____________ ____________ ____________
____________ ____________ ____________
____________ ____________ ____________

I. COURSE DESCRIPTION

This course introduces the fundamental principles, technology, and current development of Cloud Computing. Cloud Computing is “A large-
scale distributed computing paradigm that is driven by economies of scale, in which a pool of abstracted, virtualized, dynamically-scalable, managed
computing power, storage, platforms, and services are delivered on demand to external customers over the Internet.” It has become a driving force
for information technology over the past several years, and it is hinting at a future in which we won’t compute on local computers, but on centralized
facilities operated by third-party compute and storage utilities.

II. DESIRED LEARNING RESULTS

Expected DMCian Graduate Desired Learning Results: By the end of the course, the students are enabled to:
Attributes
God-Fearing  Inculcate to the minds, and hearts of the students the way of loving their classmates through helping each other in
acquiring honest solutions to the given programming problems.
Knowledgeable  Mastering the fundamentals of programming and meet the deadlines in submitting course requirements.
Socially responsible  Become a good model in promoting good ethics in I.T. in the province of Zamboanga del Norte.

III. FINAL OUTPUT/FINAL PERFORMANCE

Page 1 of 8
 At the end of the course, students are gain competence in evaluating the performance and identifying bottlenecks when mapping applications to the
cloud. At the same time, a successful IT project also has to start with a smart, tough, convincing and capable leader who can nurture it and advocate for it
from concept to planning and from implementation through final deployment.

Final Performance Task Rubric: Field Programmable Gate Arrays (FPGAs)

God-loving
Characteristics Excellent Satisfactory Fair Not Competent Score
(4) (3) (2) (1)
Honesty The project is perfectly done A small portion of the project A small portion of the project More than 50% of the project
and original. was copied from his classmate was copied from his classmate portion was copied from his
but he understands his works but he understands his works. classmate and yet the program
very well. However, there are some minor is not running.
flaws in it.

A. Knowledgeable
Characteristics Excellent Satisfactory Fair Not Competent Score
(4) (3) (2) (1)
Delivery& Mastery Highly competent in terms of Competent in either practical, or Understanding the basic Cannot comprehensively
practical, and oral skills oral skills knowledge requirements in all explain the basic knowledge
assessment, and assessment/presentation, but not areas. requirements of the course.
presentation. to all areas.

B. Socially Responsible
Characteristics Excellent Satisfactory Fair Not Competent Score
(4) (3) (2) (1)
Submit Project Submitted requirements Submitted requirements on time. Late submission of requirements Submitted the requirements on
Designs ahead of time. but submitted the requirements the day of presentation.
before the final presentation.

Project Design Project design is excellent Project design has some flaws Project design has some syntax Project design has errors and
Reliability and 100% running. but the logic flow is correct. and logical errors but he is able the student was not able to fix
to fix it. it on the given amount of time.

Page 2 of 8
IV. ACCEPTABLE EVIDENCE/GRADING PROCEDURE

Preliminary Grade (PG) Midterm Grade (MG) Pre-final Grade (PFG) Final Semestral Grade (SG)
Main Task 20% Main Task 20% Main Task 20% Main Task 30%
Other Task 20% OtherTask 20% Practical Skills Exam 20% Final Exam 30%
Practical Skills Exam 20% Practical Skills exam 20% Attendance 10% Lab 20% SG = (PG x .20) + (MG
Attendance 10% Attendance 10% Final Output 50% Attendance 10% x .25)
Prelim Exam 30% Midterm Exam 30% Total 100% Other 10% +(SFG x .25 )+ (F x .30)

Total Total 100% Total 100%

100%

POSSIBILITY: Prelim and Midterm Periods have Similar Set of Assessments

Preliminary/ Criteria Final Criteria
Midterm
Main Task (May include minor tasks connected to main task) 40% Final Task (May include minor tasks connected to main task) 60%
Other Tasks (Homework/ Class Activities/ Exercises/ Projects) Other Tasks (Homework/ Class Activities/ Exercises/ Projects)
20% 15%
Formative written language test 15% Class Participation (Recitation, and other verbal and non- 15%
Class Participation (Recitation, and other verbal and non-verbal verbal evidence of student participation)
evidence of student participation) 15%
Attendance 10% Attendance 10%
Total 100% Total 100%

V. LEARNING PLAN
PRELIM Major Task: Brief overview on logic, which is commonly known as the science of reasoning. The emphasis
here will be on logic as a working tool. We will develop some of the symbolic techniques
required for computer logic.
Enabling Topics/Skills Foci Learning Activities/Teaching Assessment Expected Output No. of
Strategies Hours
Identify Fundamentals  Propositions and related Lectures on Propositions and Students will know the Fundamentals of
of Mathematical Logic concepts related concepts, conditional and Mathematical Logic. Their level of 5

Page 3 of 8
 biconditional propositions, rules of understanding will be measured through
 Conditional and inferential logic, propositions and the following: quizzes, board work, and
biconditional propositions quantifiers, arguments with seatwork
quantified premises, digital logic
design and number systems.
 Rules of inferential logic
propositions and
quantifiers

 Arguments with
quantified premises

 Digital logic design and Lectures on the definition of terms 22.5

number systems. used.

Page 4 of 8
MIDTERM Major Task: We discuss some common methods of proof and the standard terminology that accompanies
them. Set is the most basic term in mathematics and computer studies. Hardly any discussion
in either subject can proceed without set or some synonym such as class or collection. In this
chapter we introduce the concept of sets and its various operations and then study the
properties of these operations.
Enabling Topics/Skills Foci Learning Activities/Teaching Assessment Expected Output No. of
Strategies Hours
Overview  Methods of Direct Proof I Lectures on Fundamentals of Quizzes, assignments, oral 12.5
Fundamentals of Mathematical Proofs participation/recitation
Mathematical Proofs  More methods of Proof

 Methods of Indirect
Proofs: Contradiction and
Contraposition

 Methods of Induction

 Project III - Elementary

Number Theory and
Mathematical Proofs

 Project IV - The
Euclidean Algorithm

 Project V - Induction and

the Algebra of Matrices
Lecture/presentation Perform oral and practical skills test, and 10
 Properties of Sets
Learning Fundamentals submit all exercises, including the major
of Set Theory  Boolean Algebra project for the term, and pass the major
 Basic Definitions exam

Page 5 of 8
SEMI-FINAL Major Task: We introduced many relations which are used in mathematics i.e. \is a subset of", \ is less
than" and so on. One frequently wants to compare or contrast various members of a set,
perhaps to arrange them in some appropriate order or to group together those with similar
properties. The mathematical framework to describe this kind of organization of sets is the
theory of relations.
Enabling Topics/Skills Foci Learning Activities/Teaching Assessment Expected Output No. of
Strategies Hours
Learning and mastering  Equivalence Relations Series of lectures and A student has to perform oral and 10
Relations and Functions  Partial Order Relations demonstrations practical skills tests, pass the quizzes.
 Bijective and Inverse
Functions
 Recursion
 Applications to Relations
 Well-Ordered Sets and
Lattices
 The Pigeonhole Principle
 Countable Sets
 Finite-State Automation

Pass the semi-final major exam 10

Page 6 of 8
 FINAL Major Task: Provide a brief overview of The subject of the analysis of algorithms consists of the study of
efficiency of algorithms. Two aspects of the algorithm efficiency are: the amount of time
required to execute the algorithm and the memory space it consumes. In this chapter we
introduce the basic techniques for calculating time efficiency. We establish several techniques
for counting large finite sets without actually listing their elements. Also, the fundamentals of
probability theory are discussed. And we present the basic concepts related to graphs and trees
such as the degree of a vertex, connectedness, Euler and Hamiltonian circuits, isomorphisms
of graphs, rooted and spanning trees.
Enabling Topics/Skills Foci Learning Activities/Teaching Assessment Expected Output No. of
Strategies Hours
Introduction to the  Time Complexity and O- Lectures, demonstrations, hand-on A student has to perform and pass the oral
Analysis of Algorithms Notation activities and practical skills test, pass the quizzes.
 Logarithmic and
Exponential Complexities
 Ө - and Ω - Notations Pass the final written major exam 22.5
Fundamentals of  Elements of Counting
Counting and  Basic Probability Terms
Probability Theory and Rules
 Binomial Random
Variables
Elements of Graph
 Graphs, Paths, and
Theory
Circuits
 Trees

VI. COURSE POLICIES

A. You are allowed seven 18 hours (20% of the total hours) of absences, inclusive of tardiness. All absences after this shall mean excessive
absences, which is equivalent to a grade of 5.0
B. Assignments, laboratory exercises, projects must be submitted before the class begins; unless otherwise directed.
C. Special and make-up written outputs (long quizzes, assignments, seatwork) will be given only if you have justifiable reason/s for falling to
submit them.
D. Special major exams will be given one week after the administration of the regular major examination.

Page 7 of 8
 E. The use of cellular phones is prohibited during class hours, unless a special permission to use it is granted. In addition, the use of any
electronic gadget is prohibited unless otherwise relevant to the class lesson/discussion.
F. You are encouraged to discuss your class-related concerns with your subject-teacher

VII. BASIC TEXTBOOK

Lecture Notes in Discrete Mathematics

Copyright 2001 All rights reserved
By: Marcel B. Finan
May 2001

Prepared by:

ENGR. LEMUEL D. PANGILINAN

Second Semester, SY 2013- 2014

Endorsed by: Approved by:

PROF. MARIA DARA C. SAQUIN DR. GERALD T. CONCHA

Supervising Coordinator Dean, College of Computer Studies

Page 8 of 8