33 views

Original Title: 3-SSH2673-Discrete_Mathematics.pdf

Uploaded by elijah

3-SSH2673-Discrete_Mathematics.pdf

© All Rights Reserved

- greensheet_19
- Data Structures and Algorithms
- 1.03 12.F.1.O.003.II Discrete Mathematics En
- Webercoursenotes.pdf
- sec33b
- Anti Linearly Left Maximal Countably Poisson Paths Over Null Triangles
- Rotman_-_An_introduction_to_the_theory_of_groups
- KTU_MTechCSEFinalSyllabi
- On the Description of Continuously Chern
- Undergraduate 14[1]
- Economics Project
- Notation for Social Network Data
- Social and Behavioral Sciences
- FHMM1014 Tutorial 1 Number and Set
- Definition of Binary Relation
- Real_Numbers_14.pdf
- Exponents and Radicals
- Problems
- ct
- 1-amult

You are on page 1of 5

Code

Total

Faculty of Science

and Subject: SSH 2673 Discrete Mathematics

Lecture Hours: 42 hours

Lecturer

Room No.

Tel. No

e mail

Synopsis

:

:

:

:

:

Page : 1 of 5

Semester: 1

Academic Session: 2010/11

C22 438, Mathematics Department

07-5534270

jt@mel.fs.utm.my

Pre-requites: None

This course introduces the applications of discrete mathematics in

the field of computer science. It covers sets, logic, proving

techniques, combinatorics, functions, relations, graph theory and

algebraic structures. These basic concepts of sets, logic functions

and graph theory are applied to Boolean Algebra and logic

networks, while the advanced concepts of functions and algebraic

structures are applied to finite state machines and coding theory.

Prepared by

Name: ASS PROF DR JAMALLUDIN TALIB

Signature:

Date:

Certified by

Name:

Signature:

Date:

COURSE OUTLINE

Department & Faculty: Department of Mathematics,

Code

Total

Page : 2 of 5

Faculty of Science

and Subject: SSH 2673 Discrete Mathematics

Lecture Hours: 42 hours

Semester: 1

Academic Session: 2010/11

Learning Outcomes

At the end of the course, students should be able to:

No.

CO1

two integers.

CO2

CO3

CO4

CO5

CO6

CO7

CO8

CO9

Programme

Learning

Outcome(s)

Addressed

PO1(C2, P2, A1),

PO2(C3, P2, A2)

as demonstrated by the lecturer to prove

mathematical statements.

Establish the decisive properties of relations in

order to compute inverses of functions.

PO2(C3, P3, A2)

or the contradiction method in order to prove a

mathematical statement effectively.

Discriminate between an Eulerian graph from a

Hamiltonian graph for use in solving

mathematical problems.

Recognize the use of Karnaugh map to construct

and minimize the canonical sum of products of

Boolean expressions and transform it into an

equivalent Boolean expression.

Discriminate, identify and prove the properties

of groups and subgroups.

PO2 (C3, P3, A2)

using homomorphism theory aptly.

PO2(C3, P3, A2)

PO1(C2, P2, A1),

PO2(C5, P3, A2)

PO1(C2, P2, A1)

PO2(C3, P3, A2)

PO1(C2, P2, A1),

PO2(C5, P3, A2),

PO6(TS1, TS2, TS3)

based on the maximum likelihood method

appropriately.

Prepared by

Name: ASS PROF DR JAMALLUDIN TALIB

Signature:

Date:

PO2(C3, P2, A2)

PO2(C5, P3, A2),

Certified by

Name:

Signature:

Date:

Assessment

Methods

Assignment 1

(Individual),

Test1

Assignment 1

(Individual),

Test1

Assignment 1

(Individual),

Test1

Assignment 2

(Individual),

Test2

Assignment 2

(Individual),

Test2

Assignment 3

(Individual),

Presentation,

Test2, Final

Assignment 3

(Individual),

Final

Assignment 4

(Group),

Presentation,

Final

Assignment 5

(Individual),

Final

COURSE OUTLINE

Department & Faculty: Department of Mathematics,

Code

Total

Faculty of Science

and Subject: SSH 2673 Discrete Mathematics

Lecture Hours: 42 hours

Page : 3 of 5

Semester: 1

Academic Session: 2010/11

1 Face-to face Learning

a. Lecture-Centered Learning

Lecture(2.5hrslecture)x14

35

b. Student-Centered Learning

