INTERNATIONAL BURCH UNIVERSITY
Faculty of Engineering and Natural Sciences
Department of Information Technologies
20132014
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 
100 
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 
 Propositional logic: application, equivalences
 Propositional logic: quantifiers, rules of inference.
 Set theory: set operations, functions, sequences.
 Set theory: cardinality of sets, matrices.
 Relations: properties, representations
 Boolean algebra: functions, gates, minimization
 Functions, algorithms and computational complexity
 Induction and recursion: mathematical induction and recursive algorithms
 Number theory: modular arithmetic, integer representations
 Number theory: congruences and cryptography
 Counting: Permutations, combinations and identities
 Counting: Recurrence relations, PIE
 Graphs and trees: basics, paths, planarity
 Graphs and trees: Applications of trees, spanning trees.

LABORATORY/PRACTICE PLAN 
 Propositional logic: application, equivalences
 Propositional logic: quantifiers, rules of inference.
 Set theory: set operations, functions, sequences.
 Set theory: cardinality of sets, matrices.
 Relations: properties, representations
 Boolean algebra: functions, gates, minimization
 Functions, algorithms and computational complexity
 Induction and recursion: mathematical induction and recursive algorithms
 Number theory: modular arithmetic, integer representations
 Number theory: congruences and cryptography
 Counting: Permutations, combinations and identities

 Counting: Recurrence relations, PIE
 Graphs and trees: basics, paths, planarity
 Graphs and trees: Applications of trees, spanning trees.

Description 
 Lectures
 Excersises
 Assignments

Description (%) 
Homework   30  Midterm Exam(s)   30  Final Exam  1  40 

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) 
 1. K. Rosen, Discrete mathematics and its applications, McGrawHill, 7th edition, 2012
 2. R. Grimaldi, Discrete and Combinatorial Mathematics: an applied introduction, Addison Wesley, 5th ed., 2004
 3. Ž. Jurić, Diskretna matematika za studente tehničkih nauka, Elektrotehnički fakultet Sarajevo, 2011.

ECTS (Allocated based on student) WORKLOAD 
Lecture (14 weeks x Lecture hours per week)  1  25  25  Laboratory / Practice (14 weeks x Laboratory/Practice hours per week)  1  25  25  Midterm Examination (1 week)  1  25  25  Final Examination(1 week)  1  25  25  Preparation for Midterm Examination    0  Preparation for Final Examination  4   0 

