MAT205 Discrete MathematicsInstitutional InformationDegree Programs Computer EngineeringInformation For StudentsDiploma SupplementErasmus Policy StatementNational Qualifications
Computer Engineering

Preview

Bachelor TR-NQF-HE: Level 6 QF-EHEA: First Cycle EQF-LLL: Level 6

Course General Introduction Information

Course Code: MAT205
Course Name: Discrete Mathematics
Course Semester: Fall
Course Credits:
ECTS
6
Language of instruction:
Course Requirement:
Does the Course Require Work Experience?: No
Type of course: Necessary
Course Level:
Bachelor TR-NQF-HE:6. Master`s Degree QF-EHEA:First Cycle EQF-LLL:6. Master`s Degree
Mode of Delivery: Face to face
Course Coordinator : Assoc. Prof. HATİCE ESRA ÖZKAN UÇAR
Course Lecturer(s): Prof. Dr. H. Esra ÖZKAN UÇAR
Course Assistants:

Course Purpose and Content

Course Objectives: Learning some counting techniques and combinatorial structures.
Course Content: Fundamentals of counting, Permutations and combinations, Binomial coefficients and identities, Recurrence relations.

Learning Outcomes

The students who have succeeded in this course;
1) Learns some counting techniques.
2) Develops combinatorial thinking skills.
3) Solve recurrence relations
4) Develops logical reasoning skills.
5) Learns the applications of some combinatorial structures.

Course Flow Plan

Week Subject Related Preparation
1) Counting and Basic principles -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
2) Permutation and Combination -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
3) binomial theorem -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
4) Repeated Combinations -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
5) Introduction to Discrete Probability -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
6) Pigeonhole principle -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
7) Inclusion-Exclusion principle -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
8) Exam week
9) Recurrence relations -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
10) Introduction to number theory -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
11) Applications of number theory -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
12) cryptography -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
13) Introduction to Graph Theory -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
14) Graph Representation and Graph Homostructure -Kenneth H. Rosen, Discrete Mathematics and Applications, Translation from the 7th Edition, Prof. Dr. Ömer Akın, Prof. Dr. Murat Özbayoğlu, Palme Publishing Ankara, 2015
15) finals week
16) finals week
17) finals week

Sources

Course Notes / Textbooks: Kenneth Rosen, “Discrete Mathematics and Its Applications”, Seventh Ed., McGraw-Hill, 2012.
References: Kenneth Rosen, “Discrete Mathematics and Its Applications”, Seventh Ed., McGraw-Hill, 2012.

Course - Learning Outcome Relationship

No Effect 1 Lowest 2 Medium 3 Highest
       
Program Outcomes Level of Contribution
1) Adequate knowledge in mathematics, science and engineering subjects pertaining to the relevant discipline; ability to use theoretical and applied knowledge in these areas in complex engineering problems. 3
2) Ability to identify, formulate, and solve complex engineering problems; ability to select and apply proper analysis and modeling methods for this purpose. 2
3) Ability to design a complex system, process, device or product under realistic constraints and conditions, in such a way as to meet the desired result; ability to apply modern design methods for this purpose 2
4) Ability to devise, select, and use modern techniques and tools needed for analyzing and solving complex problems encountered in engineering practice; ability to employ information technologies effectively. 2
5) Ability to design and conduct experiments, gather data, analyze and interpret results for investigating complex engineering problems or discipline specific research questions. 2
6) Ability to work efficiently in intra-disciplinary and multi-disciplinary teams; ability to work individually. 2
7) Ability to communicate effectively in Turkish, both orally and in writing; knowledge of a minimum of one foreign language; ability to write effective reports and comprehend written reports, prepare design and production reports, make effective presentations, and give and receive clear and intelligible instructions. 1
8) Knowledge of the global and societal impacts of engineering practices on priority issues such as health, environment and safety and contemporary issues; knowledge of the legal aspects of engineering solutions. awareness of the consequences 1
9) Consciousness to behave according to ethical principles and professional and ethical responsibility; knowledge on standards used in engineering practice. 1
10) Information about business life practices such as project management, risk management, and change management; awareness of entrepreneurship, innovation, and knowledge about sustainable development. 1
11) Ability to design systems to meet desired needs 2
12) Ability to apply basic sciences in the field of computer engineering 1
13) Ability to implement designs by experiments 2
14) Recognition of the need for lifelong learning; ability to access information, to follow developments in science and technology, and to continue to educate him/herself. 2

Learning Activity and Teaching Methods

Anlatım
Bireysel çalışma ve ödevi
Course
Okuma
Homework
Problem Çözme

Measurement and Evaluation Methods and Criteria

Yazılı Sınav (Açık uçlu sorular, çoktan seçmeli, doğru yanlış, eşleştirme, boşluk doldurma, sıralama)
Homework

Assessment & Grading

Semester Requirements Number of Activities Level of Contribution
Homework Assignments 1 % 20
Midterms 1 % 30
Final 1 % 40
Kanaat Notu 1 % 10
total % 100
PERCENTAGE OF SEMESTER WORK % 60
PERCENTAGE OF FINAL WORK % 40
total % 100

İş Yükü ve AKTS Kredisi Hesaplaması

Activities Number of Activities Aktiviteye Hazırlık Aktivitede Harçanan Süre Aktivite Gereksinimi İçin Süre Workload
Course Hours 17 2 34
Study Hours Out of Class 7 6 42
Midterms 1 48 48
Final 1 48 48
Total Workload 172