INTERNATIONAL BURCH UNIVERSITY
Faculty of Engineering and Natural Sciences
Department of Information Technologies
2016-2017

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 121 ENGLISH

 Instructor Assistant Coordinator Adnan Hodžić, Research Assistant Dinko Osmankovic Zeynep Orhan, Assist. Prof. Dr. [email protected] [email protected] no email

 This course provides mathematical foundations for computer science students. It introduces basic logic, set theory, proof techniques, relations, enumeration, and elements of graph theory

COURSE OBJECTIVE
To equip computer science students with mathematical foundations that are essential to the discipline.

COURSE CONTENT
Week
Topic
1. Formal Logic, Propositional Logic, Predicate Logic
2. Logic in Mathematics, Methods of Proof
3. Sets, Operations on sets
4. Relations, partial orderings
5. Equivalence relations and equivalence classes
6. Functions, one-to-one, onto functions, bijections
7. Mathematical Induction
8. Basic Counting Techniques
9. Counting: Permutations, combinations and identities
10. Counting: Recurrence relations, PIE
11. Number theory: modular arithmetic, integer representations
12. Basic Graph Theory
13. Graphs and trees: basics, paths, planarity
14. Graphs and trees: Applications of trees, spanning trees.
15. Growth of Functions and Algorithm Analysis

LABORATORY/PRACTICE PLAN
Week
Topic
1. Formal Logic, Propositional Logic, Predicate Logic
2. Logic in Mathematics, Methods of Proof
3. Sets, Operations on sets
4. Relations, partial orderings
5. Equivalence relations and equivalence classes
6. Functions, one-to-one, onto functions, bijections
7. Mathematical Induction
8. Basic Counting Techniques
9. Counting: Permutations, combinations and identities
10. Counting: Recurrence relations, PIE
11. Number theory: modular arithmetic, integer representations

 Basic Graph TheoryGraphs and trees: basics, paths, planarityGraphs and trees: Applications of trees, spanning trees.Growth of Functions and Algorithm Analysis

TEACHING/ASSESSMENT
Description
• Interactive Lectures
• Excersises
• Presentation
• Discussions and group work
• Problem solving
• Assignments
Description (%)
Method Quantity Percentage (%)
Quiz15
Homework20
Midterm Exam(s)20
Final Exam140
Total: 95
Learning outcomes
• Form rigorous arguments to justify mathematical assertions
• Evaluate and critique logical and mathematical arguments
• Communicate effectively with engineering community and with general public
• Apply basic logic, set theory, counting techniques and other mathematical ideas in computer science
• Demonstrate an understading and appreciation of formal mathematics
• Analyse running times of algorithms
TEXTBOOK(S)
• Hunter, D. J. (2012) Essentials of Discrete Mathematics. Jones & Bartlett Learning

ECTS (Allocated based on student) WORKLOAD
Activities Quantity Duration (Hour) Total Work Load
Lecture (14 weeks x Lecture hours per week)14228
Laboratory / Practice (14 weeks x Laboratory/Practice hours per week)14228
Midterm Examination (1 week)122
Final Examination(1 week)122
Preparation for Midterm Examination133
Preparation for Final Examination166
Assignment / Homework/ Project13452
Seminar / Presentation 0
Total Workload: 121
ECTS Credit (Total workload/25): 5