INTERNATIONAL BURCH UNIVERSITY
Faculty of Engineering and Natural Sciences
Department of Information Technologies
2012-2013

SYLLABUS
Code Name Level Year Semester
MTH 203 Discrete Mathematics Undergraduate 2 Fall
Status Number of ECTS Credits Class Hours Per Week Total Hours Per Semester Language
Compulsory 4 2 + 2 0 ENGLISH

Instructor Assistant Coordinator
Harun Šiljak, Assist. Prof. Dr. Harun Šiljak, Assist. Prof. Dr.
[email protected] no email

COURSE OBJECTIVE
• Introduce the fundamental topics and techniques in discrete and combinatorial reasoning
• Introduce wide variety application of Discrete mathematics in Computer Science

COURSE CONTENT
Week
Topic
  1. CHAPTER 1: FUNDAMENTALS OF LOGIC
  2. CHAPTER 1: FUNDAMENTALS OF LOGIC
  3. CHAPTER 2: FUNDAMENTALS PRINCIPLES OF COUNTING
  4. CHAPTER 2: FUNDAMENTALS PRINCIPLES OF COUNTING
  5. CHAPTER 3: SET THEORY
  6. REVISION FOR MIDTERM
  7. MIDTERM
  8. CHAPTER 4: MATHEMATICAL INDUCTION
  9. CHAPTER 4: MATHEMATICAL INDUCTION
  10. CHAPTER 5: PROPERTIES OF INTEGERS
  11. CHAPTER 5: PROPERTIES OF INTEGERS
  12. CHAPTER 6: RELATİONS AND FUNCTİONS
  13. CHAPTER 7: GRAPH THEORY
  14. REVISION FOR FINAL

LABORATORY/PRACTICE PLAN
Week
Topic

    TEACHING/ASSESSMENT
    Description
    • Lectures
    • Practical Sessions
    • Excersises
    • Assignments
    Description (%)
    Method Quantity Percentage (%)
    Quiz10
    Homework20
    Midterm Exam(s)25
    Final Exam135
    + ATTENDANCE
    10
    Total: 90
    Learning outcomes
    • • Apply theory and techniques from discrete methods, combinatorial and graph theory in the applications of computer science.
    • • Establish knowledge and understanding of data structures ,theory of computer languages and the analysis of algorithms using the theory and technique from discrete mathematics.
    TEXTBOOK(S)
    • • Grimaldi, R. (2004) Discrete and Combinatorial Mathematics: An Applied Introduction .New York :Addison Wesley Pub.Co.Inc. 5th edition
    • • Kenneth H. Rosen (2003) Discrete Mathematics and its Applications : Mc Graw Hill. 5th edition

    ECTS (Allocated based on student) WORKLOAD
    Activities Quantity Duration (Hour) Total Work Load
    Lecture (14 weeks x Lecture hours per week) 0
    Laboratory / Practice (14 weeks x Laboratory/Practice hours per week) 0
    Midterm Examination (1 week) 0
    Final Examination(1 week) 0
    Preparation for Midterm Examination 0
    Preparation for Final Examination600
    Total Workload: 0
    ECTS Credit (Total workload/25): 0