UNIVERSITI PENDIDIKAN SULTAN IDRIS

COURSE CURICULUM DESIGN AND INSTRUCTIONAL PLAN

Head of Department’s
Faculty : FACULTY OF SCIENCE AND verification:
TECHNOLOGY
Department : MATHEMATICS
Semester : 2
Session : 2008/2009
Course name : DISCRETE MATHEMATICS Date:
Course code : TMC 2013
Jenis Kursus :
Credit hours : 3
Prerequisite : FOUNDATION MATHEMATICS (TMU 1013)

[For courses with prerequisites, students must have taken the prerequisite courses]

LECTURERS’ INFORMATION:

Name : MR SHAHRIZAL SHAMSUDDIN

E-mail : shahrizal@fst.upsi.edu.my
Telephone Number : 05-4506391
Room Number : BC2-69

1
COURSE SYNOPSIS:

Whereas calculus teaches us techniques we can apply when our problems are
"continuous" in nature where variables span values on an entire interval, discrete
mathematics refers to techniques we can apply when our problems are "discrete" in
nature where variables take on only a finite number of values or a sequence of possible
values. These problems often arise in computer science, economics, and optimization. In
this course we will discuss some fundamental ideas in Discrete Mathematics. Topics
include logic and proofs, sequences and series, permutation and combinations, relations
and functions, equivalence relations, and introduction to graph theory, if time permits.

COURSE OBJECTIVES:

1. To discuss the concepts of sets, sequences and series.

2. To introduce logic and the methods of proofs.
3. To explore the basics of counting techniques.
4. To study the concepts of relations.
5. To introduce the concepts of graphs and trees.

LEARNING OUTCOMES:

Students should be able to:

1. solve related problems in sets, sequences and series, integers and matrices.
2. apply basic the logic principles.
3. communicate mathematics effectively using mathematical language.
4. apply appropriate methods of proof.
5. solve related counting problems.
6. apply the concepts of Pigeonhole Principle
7. solve the recurrence relation
8. explain the concepts of relations and their properties, and equivalence relations.
9. compute problems concerning relations and equivalence relations.
• explain the concepts of functions
10. solve related problems in functions
11. solve related problems in graphs and trees

MAIN REFERENCE:

Kolman, B., Busby, R. C., Ross, S. C., Discrete Mathematical Structure, Prentice Hall,
2004

ADDITIONAL REFERENCES:

2
 1. Rosen, K. H. (2007). Discrete Mathematics and Its Applications (6th ed.). New
York: McGraw Hill International Edition.
2. Johnsonbaugh, R. (2004). Discrete Mathematics (6th ed.). Upper Saddle River,
NJ: Prentice Hall.
3. Grimaldi, R. P. & Rothman, D. J. (2003). Discrete and Combinatorial
Mathematics (5th ed.). Upper Saddle River, NJ: Addison-Wesley Pub.
4. Goodaire, E. G. & Parmenter, Mi. (2005). Discrete Mathematics with Graph
Theory (3rd ed.). Upper Saddle River, NJ: Prentice Hall.
5. Epp, S.S. (2004) Discrete Mathematics (3rd ed.). Boston: Cengage Learning.
6. Ensley, D. E. & Crawley, W. J. (1997). Discrete Mathematics. New York: Wiley,
John & Sons Inc.

METHODS OF TEACHING:

Lecture, class and group discussion, group presentation.

METHODS OF SOFT SKILLS EMBEDDED:

Activi Communicat Thinking Life Long Team Leadershi Professiona Entre

ty ion Skill and Learning Work p Skill l prene
(KOM) Problem and Skill (PIM) Ethic urshi
Solving Information (PSK) (ETIK) p
Skill Managemen Skill
(KBKM) t Skill (KU)
(PBPM)
√ √ √

COURSE EVALUATION:

Your grade will be based on the following distributions.

Quizzes/Tests/Group work 40%

Final Examination 60%

Students are expected to attend all meetings of the class. Attendance will be taken
regularly. If a student misses a class, plan to get notes for that day from a classmate.
Students who know ahead of time that they will miss an exam for a good reason, such as
the participation in an official university activity, must notify the instructor at least one
3
week prior to the exam. Missing an exam or a quiz/assignment without an advance valid
excuse presented to the Instructor will result in a score of 0 points. Make-ups (excluding
the final exam) will be given only in pre-approved situations and to those students with
special cases.

4
GRADING SCALE:

Grade
Range Grade Rank
Point
80-100% A 4.0
Excellence
75-79% A- 3.7
70-74% B+ 3.4
65-69% B 3.0 Credit
60-64% B- 2.7
55-59% C+ 2.4
Pass
50-54% C 2.0
45-49% C- 1.7
Weak
40-44% D+ 1.4
Pass
35-39% D 1.0
0-34% F 0.0 Fail

SOFT SKILLS GRADING SCALE:

Scale Criteria
Has attained the elements of soft skills at the level of
5
excellence
4 Has attained the elements of soft skills at a good level
3 Has attained the elements of soft skills at a satisfactory level
Has attained the elements of respected soft skills at a
2
minimum level
1 Poor and need to improve

5
14-WEEK TEACHING SCHEDULE:

T&L Soft
Week Chapter/Topic Learning Outcomes Reference
Activities Skills
CHAPTER 1 – • solve related Lecture
FUNDAMENTALS problems in and class
sets, discussion
1.1 Sets and
Subsets sequences
and series,
1.2 Operations on integers and
1 Sets matrices.
1.3 Sequences
1.4 Division in the
Integers
1.5 Matrices
CHAPTER 2 – • apply basic Lecture
LOGIC the logic and class
2.1 Propositions principles. discussion
and Logical • communicate
Operations mathematics
effectively
2-4 2.2 Conditional
using
Statements
mathematical
2.3 Methods of language.
Proof • apply
2.4 Mathematical appropriate
Induction methods of
proof.
CHAPTER 3 – • solve related Lecture
COUNTING counting and class
3.1 Permutations problems. discussion
• apply the
3.2 Combinations
concepts of
5-7 3.3 Pigeonhole Pigeonhole
Principle Principle
3.5 Recurrence • solve the
Relations recurrence
relation
8-9 CHAPTER 4 – • explain the Lecture
RELATIONS AND concepts of and class
DIGRAPHS relations and discussion
4.1 Product Sets their
and Partitions properties,
4.2 Relations and and
Digraphs equivalence
relations.
4.3 Paths in
Relations and • compute
Digraphs problems
concerning
6
 4.4 Properties of relations and
Relations equivalence
4.5 Equivalence relations.
Relations
CHAPTER 5 – • explain the Lecture
FUNCTIONS concepts of and class
5.1 Functions functions discussion
10
5.3 Permutation • solve related
Functions problems in
functions
CHAPTER 6 – • solve related Lecture
TOPICS IN GRAPH problems in and class
THEORY graphs discussion
6.1 Graphs
11 - 12 6.2 Euler Paths
and Circuits
6.3 Hamiltonian
Paths and
Circuits
CHAPTER 8 – • solve related Lecture
TREES problems in and class
8.1 Trees trees discussion

13 - 14 8.4 Undirected
Trees
8.5 Minimal
Spanning
Trees

SEMESTER 2 2008/2009 ACADEMIC CALENDAR

Activity Duration Date

Lecture 3 week 05.01.2009 – 25.01.2009
Mid-Semester Break 1 week 26.01.2009 – 01.02.2009
Lecture 11 week 02.02.2009 – 19.04.2009
Study Week - -
Final Examination 3 week 20.04.2009 – 10.05.2009
Semester Break 8 week 11.05.2009 – 05.07.2009