Inclassexercises(0.5hr)x14

Self-Directed Learning

a. Assignments

Revision (preparation for lectures, tutorials

b.

and assignments)

c.

7

24

39

9

Formal Assessment

Continuous Assessment (2 tests)

a.

Final Examination (3 hrs)

b.

Total SLT

3

3

120

Teaching Methods

i) Lecture and Discussion

ii) Problem Solving

iii) Independent Study

Weekly Schedule

Week

Topics

Week 1

Set, Logic, Proving Techniques and Combinatorics: Sets: set, union of sets,

intersection of sets and complimentary set. Set of numbers integers, positive

integers, nonnegative integers, rational numbers, irrational numbers, real

numbers

Week 2

divisor(GCD),least

comon

multiple(LCM),

Euclidean

algorithm.

Logic:Proposition and statements, negation of statements, compound statement

using connectives OR and AND, truth tables and truth values of conditional and

biconditional statements.

and Combinatorics:

by

Prepared by Set, Logic, Proving Techniques Certified

Proving

Techniques: Proving

direct method, proving by contradiction, and

Name: ASS PROF

DR JAMALLUDIN

TALIB byName:

principle of mathematical induction.

Signature:

Signature:

Week 3

Combinatorics: Permutation of nDate:

elements, permutation of r out of n elements,

Date:

combination of r out of n elements.

COURSE OUTLINE

Department & Faculty: Department of Mathematics,

Code

Total

Faculty of Science

and Subject: SSH 2673 Discrete Mathematics

Lecture Hours: 42 hours

Week 4

Week 5

Week 6

Week 7

Week 8

Week 9

Page : 4 of 5

Semester: 1

Academic Session: 2010/11

symmetric and transitive relations on a finite set.

Relations: Equivalence relation and partial order relation.

Functions: one to one function, onto function, floor function, ceiling function,

and inverse function.

Introduction to graph theory: Definitions of edge, vertex, path, loop, cycle,

Eulerian path and cycle, problem of Konigsberg bridge, Hamiltonian path and

cycle.

Algebraic Structures: Binary operation, commutative and associative laws,

identity element, inverse element, semigroup, monoid and group.

Algebraic Subgroup: Coset, normal subgroup and quotient group.

Boolean Algebra and Logic Network: AND, OR and NOT logic gates and

their operations. Boolean expressions and logic network diagrams, Boolean

algebra and properties.

Week 10

Boolean expression, Minimization, Karnaugh Map, Minimization Procedure.

Week 11

Finite State Machines : Mathematical structure and finite state machines, state

table, state graph, homomorphism of finite state machine.

Finite State Machines:

Quotient machine, machines equivalence and sequential machine.

Introduction to Coding Theory:

Binary information and coding, parity check code, Hamming distance and

minimum distance.

Introduction to Coding Theory:

Group Code, generation of group code and decoding of code using

maximum likelihood method.

Final Examination

Week 12

Week 13

Week 14

Week 15

Week 16-17

Prepared by

Name: ASS PROF DR JAMALLUDIN TALIB

Signature:

Date:

Certified by

Name:

Signature:

Date:

COURSE OUTLINE

Department & Faculty: Department of Mathematics,

Code

Total

Page : 5 of 5

Faculty of Science

and Subject: SSH 2673 Discrete Mathematics

Lecture Hours: 42 hours

Semester: 1

Academic Session: 2010/11

References

1. Talib, J. (2006) Struktur Matematik Diskret Untuk Sains Komputer, Penerbit UTM.

(QA76.9.M35J352006a).

2. Kolman, B. and Busby, R.,C. (1999), Discrete Mathematical Structures, Prentice Hall.

(QA76.9.M35K642000).

3. Epp, S. S. (1990), Discrete Mathematics with Applications, Belmont, California.

(QA39.2E661990).

4. Lipshutz, S. (1976), Schaums Outline Series, Theory and Problems in Discrete

Mathematics, McGraw Hill Book Company. (QA162L561977)

5. Grimaldi, R.P. (1985) Discrete and Combinatorial Mathematics, Addison-Wesley.

(QA39.2G771985)

Assessment

No.

Type of Assessment

1

2

3

4

Test 1

Test 2

Assignment (Individual)

Assignment (Group)

Final Examination

Numb

er

1

1

4

1

% each

% total

Date

15

15

4

4

15

15

16

4

Week 6

Week 12

Week 3, 5, 7, 9

