MATH204 Discrete Mathematics
MATH204 Discrete Mathematics
Syllabus | International University of Sarajevo - Last Update on Oct 10, 2025
Syllabus Quick Jump
Search and navigate to any syllabus instantly
Faculty of Engineering and Natural Sciences
Özge Büyükdağlı
Course Lecturer
Course Objectives
This course introduces the fundamental concepts and methods of discrete mathematics, providing the mathematical foundation essential for computer science, engineering, and related fields. Students will develop the ability to think and communicate mathematically while gaining proficiency in logical reasoning, proof techniques, and problem solving.
Learning Outcomes
After successful completion of the course, the student will be able to:
Course Materials
Required Textbook
Epp, S. S. (2019). Discrete mathematics with applications (5th ed.). Cengage Learning.
Additional Literature
Jenkyns, T., & Stephenson, B. (2018). Fundamentals of discrete math for computer science (2nd ed.). Springer.Teaching Methods
Lectures
Tutorials / Problem-Solving Sessions
Weekly Topics
| Week | Topic | Readings / References |
|---|---|---|
| 1 | Introduction to the Course, Speaking Mathematically | Chapter 1 |
| 2 | The Logic of Compound Statements | Chapter 2 |
| 3 | The Logic of Quantified Statements | Chapter 3 |
| 4 | Methods of Proof: Direct Proof and Counterexample | Chapter 4 |
| 5 | Methods of Proof: Indirect Argument: Contradiction, Contraposition | Chapter 4 |
| 6 | Sequences, Mathematical Induction | Chapter 5 |
| 7 | More on Induction, Strong Induction, Recursion | Chapter 5 |
| 8 | MIDTERM | |
| 9 | Set Theory: Definitions, Properties, Proofs | Chapter 6 |
| 10 | Properties of Functions: One to one , Onto functions, Composition | Chapter 7 |
| 11 | Properties of Relations: Relations on Sets, Reflexivity, Symmetry, and Transitivity | Chapter 8 |
| 12 | Equivalence Relations, Partial Order Relations | Chapter 8 |
| 13 | Theory of Graphs and Trees | Chapter 10 |
| 14 | Theory of Graphs and Trees | Chapter 10 |
| 15 | Review, Preparation for the Final Exam |
Course Schedule (All Sections)
| Section | Type | Day 1 | Venue 1 | Day 2 | Venue 2 |
|---|---|---|---|---|---|
| MATH204.1 | Tutorial | Thursday 15:00 - 16:50 | A F1.11 | - | - |
| MATH204.2 | Tutorial | Friday 14:00 - 15:50 | A F1.11 | - | - |
| MATH204.1 | Course | Monday 09:00 - 11:50 | B F1.23 - Amphitheater I | - | - |
| MATH204.2 | Course | Wednesday 09:00 - 11:50 | B F1.23 - Amphitheater I | - | - |
| MATH204.3 | Tutorial | Thursday 15:00 - 16:50 | A F1.24 - Amphitheater I | - | - |
| MATH204.4 | Tutorial | Thursday 15:00 - 16:50 | A F1.10 | - | - |
Office Hours & Room
| Day | Time | Office | Notes |
|---|---|---|---|
| Monday | 15:00 - 17:00 | A F1.8 | |
| Tuesday | 12:00 - 17:00 | A F1.8 | |
| Wednesday | 15:00 - 17:00 | A F1.8 |
Assessment Methods and Criteria
Assessment Components
Final Exam
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
Mid-term
AI: Not AllowedAlignment with Learning Outcomes : 1 2
Quizzes
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
IUS Grading System
| Grading Scale | IUS Grading System | IUS Coeff. | Letter (B&H) | Numerical (B&H) |
|---|---|---|---|---|
| 0 - 44 | F | 0 | F | 5 |
| 45 - 54 | E | 1 | ||
| 55 - 64 | C | 2 | E | 6 |
| 65 - 69 | C+ | 2.3 | D | 7 |
| 70 -74 | B- | 2.7 | ||
| 75 - 79 | B | 3 | C | 8 |
| 80 - 84 | B+ | 3.3 | ||
| 85 - 94 | A- | 3.7 | B | 9 |
| 95 - 100 | A | 4 | A | 10 |
Late Work Policy
Information about late submission policies will be shared during class and posted in this section. Please check back for official guidelines.
ECTS Credit Calculation
📚 Student Workload
This 6 ECTS credit course corresponds to 150 hours of total student workload, distributed as follows:
Lecture Hours
45 hours ⏳ (15 week × 3 h)
Home Study
30 hours ⏳ (15 week × 2 h)
Midterm Study
10 hours ⏳ (1 week × 10 h)
Final Exam Study
15 hours ⏳ (1 week × 15 h)
Quizzes
30 hours ⏳ (3 week × 10 h)
Tutorials
20 hours ⏳ (10 week × 2 h)
150 Total Workload Hours
6 ECTS Credits
Course Policies
Academic Integrity
All work submitted must be your own. Plagiarism, cheating, or any form of academic dishonesty will result in disciplinary action according to university policies. When in doubt about citation practices, consult the instructor.
Attendance Policy
Students are expected to adhere to the attendance requirements as outlined in the International University of Sarajevo Study Rules and Regulations. Excessive absences, whether excused or unexcused, may impact academic performance and eligibility for assessment. Mandatory sessions (e.g., labs, workshops) require attendance unless formally exempted. For detailed policies on absences, documentation, and penalties, please refer to the official university regulations.
Technology & AI Policy
Laptops/tablets may be used for note-taking only during lectures. Phones should be silenced and put away during all class sessions. Audio/video recording requires prior permission from the instructor.
Artificial Intelligence (AI) Usage: The use of AI tools (e.g., ChatGPT, Copilot, Gemini) varies by assessment component. Please refer to the AI usage indicator next to each assessment item in the Assessment Methods and Criteria section above. Submitting AI-generated content as your own work, where AI is not explicitly allowed, constitutes an academic integrity violation.
Communication Policy
All course-related communication should occur through official university channels (institutional email or SIS). Emails should include [MATH204] in the subject line.
Academic Quality Assurance Policy
Course Academic Quality Assurance is achieved through Semester Student Survey. At the end of each academic year, the institution of higher education is obliged to evaluate work of the academic staff, or the success of realization of the curricula.
Learning Tips
Be prepared to contribute thoughtfully during class discussions, labs, or collaborative work. Active participation deepens understanding and encourages critical thinking.
Complete assigned readings or prep materials before class. Take notes, highlight key ideas, and jot down questions. Aim to grasp core concepts and their applications—not just facts.
Use course frameworks or methodologies to analyze problems, case studies, or projects. Begin early to allow time for reflection and refinement. Seek feedback to improve your work.
Don’t hesitate to reach out when something is unclear. Use office hours, discussion boards, or peer networks to clarify concepts and stay on track.
Syllabus Last Updated on Oct 10, 2025 | International University of Sarajevo
Print Syllabus
Referencing Curricula Print this page
| Course Code | Course Title | Weekly Hours* | ECTS | Weekly Class Schedule | ||||||
| T | P | |||||||||
| MATH204 | Discrete Mathematics | 3 | 2 | 6 | Section 1: Mon. 09:00-11:50 / Section 2: Wed. 09:00-11:50 | |||||
| Prerequisite | MATH101 | It is a prerequisite to | CS207, CS302, CS313, CS402, CS416, MATH209, SE302 | |||||||
| Lecturer | Özge Büyükdağlı | Office Hours / Room / Phone | Monday: 15:00-17:00 Tuesday: 12:00-17:00 Wednesday: 15:00-17:00 |
|||||||
| obuyukdagli@ius.edu.ba | ||||||||||
| Assistant | TBA | Assistant E-mail | ||||||||
| Course Objectives | This course introduces the fundamental concepts and methods of discrete mathematics, providing the mathematical foundation essential for computer science, engineering, and related fields. Students will develop the ability to think and communicate mathematically while gaining proficiency in logical reasoning, proof techniques, and problem solving. | |||||||||
| Textbook | Epp, S. S. (2019). Discrete mathematics with applications (5th ed.). Cengage Learning. | |||||||||
| Additional Literature |
|
|||||||||
| Learning Outcomes | After successful completion of the course, the student will be able to: | |||||||||
|
||||||||||
| Teaching Methods | Lectures, Tutorials / Problem-Solving Sessions | |||||||||
| Teaching Method Delivery | Face-to-face | Teaching Method Delivery Notes | ||||||||
| WEEK | TOPIC | REFERENCE | ||||||||
| Week 1 | Introduction to the Course, Speaking Mathematically | Chapter 1 | ||||||||
| Week 2 | The Logic of Compound Statements | Chapter 2 | ||||||||
| Week 3 | The Logic of Quantified Statements | Chapter 3 | ||||||||
| Week 4 | Methods of Proof: Direct Proof and Counterexample | Chapter 4 | ||||||||
| Week 5 | Methods of Proof: Indirect Argument: Contradiction, Contraposition | Chapter 4 | ||||||||
| Week 6 | Sequences, Mathematical Induction | Chapter 5 | ||||||||
| Week 7 | More on Induction, Strong Induction, Recursion | Chapter 5 | ||||||||
| Week 8 | MIDTERM | |||||||||
| Week 9 | Set Theory: Definitions, Properties, Proofs | Chapter 6 | ||||||||
| Week 10 | Properties of Functions: One to one , Onto functions, Composition | Chapter 7 | ||||||||
| Week 11 | Properties of Relations: Relations on Sets, Reflexivity, Symmetry, and Transitivity | Chapter 8 | ||||||||
| Week 12 | Equivalence Relations, Partial Order Relations | Chapter 8 | ||||||||
| Week 13 | Theory of Graphs and Trees | Chapter 10 | ||||||||
| Week 14 | Theory of Graphs and Trees | Chapter 10 | ||||||||
| Week 15 | Review, Preparation for the Final Exam | |||||||||
| Assessment Methods and Criteria | Evaluation Tool | Quantity | Weight | Alignment with LOs | AI Usage |
| Final Exam | 1 | 40 | 1-5 | Not Allowed | |
| Semester Evaluation Components | |||||
| Mid-term | 1 | 30 | 1,2 | Not Allowed | |
| Quizzes | 3 | 30 | 1-5 | Not Allowed | |
| *** ECTS Credit Calculation *** | |||||
| Activity | Hours | Weeks | Student Workload Hours | Activity | Hours | Weeks | Student Workload Hours | |||
| Lecture Hours | 3 | 15 | 45 | Home Study | 2 | 15 | 30 | |||
| Midterm Study | 10 | 1 | 10 | Final Exam Study | 15 | 1 | 15 | |||
| Quizzes | 10 | 3 | 30 | Tutorials | 2 | 10 | 20 | |||
| Total Workload Hours = | 150 | |||||||||
| *T= Teaching, P= Practice | ECTS Credit = | 6 | ||||||||
| Course Academic Quality Assurance: Semester Student Survey | Last Update Date: 10/10/2025 | |||||||||