CARTHEL SCIENCE EDUCATIONAL FOUNDATION INC

San Vicente, San Manuel, Tarlac

College of Information and Computer Studies

A. COURSE CODE : ACT 10

B. COURSE TITLE : Discrete Mathematics
C. COURSE CREDITS : 3 units (54 hours)
D. COURSE DESCRIPTION : This course covers a wide variety of diverse mathematical-related topics that are integrated and
presented in a logically coherent-fashion. The course provides depth coverage on some useful
topics such as sets, functions, mathematical induction, combinatorics, algorithms and graph
theories to expand the mathematical maturity of the computer science students. The course also
provides a careful motivation of topics and previews of applications in the field of computer. It is
primarily intended for computer science students in which an introduction to the topics along with
the indications of how they may be pursued in greater depth is genuine use in computer science.
The course aims to unify a number of other mathematical concepts that previously had to be
considered separately.

E. PREREQUISITE/S : All Math subjects

F. COURSE OBJECTIVES :

1.] General : At the end of the course, the student should be able to:

1.1] Extend students' mathematical maturity;

1.2] Develop the ability to deal with abstraction;
1.3] Improve the structure of the algorithms;
1.4] Understand the fundamental concepts of mathematics and its applications in the field of computer;
1.5] Develop their basic computation skills.

2.] Specific : At the end of the course, the student should be able to:

2.1] Cognitive
2.1.1] Identify mathematical concepts and principles as foundation of computer science;
 2.1.2] Relate mathematical solutions to actual and real-world applications;
2.1.3] Design, devise and/or create algorithms using the concepts and principle of mathematics.

2.2] Affective
2.2.1] Select and use appropriate mathematical solutions in designing algorithms;
2.2.2] Present solutions in a simple, exact and concise manner;
2.2.3] Compare his/her designed solutions to existing algorithms.

2.3] Psychomotor
2.3.1] Simulate mathematical concepts by giving real-world examples;
2.3.2] Transform mental solutions into concise, precise and working solutions;
2.3.3] Modify crude algorithms through simulation into more efficient one.

G. COURSE CONTENT/OUTLINE :
SUGGESTED
WEEKS/HOURS TOPIC OUTLINE READING ASSIGNMENTS EVALUATION
ACTIVITIES
1st Week A. Basic Set Theory  Sets Class discussion Quiz
3 hours  Basic Set Operations Board work Board work
 Venn Diagram Recitation Seatwork
Assignment

2nd Week B. Functions  Functions Class discussion Seatwork

3 hours  Types of functions Board work Board work
 One-to-one and Onto Recitation Assignment
Functions

3rd Week C. Relations  Relations Class discussion Quiz

3 hours Board work Board work
Recitation Seatwork
Assignment

4th & 5th Weeks D. Sequences and Mathematical  Sequences and Mathematical Multimedia Quiz
4 hours Induction Induction presentation Seatwork
Assignment

5th Week E. Recursion  Concept of recursion Programming Recitation

1 hour
6th Week F. Fundamental Principle of  Fundamental Principle of Simulation of Quiz
3.5 hours Counting Counting algorithms Seatwork
Assignment
PRELIMINARY
EXAMINATIONS

END OF PRELIM PERIOD

7th Week G. Permutation  Permutation and Algorithms in Class discussion Quiz
3 hours Permutation Board work Seatwork Assignments
Simulation of
Algorithms

8th Week H. Combination  Combinations and Algorithms Class discussion Quiz

3 hours in Permutation Board work Seatwork
Simulation Assignments

9th Week I. Principle of Inclusion-  Principle of Inclusion- Class Discussion Quiz

3 hours Exclusion Exclusion Board work Seatwork
Assignments

10th Week J. Mathematical Logic and  Logic, mathematical terms Class Discussion Recitation
3 hours proofs Multimedia Assignments
Presentation

11th Week K. Methods of Proof  Different proof techniques Class Discussion Assignment
3 hours Multimedia Board work
Presentation Quiz

12th Week L. Predicate Logic  Predicate Logic Class Discussion Assignments

3.5 hours Multimedia Board work
presentation Quiz
MIDTERM
EXAMINATIONS

END OF MIDTERM PERIOD

13th Week M. Graph  Graph Terminologies Class Discussion Assignment
3 hours Multimedia Presentation Recitation
 14th Week N. Types of graphs  Types of graphs Class Discussion Assignment
3 hours Multimedia Presentation Recitation
Quiz
15th Week O. Shortest path algorithms  Applications of shortest path Class Discussion Seatwork
3 hours algorithm Multimedia Presentation Assignment
Programming simulation Recitation
Quiz
16th Week P. Minimum Spanning Tree  Minimum Spanning Tree Class Discussion Assignment
2 hours Multimedia Presentation Recitation

17th Week Q. Prim’s Algorithm  Applications of Prim’s Class Discussion Assignment

3 hours Algorithm Multimedia Presentation Seatwork
Simulation Quiz

18th Week R. Graph coloring  Applications of Graph Class Discussion Seatwork

4 hours Coloring Quiz
FINAL
EXAMINATIONS

END OF FINAL PERIOD

H. GRADING SYSTEM

The following percentage distribution shall be followed for each periodical grade
Prelims 30% 1) Lecture Units
Midterms 30% a. Class participation 10%
Finals 40% b. Exercises n seatwork 20%
100% c. quizzes 20%
d. periodical exam 50%

I. INSTRUCTIONAL MATERIALS:

TEXTBOOK: NONE
J. REFERENCES/READINGS:

1. Discrete Mathematics Maribeth Fernandez

2. Discrete Mathematics and Its Applications 6th Ed. Kenneth H. Rosen
3. Automata Dr. Charlemagne Garcia Lavina
Jasmin De Castro Niguidula
4. Discrete Mathematics (5th edition) Richard Johnsonbaugh
5. Discrete Mathematics Structures for Computer Bernard Kolman
Science
6. Discrete Mathematics and its Applications Kenneth H. Rosen
7. Introduction to Discrete Mathematics (6th edition) Richard Johnsonbaugh

Prepared by:

Engr. Virgilio A. Zacarias, Jr

Dean, College of Information and Computer Studies