Week 13

50

50

Week 16 - 18

Prepared by

Name: ASS PROF DR JAMALLUDIN TALIB

Signature:

Date:

Certified by

Name:

Signature:

Date:

- greensheet_19Uploaded byhsujustin
- Data Structures and AlgorithmsUploaded byThirumal Venkat
- 1.03 12.F.1.O.003.II Discrete Mathematics EnUploaded byCalin Daniel
- Webercoursenotes.pdfUploaded byvanaj123
- sec33bUploaded byroufix
- Anti Linearly Left Maximal Countably Poisson Paths Over Null TrianglesUploaded byHenry Pablo
- Rotman_-_An_introduction_to_the_theory_of_groupsUploaded bythefishmath
- KTU_MTechCSEFinalSyllabiUploaded bygpaswathy
- On the Description of Continuously ChernUploaded byGath
- Undergraduate 14[1]Uploaded byThakur Aryan Singh
- Economics ProjectUploaded bypriya
- Notation for Social Network DataUploaded byPoonam Naidu
- Social and Behavioral SciencesUploaded bymarcoslucena
- FHMM1014 Tutorial 1 Number and SetUploaded byCrKxiangKhor
- Definition of Binary RelationUploaded byWake Up Sha
- Real_Numbers_14.pdfUploaded byag
- Exponents and RadicalsUploaded byAmit Tiwari
- ProblemsUploaded byanantyanto
- ctUploaded byRachel Cooper
- 1-amultUploaded byapi-299092653
- save the world project rubricUploaded byapi-246221160
- leo_001Uploaded byLeonardo Gama Assumpção
- dd2.ppsxUploaded byPulkit Agrawal
- lec10aUploaded byIamIN
- Number SystemUploaded byArun Roxx
- CurriculumUploaded byVallapureddy Venkatesh
- 15052_TP B5803Uploaded bynash_rites90
- Mohammad ISLPED2002Uploaded byprthpchndr
- ch08Uploaded byfleebt
- lecture1_shortUploaded byAlice Lighton

- Linear Recurrence RelationsUploaded byEmMie Lou JAvier
- Math TopicsUploaded bysureshJOHNrajagopal
- Prediction of Aerodynamic Coefficients for Wind Tunnel Data Using a Genetic Algorithm Optimized Neural NetworkUploaded byGrace Thompson
- AlgebraUploaded byYesenia Gonzalez Gonzalez
- Modern Numerical Methods for Fluid Flow_Phillip Colella.pdfUploaded byMustafa Yılmaz
- MATH1070 2 Error and Computer ArithmeticUploaded byphongiswindy
- Math2cUploaded byJovannie18
- translation and rotationUploaded bygbonete
- EC302Uploaded byPolaiah Geriki
- Newton MethodUploaded byThích Toán Học
- Udine 2017 Igabem CracksUploaded byJorge Luis Garcia Zuñiga
- PolyTop.pdfUploaded byahmed_shaheeb
- Derivatives Solution.pdfUploaded byHasibul Rajbari
- Complex-number FM 9231Uploaded byBoris
- math lp week 9 10-3-16 holmesUploaded byapi-286228793
- Chapter 7 Equations and LogarithmsUploaded byJojobaby51714
- IGNOU MCS - 031Uploaded byShraddha Thakur
- Materi 2 Integral Riemann & Teknik PengintegralanUploaded byrickisyahidan27
- GTIS_review.pdfUploaded byDragos Popescu
- NR-311201-Design and Analysis of AlgorithmsUploaded bySrinivasa Rao G
- Fuzzy Particle Swarm Optimization With Simulated Annealing and Neighborhood Information Communication for Solving TSPUploaded byEditor IJACSA
- Grading on Simple Lie Algebras (Elduque & Kochetov)Uploaded byAnonymous 3zbI8CUQUK
- New algorithm for solving mixed intuitionistic fuzzy assignment problemUploaded byP.SENTHIL KUMAR
- Real Analysis in ReverseUploaded byLázaro Albuquerque
- Exercicios Pol Interp1Uploaded byFabio Ferraz de Carvalho
- DCT in image processingUploaded byRoshaney Jkd
- facility location problemUploaded byAndri Abdul Malik
- Octave BasicsUploaded bySanjayan PradeepKumar
- Tabular Integration by Parts - David HorowitzUploaded byAbhinav
- Systems of Linear Equations and MatricesUploaded bygosaye desalegn