MATHEMATICS | |||||
Bachelor | TR-NQF-HE: Level 6 | QF-EHEA: First Cycle | EQF-LLL: Level 6 |
Course Code | Course Name | Semester | Theoretical | Practical | Credit | ECTS |
MAT2033 | Discrete Mathematics | Fall | 3 | 0 | 3 | 6 |
The course opens with the approval of the Department at the beginning of each semester |
Language of instruction: | En |
Type of course: | Must Course |
Course Level: | Bachelor |
Mode of Delivery: | Face to face |
Course Coordinator : | Instructor MAHMOUD JAFARI SHAH BELAGHI |
Course Lecturer(s): |
Prof. Dr. MURAT SARI Prof. Dr. NAFİZ ARICA |
Course Objectives: | To provide the necessary background in discrete mathematical structures for students who would work which involves machine calculation. To teach basic algorithms on discrete structures. |
The students who have succeeded in this course; 1. Understand the basic principles of Logic. 2. Understand the basic principles of sets and operations in sets. 3. Understand methods of mathematical proofs, and be able to apply them in problem solving. 4. Demonstrate relations and determine their properties. 5. Demonstrate functions and determine when a function is 1-1 and "onto". 6. Understand some basic properties of number theory and mathematical cryptography. 7. Understand and use some basic properties of graphs. |
Mathematical logic, induction, set theory, relations, functions, graphs, number theory, and mathematical cryptography |
Week | Subject | Related Preparation | |
1) | Propositional Logic | ||
2) | Propositional Equivalences | ||
3) | Predicates and Quantifiers | ||
4) | Rules of Inference | ||
5) | Proof Methods | ||
6) | Sets and Set Operations \ review. | ||
7) | Relations and Their Properties | ||
8) | Representing Relations and Closures of Relations | ||
9) | Equivalence Relations and Partial Orderings | ||
10) | Functions | ||
11) | Divisibility and Modular Arithmetic | ||
12) | Primes, Greatest Common Divisors, and Cryptography \ review. | ||
13) | Graphs and Graph Models | ||
14) | Graph Terminology and Special Types of Graphs |
Course Notes: | - Instructor's own lecture notes. - Discrete Mathematics and its Applications, Kenneth H. Rosen, McGraw-Hill Publishing Company. |
References: | - Elements of Discrete Mathematics, C. L. Liu, McGraw-Hill Publishing Company. - Discrete and Combinatorial Mathematics, R. P. Grimaldi, Addison-Wesley Publishing Company. - AND any textbook that covers given topics can be used. |
Semester Requirements | Number of Activities | Level of Contribution |
Attendance | 0 | % 0 |
Laboratory | 0 | % 0 |
Application | 0 | % 0 |
Field Work | 0 | % 0 |
Special Course Internship (Work Placement) | 0 | % 0 |
Quizzes | 0 | % 0 |
Homework Assignments | 0 | % 0 |
Presentation | 0 | % 0 |
Project | 0 | % 0 |
Seminar | 0 | % 0 |
Midterms | 2 | % 60 |
Preliminary Jury | % 0 | |
Final | 1 | % 40 |
Paper Submission | % 0 | |
Jury | % 0 | |
Bütünleme | % 0 | |
Total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 60 | |
PERCENTAGE OF FINAL WORK | % 40 | |
Total | % 100 |
Activities | Number of Activities | Duration (Hours) | Workload |
Course Hours | 14 | 3 | 42 |
Laboratory | 0 | 0 | 0 |
Application | 0 | 0 | 0 |
Special Course Internship (Work Placement) | 0 | 0 | 0 |
Field Work | 0 | 0 | 0 |
Study Hours Out of Class | 14 | 7 | 98 |
Presentations / Seminar | 0 | 0 | 0 |
Project | 0 | 0 | 0 |
Homework Assignments | 0 | 0 | 0 |
Quizzes | 0 | 0 | 0 |
Preliminary Jury | 0 | 0 | 0 |
Midterms | 2 | 2 | 4 |
Paper Submission | 0 | 0 | 0 |
Jury | 0 | 0 | 0 |
Final | 1 | 2 | 2 |
Total Workload | 146 |
No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
Program Outcomes | Level of Contribution |