Head Department Approval:

Date:

UNIVERSITI PENDIDIKAN SULTAN IDRIS COURSE CURRICULAR DESIGN AND INSTRUCTIONAL PLAN

Faculty Department Semester Session Course Name Course Code Credit Hour Pre-requisition

: : : : : : : :

Faculty of Art, Computing and Creative Industry Computing 1 2011/2012 Discrete Structures MTK 2023/ MTK3013 3 hours (2 hours lecture + 1 hour tutorial) None

LECTURERS INFORMATION Name E-mail Phone Number Room Number Name E-mail Phone Number Room Number COURSE SYNOPSIS: The course discusses the set theory and operation, logic, mathematical order, permutation, combination, probability, relation and digraph, function, tree and machine. These learning contents are essential to equip students with the logical reasoning required in the learning of computer programming. COURSE OBJECTIVES: Upon completion of this course, the students should be able to gain theoretical and practical basic knowledge in the following disciplines: 1. To provide an introduction on some fundamental ideas in discrete structures and master the methods of logical and algebraic relationships between discrete objects, theorem proving and problem solving that commonly used in subsequent mathematics courses, and even to some extent in everyday life : : : : : : : : Dr. Ramlah Binti Mailok (Coordinator) mramlah@ftmk.upsi.edu.my 05-4505014 (013-6076645) 2B-, Malim Sarjana Complex, UPSI Mrs. Noriza Binti Nayan noriza@ftmk.upsi.edu.my 05-4505023 2B-, Malim Sarjana Complex, UPSI

2. To understand and use the notation associated with fundamental concepts of discrete structures / mathematics such as formal proof techniques, including mathematical induction and proof by contradiction, logical deduction, sets, functions, permutations and combinations, discrete probability and also basic graph theory especially in solving and the formulation of mathematical problems. 3. To understand algorithmic complexity and will be able to use it to compare different program designs for a problem. 4. To give an exposure to finite or discontinuous quantities in order to master the process of theorem proving, problem-solving, communication, reasoning, and modeling that commonly used in daily activities. LEARNING OUTCOMES: Students should be able to: 1. 2. 3. 4. 5. Acquire and practise various strategies in discrete structures especially in teaching and learning process. Select, use and apply appropriate techniques in daily basis especially in problem solving and computer program learning. Plan and manage information well and able to manipulate, practise and impart all the techniques in tailoring the problems. Analyze discretely the impotencies of discrete structures in real world environment applications. Present ideas clearly with good command of languages and confidently.

MAIN REFERENCE (TEXT BOOK): 1. Rosen, K. H. (2005). Discrete Mathematics And Its Applications (Fifth Edition). Boston : Mc Graw Hill. ADDITIONAL REFERENCES: 2. JohnsonBaugh, R. (2006). Discrete Mathematics. Upper Saddle River : Prentice Hall. 3. Malik, D. S. and Sen, M. K. (2004). Discrete Mathematical Structures. Belmont : Thomson Technology. 4. Kolman, B, Busby, R. C., and Ross, S. C. (2004). Discrete Mathematical Structures for Computer Science (Fifth Edition). Upper Saddle River : Prentice-Hall. 5. Haggarty, R. (2002). Discrete Mathematics For Computing (First Edition) . Boston : Addison Wesley.

TEACHING METHODS: Lecture and tutorial will be conducted weekly as follows: Lecture : 2 hours Tutorial : 1 hour

SOFT SKILLS EMBEDDED: ACTIVITIES / SOFT SKILLS Individual Assignment Group Project Quiz Examination Legend : KOM KBPM PBPM PSK PIM ETIK KU Communication Skill Thinking and Problem Solving Skill Continous / Advance Learning and Information Management Skill Teamwork Skill Leadership Skill Prefessional Ethics Entrepreneurship Skill KOM KBPM PBPM PSK PIM ETIK KU

COURSE EVALUATION: Courseworks Tutorial Quizzes (3) Group Project (Journal Review) Mid Semester Examination Final Examination Total 60% 10% 15% 10% 25% 40% 100%

Notes: Mark assessment is based on any amendment. UPSIS GRADING SCALE

GRADE

MARKS RANGE

CGPA

STATUS

80 100

4.00

Excellent

A-

75 79

3.70

Excellent

B+

70 74

3.40

Distinction

65 69

3.00

Distinction

B-

60 64

2.70

Distinction

C+

55 59

2.40

Pass

50 54

2.00

Pass

C-

45 49

1.70

Weekly Pass

D+

40 44

1.40

Weekly Pass

35 39

1.00

Weekly Pass

0 34

Fail

