COURSE UNIT TITLE

: DISCRETE MATHEMATICS AND ITS APPLICATIONS

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
ERA 0009 DISCRETE MATHEMATICS AND ITS APPLICATIONS ELECTIVE 3 0 0 5

Offered By

Faculty Of Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR CELAL CEM SARIOĞLU

Offered to

Biology
Computer Science
Mathematics
Physics
Chemistry
Statistics

Course Objective

This course aims to develop mathematical reasoning and problem solving skills through counting discrete structures and it also gives an opportunity to think algorithmically and to solve applied mathematics problems.

Learning Outcomes of the Course Unit

1   be able to use basic counting techniques
2   be able to apply the principle of inclusion and exclusion
3   be able to solve recursive structures
4   be able to understand Euclid s algorithm and Fermat s Little Theorem
5   be able to use basic codes (RSA)

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 How to solve it
2 Permutations, combinations, Pascal identity, Binomial Theorem
3 Vandermonde s identity, Permutations and with repetition, Multinomial Theorem, Combination with repetition, Pigeonhole principle
4 Principle of inclusion and exclusion Applications
5 Solving linear recurrences
6 Solving nonhomogeneous linear recurrences
7 Fibonacci and Stirling number
8 Catalan numbers
9 Phythegorean triples geometric point of view
10 Divisibility, Euclid's algorithm
11 Prime numbers, Mersenne primes, perfect numbers
12 Congruences, Powers, and Fermat s Little Theorem
13 Euler's Phi Function and the Chinese Remainder Theorem
14 Unbreakable Codes (RSA)

Recomended or Required Reading

1. Discrete mathematics and its applications, K. Rosen 6th ed. ISBN 9780073229720.
2. Discrete and Combinatorial Mathematics, R. Grimaldi 5th ed. ISBN 9780201726343.
3. Joseph Silverman, A Friendly Introduction to Number Theory, Fourth Edition - ISBN: 978-0-321-81619-1 2012 Pearson Education

Planned Learning Activities and Teaching Methods

Face to face and presentation, problem solving, quiz, discussion

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 QUZ QUIZ
3 FIN FINAL EXAM
4 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + ASG * 0.30 + FIN * 0.40
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + ASG * 0.30 + RST * 0.40


Further Notes About Assessment Methods

None

Assessment Criteria

30% (Midterm examination) +30%(Quiz)+40% (Final examination)

Language of Instruction

English

Course Policies and Rules

It is the student's responsibility to attend 70% of the courses during the semester. Unethical behaviors that may occur in classes and exams will be acted upon within the framework of the relevant regulation. You can get the DEU Faculty of Science teaching and examination application rules at https://fen.deu.edu.tr

Contact Details for the Lecturer(s)

Asst. Prof. Dr. Celal Cem SARIOĞLU
E-mail: celalcem.sarioglu@deu.edu.tr
Phone: +90 232 301 8585
Office: B212 (Mathematics Department)

Office Hours

To be announced later.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 3 42
Preparations before/after weekly lectures 13 2 26
Preparation for midterm exam 1 15 15
Preparation for final exam 1 15 15
Preparation for quiz etc. 4 5 20
Midterm 1 2 2
Quiz etc. 4 1 4
Final 1 2 2
TOTAL WORKLOAD (hours) 126

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.143
LO.243
LO.343
LO.443
LO.543