Module/Course Title: Discrete Mathematics

Module course code

KOMS120304

Student Workload
119 hours

Credits

3 / 4.5 ETCS

Semester

3

Frequency

Odd Semester

Duration

16

1

Type of course

Core Study Courses

Contact hours


40 hours of face-to-face (theoretical) class activity

Independent Study


48 hours of independent activity
48 hours of structured activities

Class Size

30

2

Prerequisites for participation (if applicable)

-

3

Learning Outcomes

  1. Students can use mathematical and logical concepts that support the scientific fields of computer science
  2. Students can solve logical problems
  3. Students can solve set problems
  4. Students can solve problems using relations and functions
  5. Students can solve mathematical induction problems
  6. Students can explain and solve graph problems
  7. Students can explain and solve tree problems

4

Subject aims/Content

Discrete mathematics is one of the most basic sciences that exist when you study informatics or computer science. In general, discrete mathematics is a branch of mathematics that discusses everything that is not related to each other or is also called discrete. Objects in discrete mathematics do not change continuously, but still have a certain value and are also separate. Discrete Mathematics discusses logical propositions via truth tables, mathematical theorems using mathematical induction, sets and perform operations and algebra on sets, properties of relations, equivalence and partial order relations, functions and their properties, graphs, and trees, and their main properties.

Study Material

Introduction to Logics

Logical operation

Sets

Sets

Matrix, relation, and function

Matrix, relation, and function

Matrix, relation, and function 

Logics, Sets, Matrix, Relation and Function 

Mathematical induction

Mathematical induction

Algorithms and integers

Graph theory

Graph theory

Tree

Tree

Logics, Sets, Matrix, Relation dan Function, Mathematics Induction, Algorithms and Integers, Graph Theory, Tree

5

Teaching methods

Synchronous: face-to-face meeting/online meeting

Asynchronous: Material is delivered on e-learning

6

Assesment Methods

Attendance, participation in the lecture

7

This module/course is used in the following study programme/s as well

Computer Science Study Programme

8

Responsibility for module/course

  • Dr. Luh Joni Erawati Dewi, S.T.,M.Pd.
  • NIDN : 0025067602

9

Other Information

[1] Munir, R. 2016. "Matematika Diskrit". Penerbit Informatika

[2] Johnsonbaugh. "Discrete Mathematics". 5th Edition.

[3] Gary Haggard, John Schlipf, Sue Whitesides. 2006. "Discrete Mathematics for Computer Science". Thomson Brooks/Cole

[4] Clifford Stein, Robert L. Drysdale, Kenneth Bogart. 2011. Discrete Mathematics for Computer Scientists. Pearson Education.

[5] Eric Lehman, F Thomson Leighton, Albert R Meyer. 2017. Mathematics for Computer Science. Samurai Media Limited

[6] Neso Academy. "Introduction to Discrete Mathematics". https://www.youtube.com/watch?v=p2b2Vb-cYCs&list=PLBlnK6fEyqRhqJPDXcvYlLfXPh37L89g3