SOFT SKILLS GRADING SCALE GRADING SCALE 5 4 3 2 1 CRITERIA FOR SOFT SKILLS Excellent Good Satisfactory Level Minimum Level Weak and Need Improvement

14 WEEKS TEACHING SCHEDULE Topic Week 1 Introduction To RI - Instructional plan briefing. - Discussion of course implementation. - Discussion of course evaluation. Logic Proposition - False, True, Statements. - Propositions. Compound propositions. Logical connectives. - Bit string Learning Outcome(s) Teaching and Learning Activities Listen attentively. Lecture and discussion. Identify course content and evaluation taken. Soft Skills Incorporated KOM. Reference(s)

Outline the basic terms in logic proposition and compound propositions such as negation, conjunction, disjunction, exclusive-or, conditional and bi-conditional. Illustrate the differentiation of compound propositions and its use ness. Outline the basic propositional equivalences. Illustrate the differentiation of tautologies, contradictions and contingencies and relate it with logical equivalences.

Lecture and discussion.

KBPM. KOM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh, R. 2006). Discrete Mathematics. Prentice Hall.

Propositional Equivalences - Tautologies. Tautologies. Contradictions. Contingencies. - Logical Equivalences. Conditional. Contrapositive. Converse. - Use of logic to illustrate connectives - Normal forms (conjunctive and disjunctive)

Lecture and discussion.

KBPM. KOM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Predicates and Quantifiers - Predicates. - Quantifiers. Existential quantifier Universal quantifier. - Propositional function. - Multivariable predicates. - Multivariable propositional functions. - Multivariate quantification. Logic and Proof - Addition. - Simplication. - Combination / Conjunction. - Hypothetical syllogism. - Modes ponens. - Modes tollens. - Resolution. Logic and Proof - Direct proof. - Indirect proof (by contradiction). - Proof by cases. - Proving equivalences.

Illustrate differentiation predicates quantifiers.

the of and

Lecture and discussion.

KBPM. KOM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Outline basic notions of logic. Solve problems by different methods of logic.

Lecture and discussion.

KBPM. KOM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall. Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall. Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Outline the structure of formal proofs for theorems using the techniques of proofs. Solve problems by different methods of proof. Outline basic proofs for theorems using the techniques of proofs. Solve problems by using mathematical induction.

Lecture and discussion.

KBPM. KOM.

Logic and Proof - Proof. - Proof by Induction Mathematical Induction.

Lecture and discussion.

KBPM. KOM.

Sets -

Element. Subset. Empty set. Cardinality. Power set. Ordered n-tuples. Cartesian product. Universe of discourse. Set builder notation. Set theoretic operation. Union. Intersection. Difference. Complement. Symmetric difference. Set identities. Venn diagrams.

Outline by examples the basic terminology of sets. Illustrate the differentiation of set theoretic operation. Interpret the associated operations and terminology in context.

Lecture and discussion.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Functions and Sequences - Functions. Domain, co-domain, range. Image, pre-image. One-to-one, onto, bijective, inverse. Functional composition and exponentiation. Ceiling and floor. Sequences

Outline by examples the basic terminology of functions. Interpret the associated operations and terminology in context.

Lecture and discussion.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

10

Basic Number Theory - Basic number theory. Divisors. Primality. Fundamental theorem of arithmetic. Division algorithm. Greatest common divisors (GCD) / least common multiples (LCM). Relative primality. Modular arithmetic. - Euclidean algorithm for GCD. Relations - Relational databases. - Relations as subsets. - Properties of binary relations - Digraph representation.

Outline by examples the basic terminology of basic number theory. Interpret the associated operations and terminology in context.

Lecture and discussion.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

11

Outline by examples the basic terminology of relations. Interpret the associated operations and terminology in context. Relate practical examples to the appropriate relation model. Outline by examples the basic terminology of functions. Interpret the associated operations and terminology in context. Relate practical examples to the appropriate relation model.

Lecture and discussion.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

12

Relations - Reflexitivity. - Symmetry. - Transitivity. - Equivalence relations. - Matrices of relations.

Lecture and discussion.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

13

Recurrence Relations - Recursive mathematical definitions. - Developing recursive equations. - Solving recursive equations.

Solve a variety of basic recursive equations. Analyze a problem to create relevant recurrence equations or to identify important counting questions. Relate the ideas of mathematical induction to recursion and recursively defined structures. Calculate probabilities of events and expectations of random variables for problems arising from games of chance. Compute permutations and combinations of a set and interpret the meaning in the context of the particular application. Illustrate by example the basic terminology of graph theory, and some of the properties and special cases of each. Models problems in computing using graphs and trees. Relate graphs and trees to data structures, algorithms, and counting.

Lecture and discussion.

