1. BIT 11003/BIT 11103 DISCRETE STRUCTURE

2. Content Course Information & Learning Materials
Subject Information
Course Information
Course Content
Textbook
Course Information & Learning Materials
Log on:

3. Subject Information Sem I 2014/15 BIT 11003/ BIT 11103
Student Academic 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)
Aktiviti pembelajaran berpusatkan pelajar lain
(Other student centered learning activities)
Pembelajaran kendiri
(Independent study)
Penyediaan tugasan, projek dan lain-lain
(Preparing assignment, project and others) 24
Ulangkaji
(Revision)
Persediaan bagi pentaksiran
(Preparation for assessment) 6
Pentaksiran rasmi
(Formal assessment)
Pentaksiran berterusan
(Continuous assessment) 3
Peperiksaan akhir
(Final examination)
JUMLAH JAM BELAJAR PELAJAR (JBP)
(TOTAL STUDENT LEARNING TIME (SLT))
120

4. Course information Contact details Lectures Tutorials Nureize Arbaiy
Office: Level 2 (ext: 3726)
Lectures
Week 1 : 8/9/2014
Tutorials
Starts on week 2 of the semester

5. Textbook and reference
Recommended textbooks:
Rosen K., Discrete mathematics and its applications. 6th ed., New York: McGraw Hill Inc. Call number: QA R
Kolman, B., Busby, R., Ross, S Discrete mathematical structures. New Jersey: Prentice Hall, Inc. Call number: QA76.9.M35 .K
Johnsonbaugh R., Discrete mathematics. 7th ed., Singapore: Prentice Hall, Inc. Call number: QA39.2 .J
Simpson, A., Discrete mathematics by example. United Kingdom: McGraw-Hill. Call number: QA39.2 .S
Stanoyevitch, Alexander., Discrete structures with contemporary applications. Chapman & Hall/CRC Press. Call number: QA76.9.M35 .S
Krantz, S. G Discrete mathematics demystified. New York: McGraw- Hill.Call number: QA76.9.M35 .K

6. 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

7. Tutorial MINGGU (WEEK) AMALI (CONTENT) 1 – 2 3 – 4 5 - 6 7 - 8 9 - 10
Logics And Proof
3 – 4
Sets
5 - 6
Mathematical induction
7 - 8
Relation & Function
9 - 10
Recurrence Relation
11 -12
Algorithm
Graph Theory

8. Course Evaluation PENTAKSIRAN (ASSESSMENT): 1. Kuiz (Quiz) : 5 %%
2. Ujian (Test) %
3. Tugasan (Assignment) %
4. Tutorial (Tutorial)
3. Project (Project) %
Peperiksaan Akhir
(Final Examination) %
Jumlah (Total) %

9. Next Chapter : 1 1.0 LOGICS AND PROOF Fundamental of logics
Proposition
Equivalence
Predicates
Quantifier