INTERNATIONAL BURCH UNIVERSITY
Faculty of Engineering and Natural Sciences
Department of Information Technologies
20152016
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 
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 
 Formal Logic, Propositional Logic, Predicate Logic
 Logic in Mathematics, Methods of Proof
 Sets, Operations on sets
 Relations, partial orderings
 Equivalence relations and equivalence classes
 Functions, onetoone, onto functions, bijections
 Mathematical Induction
 Basic Counting Techniques
 Counting: Permutations, combinations and identities
 Counting: Recurrence relations, PIE
 Number theory: modular arithmetic, integer representations
 Basic Graph Theory
 Graphs and trees: basics, paths, planarity
 Graphs and trees: Applications of trees, spanning trees.
 Growth of Functions and Algorithm Analysis

LABORATORY/PRACTICE PLAN 
 Formal Logic, Propositional Logic, Predicate Logic
 Logic in Mathematics, Methods of Proof
 Sets, Operations on sets
 Relations, partial orderings
 Equivalence relations and equivalence classes
 Functions, onetoone, onto functions, bijections
 Mathematical Induction
 Basic Counting Techniques
 Counting: Permutations, combinations and identities
 Counting: Recurrence relations, PIE
 Number theory: modular arithmetic, integer representations

 Basic Graph Theory
 Graphs and trees: basics, paths, planarity
 Graphs and trees: Applications of trees, spanning trees.
 Growth of Functions and Algorithm Analysis

Description 
 Interactive Lectures
 Excersises
 Presentation
 Discussions and group work
 Problem solving
 Assignments

Description (%) 
Quiz   15  Homework   20  Midterm Exam(s)   20  Presentation   15  Final Exam  1  30 

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 
Lecture (14 weeks x Lecture hours per week)  14  2  28  Laboratory / Practice (14 weeks x Laboratory/Practice hours per week)  14  2  28  Midterm Examination (1 week)  1  2  2  Final Examination(1 week)  1  2  2  Preparation for Midterm Examination  1  3  3  Preparation for Final Examination  1  6  6  Assignment / Homework/ Project  13  4  52  Seminar / Presentation    0 

