BIT 11003/BIT 11103 DISCRETE

STRUCTURE
Content
Subject Information
Course Information
Course Content
Textbook

Course Information & Learning
Materials
Log on: http://author.uthm.edu.my
Subject Information
Sem I
2014/15
BIT
11003/
BIT
11103
Student
Academi
c Load








Kategori Aktiviti
(Category of Activities)
Aktiviti Pembelajaran
(Learning Activities)
Jumlah Jam/
Semester
(Total Hours/
Semester)
Pembelajaran bersemuka
(Face-to-face learning)
Kuliah (Lecture) 28
Tutorial / Amali (Tutorial /
Practical)
28
Aktiviti pembelajaran berpusatkan
pelajar lain
(Other student centered learning
activities)
0
Pembelajaran kendiri
(Independent study)
Penyediaan tugasan, projek dan
lain-lain
(Preparing assignment, project and
others)
24
Ulangkaji
(Revision)
28
Persediaan bagi pentaksiran
(Preparation for assessment)
6
Pentaksiran rasmi
(Formal assessment)
Pentaksiran berterusan
(Continuous assessment)
3
Peperiksaan akhir
(Final examination)
3
JUMLAH JAM BELAJAR PELAJAR (JBP)
(TOTAL STUDENT LEARNING TIME (SLT))
120
Course information
Contact details
Nureize Arbaiy
nureize@uthm.edu.my
Office: Level 2 (ext: 3726)
Lectures
Week 1 : 8/9/2014

Tutorials
Starts on week 2 of the semester
Textbook and reference
Recommended textbooks:
Rosen K., 2007. Discrete mathematics and its applications. 6
th
ed.,
New York: McGraw Hill Inc. Call number: QA 39.2 .R65 2007
Kolman, B., Busby, R., Ross, S. 2004. Discrete mathematical
structures. New Jersey: Prentice Hall, Inc. Call number:
QA76.9.M35 .K64 2004
Johnsonbaugh R., 2009. Discrete mathematics. 7
th
ed., Singapore:
Prentice Hall, Inc. Call number: QA39.2 .J63 2009
Simpson, A., 2002. Discrete mathematics by example. United
Kingdom: McGraw-Hill. Call number: QA39.2 .S55 2002
Stanoyevitch, Alexander., 2011. Discrete structures with
contemporary applications. Chapman & Hall/CRC Press. Call
number: QA76.9.M35 .S73 2011
Krantz, S. G. 2009. Discrete mathematics demystified. New York:
McGraw-Hill.Call number: QA76.9.M35 .K72 2009
Course content
(WEEK) (CONTENT) (ASSESSMENT)
1 1. LOGICS AND PROOF (4 Hrs)
Fundamental of logic
Proposition

2 Equivalence
Predicates
Quantifier
Assignment/
Tutorial and
Project Instruction
3 2. SET (4 Hrs)
Operation of sets
Quiz
4 Properties of sets
5 3. MATHEMATICAL INDUCTION
(4 Hrs)
Induction method
Basic and principle of mathematical
induction
6 Recursive Test
7 4. RELATION AND FUNCTION (4
HOURS)
Relation
Relation properties
Function representation
8 Equivelence relation
Types of function
(WEEK) (CONTENT) (ASSESSMENT)
9 5. RECURRENCE RELATION (4
Hrs)
Recurrence relation and solution
Relation
representation
10 Types of function
11 6. ALGORITHM (4 Hrs)
Examples of algorithm
Algorithm Analysis
12 Algorithm complexity Assignment
submission
13 7. GRAPH THEORY (4 Hrs)
Definition of Graph
Graph Representation
Project
presentation and
Report
Submission
14 Euler and Hamiltonian Path
Shortest Path
FINAL EXAMINATION
Tutorial
MINGGU
(WEEK)
AMALI
(CONTENT)
1 2
Logics And Proof
3 4
Sets
5 - 6
Mathematical induction
7 - 8
Relation & Function
9 - 10
Recurrence Relation
11 -12
Algorithm
13 - 14
Graph Theory
Course Evaluation
PENTAKSIRAN (ASSESSMENT):
1. Kuiz (Quiz) : 5 %
2. Ujian (Test) : 20 %
3. Tugasan (Assignment) : 10 %
4. Tutorial (Tutorial) : 10 %
3. Project (Project) : 15 %
4. Peperiksaan Akhir
(Final Examination)
: 40 %
Jumlah (Total) : 100 %
Next Chapter : 1
1.0 LOGICS AND PROOF
Fundamental of logics
Proposition
Equivalence
Predicates
Quantifier