Eskisehir Technical University Info Package Eskisehir Technical University Info Package
  • Info on the Institution
  • Info on Degree Programmes
  • Info for Students
  • Türkçe
About the Program Educational Objectives Key Learning Outcomes Course Structure Diagram with Credits Field Qualifications Matrix of Course& Program Qualifications Matrix of Program Outcomes&Field Qualifications
  • Faculty Of Computer And Information Technologies
  • Information Systems And Technologies (English)
  • Course Structure Diagram with Credits
  • Discrete Mathematics
  • Description
  • Description
  • Learning Outcomes
  • Course's Contribution to Prog.
  • Learning Outcomes & Program Qualifications
  • ECTS Credit Load

Course Introduction Information
Code - Course Title MAT239 - Discrete Mathematics
Course Type Required Courses
Language of Instruction İngilizce
Laboratory + Practice 3+0
ECTS 5.0
Course Instructor(s) PROFESÖR DOKTOR HÜSEYİN AZCAN
Mode of Delivery The mode of delivery of this course is Face to face
Prerequisites There is no prerequisite or co-requisite for this course.
Courses Recomended
Required or Recommended Resources Lovász, L., Pelikán, J. & Vesztergombi, K., Discrete Mathematics Elementary and Beyond, Springer, 2003.
Grimaldi, P. R., Discrete and Combinatorial Mathematics 5th Edition. Pearson Addison Wesley, 2004.
Rosen, K.H., Discrete Mathematics and Its Applications 5th Edition. McGraw-Hill, 2003.
Recommended Reading List
Assessment methods and criteria 2 midterm exams and 1 final exam
Work Placement N/A
Sustainability Development Goals Quality Education , Industry, Innovation and Infrastructure , Peace, Justice and Strong Institutions

Content

Weeks Topics
Week - 1 Fundamental Principles of Counting, Sets and the Number of Subsets
Week - 2 Combinatorial Tools: Induction, Inclusion-Exclusion Principle, Pigeonhole Principle, The Birthday Paradox
Week - 3 Binomial Coefficients and Pascal's Triangle
Week - 4 Fibonacci Numbers
Week - 5 Combinatorial Probability
Week - 6 Integers, Divisors, and Primes
Week - 7 Graphs
Week - 8 Trees
Week - 9 The Traveling Salesman Problem
Week - 10 Matchings in Graphs
Week - 11 Combinatorics in Geometry
Week - 12 Euler's Formula
Week - 13 Traveling salesman problem, mathching in graphs, Euler formula.
Week - 14 A Glimpse of Cryptography

Learning Activities and Teaching Methods

  • Teaching Methods
  • Lecture
  • Discussion
  • Question & Answer
  • Observation
  • Demonstration
  • Problem Solving
  • Brain Storming
  • Competences
  • Productive
  • Rational
  • Questoning
  • Creative
  • Follow ethical and moral rules
  • Work in teams
  • Eleştirel düşünebilme
  • Abstract analysis and synthesis
  • Problem solving
  • Elementary computing skills
  • Decision making
  • To work in interdisciplinary projects

Assessment Methods

Assessment Method and Passing Requirements
Quamtity Percentage (%)
Toplam (%) 0
  • Info on the Institution
  • Name and Adress
  • Academic Calendar
  • Academic Authorities
  • General Description
  • List of Programmes Offered
  • General Admission Requirements
  • Recognition of Prior Learning
  • Registration Procedures
  • ECTS Credit Allocation
  • Academic Guidance
  • Info on Degree Programmes
  • PhD / Proficiency in Art
  • Master's Degree
  • Bachelor's Degree
  • Associate Degree
  • Info for Students
  • Cost of living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Special Needs Students ı
  • Insurance
  • Financial Support for Students
  • Student Affairs Office
  • Info for Students
  • Learning Facilities
  • International Programmes r
  • Practical Information for Mobile Students
  • Language courses
  • Internships
  • Sports and Leisure Facilities
  • Student Associations