KBPM. KOM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

14

Counting Methods - Probability. - Permutations and combinations. - Counting arguments rule of products, rule of sums. - The pigeonhole principle. Graph Theory and Trees - Undirected graphs. - Directed graphs. - Spanning trees. - Traversal strategies.

Lecture and discussion.

KBPM. KOM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

14 WEEKS TUTORIAL SCHEDULE

Week 1

Topic Tutorial 1 - False, True, Statements. - Propositions. Compound propositions. Logical connectives. - Bit string.

Learning Outcome(s)

Teaching and Learning Activities Portray verbal and non- Discussion in a verbal communications form of group. Do independent learning. Manage information well. Present ideas clearly with confident.

Soft Skills Incorporated KOM. KBPM.

Reference (s) Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall. Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Tutorial 2 - Tautologies. Tautologies Contradictions. Contingencies. - Logical Equivalences. Conditional. Contrapositive. Converse. - Use of logic to illustrate connectives. - Normal forms (conjunctive and disjunctive). Journal Titles Submission

Portray verbal and non- verbal communications Do independent learning. Manage information well. Present ideas clearly with confident.

Discussion in a form of group.

KOM. KBPM.

Tutorial 3 - Predicates. - Quantifiers. Existential quantifier. Universal quantifier. - Propositional function. - Multivariable predicates. - Multivariable propositional functions. - Multivariate quantification.

Portray verbal and non- verbal communications Do independent learning. Manage information well. Present ideas clearly with confident.

Discussion in a form of group.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Quiz 1

Present ideas clearly with confident. Manage information well.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Tutorial 4 - Addition. - Simplication. - Combination / Conjunction. - Hypothetical syllogism. - Modes ponens. - Modes tollens. - Resolution.

Portray verbal and non- verbal communications Do independent learning.

Discussion in a form of group.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Tutorial 5 - Direct proof. - Indirect proof (by contradiction). - Proof by cases. - Proving equivalences. - Proof. - Proof by Induction Mathematical Induction Quiz 2

Portray verbal and non- verbal communications Do independent learning. Manage information well. Present ideas clearly with confident.

Discussion in a form of group.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Present ideas clearly with confident. Manage information well.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall. Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Tutorial 6 - Element. - Subset. - Empty set. - Cardinality. - Power set. - Ordered n-tuples. - Cartesian product. - Universe of discourse. - Set builder notation. Set theoretic operation. Union. Intersection. Difference. Complement. Symmetric difference Set identities.

Portray verbal and non- verbal communications Do independent learning. Manage information well. Present ideas clearly with confident.

Discussion in a form of group.

KOM. KBPM.

Venn diagrams. Functions. Domain, co-domain, range. Image, pre-image. One-to-one, onto, bijective, inverse. Functional composition and exponentiation. Ceiling and floor. Sequences Present ideas clearly with confident. Manage information well. KOM. KBPM. Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall. Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Mid Semester Examination

10

Tutorial 7 - Basic number theory. Divisors. Primality. Fundamental theorem of arithmetic. Division algorithm. Greatest common divisors (GCD) / least common multiples (LCM). Relative primality. Modular arithmetic. - Euclidean algorithm for GCD

Portray verbal and non- verbal communications Do independent learning. Manage information well. Present ideas clearly with confident. Complete task on time.

Discussion in a form of group.

KOM. KBPM. ETIK.

 11

Journal Submission Tutorial 8 and 9 - Relational databases. - Relations as subsets. - Properties of binary relations - Digraph representation. - Reflexitivity. - Symmetry. - Transitivity. - Equivalence relations. - Matrices of relations.. - Recursive mathematical definitions. - Developing recursive equations. - Solving recursive equations. Quiz 3 Portray verbal and non- verbal communications Do independent learning. Manage information well. Present ideas clearly with confident. Discussion in a form of group. KOM. KBPM. Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

12

Present ideas clearly with confident. Manage information well.

KOM. KBPM.

Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall. Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

13

Tutorial 10 - Probability. - Permutations and combinations. - Counting arguments rule of products, rule of sums. - The pigeonhole principle. - Undirected graphs. - Directed graphs. - Spanning trees.

Portray verbal and non- verbal communications Do independent learning. Manage information well. Present ideas clearly with confident.

Discussion in a form of group.

KOM. KBPM.

14

Traversal strategies. Portray verbal and non- verbal communications Do independent learning. Manage information well. Present ideas clearly with confident.. Discussion in a form of group. KOM. KBPM. Rosen, K. H. (2005). Discrete Mathematics And Its Applications, Fifth Edition. Mc Graw Hill. JohnsonBaugh,R. 2006). Discrete Mathematics. Prentice Hall.

Discussion