No.

1.
2.

3.
4.
5.

6.

7.
8.

9.

10.
11.
12.
13.
14.

Details of Course
Course Name: Discrete mathematics
Course Code: DTT 107
The letter D refers to the programme level which is Diploma; the letter T refers to the course offered by School
of Information Technology Infrastructure Material and Science; the letter T refers to Computer Science subject.
The number 1 represents year 1 of study and 07represents serial number of taught course.
Name(s) of academic staff: Hasliza Hashim
Rationale for the inclusion of the course/module in the programme: Students will learn the essential
mathematic concepts and ideas in discrete mathematics, which are required for rigorous studies in most areas
in computer science.
Semester and year taught: 1/1
Face to Face
L=Lecture, T=Tutorial, P=Practical O=Others*
Total Guided and Independent Learning
Total Student
*site visit, seminar, workshop, project etc.
Learning Time
L
T
P
O
Guided
Independent
(SLT)
30
23
53
67
120
120/40=3 Credit
Credit Value: 3
Prerequisite:
Course Learning Outcomes:
CLO1: Ability to show understanding of fundamental mathematical concepts, definitions and results.
CLO2: Ability to get certain mathematical results can be proved by induction.
CLO3: Ability to use recursive definitions, and to analyse them.
CLO4: Ability to count different types of discrete mathematical structures.
CLO5: Ability to give ideas in discrete probability and how to use them.
CLO6: Ability to describe computer programs in a formal mathematical manner.
Transferable Skills:
Enabling knowledge: Ability to apply new techniques and reasoning.
Problem solving: Ability to solve mathematical problems.
Critical Analysis: Ability to analyze elementary algorithm.
Teaching-learning and assessment strategy:
Lecture, quiz, assignment and exam.
Synopsis:
The primary goal of this course is to introduce discrete structures for information technology. The focus will be
on set theory, logic, relations and functions, Inductions and recursion, elementary algorithm analysis, counting
and probability, graphs and trees, and theory of computation.
Mode of Delivery:
Lecture, Tutorial, and Discussion
Assessment Methods and
Coursework
50%
Types:
Examination
50%

15.

Mapping of the Programme Objectives to the Programme Learning Outcomes

Programme
Objectives(PO)

PLO7: Ability to process strong ethical principles and able to contribute to the development of the society. (SSR / MES)

PLO6: Ability to apply interpersonal and communication skill as a junior software developer/ software designer/ programmers. (able to work in team and perform supervisory roles)

PLO5: Ability to manage and use information as a foundation for self directed lifelong learning. (LLIM)

techniques to generate innovative ideas in solving realistic problems. (CT) PLO4: Ability to identify, select appropriate theoretical models and/or

(PS)PLO3: Ability to use various software development tools and/or practice technical competence in a specific software engineering discipline.

PLO2: Ability to analyze, design and/or develop various system software by applying the standard software development process. (PS/CT)

PLO1:Ability to acquire and apply knowledge of software engineering fundamentals; (K)

Programme
Learning
Outcomes
(PLO)

To produce graduates
with the knowledge and
principles in software
engineering disciplines.
To produce graduates
with fundamental
programming skills,
system design and
application of software
engineering techniques
To produce ethical
practitioners and
software entrepreneurs
skilled in applying
software engineering
processes to systems

1 = related to PO
2 = partial fulfilment of the PO
3 = total fulfilment of PO

16.

PLO7

PLO6

PLO5

PLO4

Ability to give ideas in

discrete probability and
how to use them.

Assesment
Method

Lecture, quiz,
assignment and
exam

Lecture

Lecture, quiz,
assignment and
exam

Lecture

Lecture, quiz,
assignment and
exam

Lecture

Lecture, quiz,
assignment and
exam

Lecture

Lecture, quiz,
assignment and
exam

Ability to use recursive

definitions, and to analyse
them.
Ability to count different
types
of
discrete
mathematical structures.

PLO3

Ability to get certain

mathematical results can
be proved by induction.

PLO2

PLO1

Mapping of the course/module to the Programme Learning Outcomes:

Programme
Learning
Outcomes
(PLO)
Delivery
Course
Method
Learning
Outcomes
(CLO)
Ability
to
show
understanding
of
fundamental mathematical
1
2
Lecture
concepts, definitions and
results.

1 = related to LOD without formal assessment

2 = partial fulfillment of the LOD with formal assessment
3 = total fulfillment of LOD with formal assessment

17.

Content outline of the course/module and the SLT per topic:

Topics
Set Theory
Set notation
Operations on sets (union, intersections differences and complements
Logic
Introduction of Logical Statements and logic rules
Simple Logical Implications and Equivalence using Truth table
Digital Logic Circuit
Constructing the input/output table for a circuit
Boolean expression for a circuit
Relations and Functions
Cartesian Products and Relations on sets
Functions defined on general sets and One-to-one functions
Induction and Recursion
Sequences and series
General recursive definition
Definition of Mathematical Induction

SLT Hours
L

Total

16

10

19

14

12

23

Counting and probability

The basics of counting
- Probability
Graphs and Trees
Introduction to graphs and trees
Graph Terminology
Simple applications of trees
Number Systems
Binary, octal, decimal, hexadecimal representations of number
- Converting one system to another
Total SLT

16

16

16

120
Main references supporting the course:
(a) K. H. Rosen (2011). Discrete Mathematics and Its Applications. 7th.Ed. NY: McGraw-Hill International
Editions
(b) Susanna S. Epp. (2010) Discrete Mathematics, 4th . Ed. Thomson Books/Cole.
18.

Additional references supporting the course:

(a) Gary Chartrand, Ping Zhang, Discrete Mathematics 1st Edition, 2011.
(b) Kenneth Rosen, Jerrold Grossman, Student's Solutions Guide to Accompany Discrete Mathematics and Its
Applications, 7th Edition, 2011.

19.

Other additional information: