Module Handbook

 

Module Name:

Discrete Mathematics

Module Level:

Bachelor

Abbreviation, if applicable:

MAL204

Sub-heading, if applicable:

-

Courses   included   in   the

module, if applicable:

-

Semester/term:

4th / Four Year

Module coordinator(s):

Dra. Utami Dyah Purwati, M.Si.

Lecturer(s):

Dra. Utami Dyah Purwati, M.Si.,Siti Zahidah,S.Si, M.Si.

Language:

Bahasa Indonesia

Classification   within   the

curriculum

Compulsory Course / Elective Studies

Teaching format / class

hours per week during semester:

- 2 hours lectures (50 min / hour)

- 1 hours lectures (50 min / hour)

 

Workload:

3 hours lectures, 3 hour structural activities, 3 hours individual study,

13 week per semester, and total 117 hours per semester   3.9 ECTS

Credit Points:

3

Requirements:

 

Learning goals/competencies:

General Competence (Knowledge)

Capable of understanding the concept and the problems of discrete mathematics, critical thinking, structured, creative problem solving, verbal argument, capable to work in a team.

 

Specific Competence:

1. Calculating permutation and combination.

2. Using the pigeon hole principle and the principle of inclusion and  
    exclusion in the enumeration problem.

3. Determine a relation which is a relation of partial orders.

4. Solving Recursion Relation.

5. Solving Recursive function.

6. Simple Graph.

7. Isomorphic Graphs.

8. Connected  Graph.

9. Spanning Trees of Graphs.

 10.Connectivity matrix of a graph.

 11.Planar Graphs.

 12.Euler Graphs.

 13.The maximum matching of a graph.

Content:

 Enumeration, permutation and combination, binomial theorem, the
 principle of inclusion and exclusion
, pigeon hole principle, partial
 order relation
and total order relation, solving recursion relation,
 number of
Fibonacci, solving recursive function , graphs, connected
 graphs
,  isomorphic graphs, trees, connectivity matrix of a graph,
 
planar graphs, euler graphs, maximum
 
matching.

 

Soft skill Attribute

Active, honest, discipline.

Study/exam achievements:

Students are considered to be competent and pass if at least get 40 of maximum mark of the exams (UTS dan UAS), structured activity (group discussion).

Final score (NA) is calculated as follow: 10% Soft Skill + 20%

Assignment + 20% Quiz + 25% UTS + 25% UAS

 

Final index is defined as follow:

A      :    75 - 100

 

AB    :    70 - 74.99

B      :    65 - 69.99

BC    :    60 - 64.99

C      :    55 - 59.99

D      :    40 - 54.99

E       :      0 - 39.99

Forms of Media:

Slides and LCD projectors, whiteboards

Learning Methods

Lecture, assessments and group discussion

Literature:

 

 

 

1. Chartrand, Gary and Oellermann, Ortrud R, 1993, Applied And
   
Algorithmic Graph Theory.

2. Epp, Susanna S, 1995, Discrete Mathematic With Applications,  
   
Wadsworth Grouph, USA

3. Rossen, Kenneth H, 2007, Discrete Mathematics and Its Applications,  McGraw-Hill Companies, New York.

4. Bahan Ajar Matematika Diskrit,  Nenik Estuningsih, Liliek Susilowati,
    FST Unair, Surabaya

Notes: