TÜRKÇE
ENGLISH
Information
| Unit | FACULTY OF ENGINEERING |
| COMPUTER ENGINEERING PR. (ENGLISH) | |
| Code | CEN130 |
| Name | Discrete Mathematics |
| Term | 2018-2019 Academic Year |
| Semester | 2. Semester |
| Duration (T+A) | 3-0 (T-A) (17 Week) |
| ECTS | 5 ECTS |
| National Credit | 3 National Credit |
| Teaching Language | İngilizce |
| Level | Lisans Dersi |
| Type | Normal |
| Label | C Compulsory |
| Mode of study | Yüz Yüze Öğretim |
| Catalog Information Coordinator | Prof. Dr. UMUT ORHAN |
| Course Instructor |
Prof. Dr. UMUT ORHAN
(Bahar)
(A Group)
(Ins. in Charge)
|
Course Goal / Objective
In this course, the mathematical foundations related to computer sciences like formal logic, set theory, mathematical induction, methods of counting, discrete probability, elementary graph theory are discussed.
Course Content
Logic, Sets, Function, Algorithm Complexity, Modular Arithmetic, Sequences and Strings, Recurrence Relations, Combinatorics, Probability and Bayes Theorem, Graph Theory, Trees, Finite-State Machine and Automata, Context Free Language and Grammar
Course Precondition
Resources
Notes
Course Learning Outcomes
| Order | Course Learning Outcomes |
|---|---|
| LO01 | Knows Logic |
| LO02 | Knows Set theory |
| LO03 | Knows function and relation |
| LO04 | Knows Algorithm complexity and modular arithmetic |
| LO05 | Knows sequences and strings, comments recurrent relations |
| LO06 | Do combinatoric analysis, Knows probabiliy and Bayes theorem |
| LO07 | Knows graphs, applies it to problems |
| LO08 | Applies trees to problems |
| LO09 | Knows Finite State Machines and Context Free Grammar |
Relation with Program Learning Outcome
| Order | Type | Program Learning Outcomes | Level |
|---|---|---|---|
| PLO01 | - | Has capability in the fields of mathematics, science and computer that form the foundations of engineering | 5 |
| PLO02 | - | Identifies, formulates, and solves engineering problems, selects and applies appropriate analytical methods and modeling techniques, | 5 |
| PLO03 | - | Analyzes a system, its component, or process and designs under realistic constraints to meet the desired requirements,gains the ability to apply the methods of modern design accordingly. | 4 |
| PLO04 | - | Ability to use modern techniques and tools necessary for engineering practice and information technologies effectively. | 4 |
| PLO05 | - | Ability to design and to conduct experiments, to collect data, to analyze and to interpret results | 2 |
| PLO06 | - | Has ability to work effectively as an individual and in multi-disciplinary teams, take sresponsibility and builds self-confidence | 1 |
| PLO07 | - | Can access information,gains the ability to do resource research and uses information resources | 1 |
| PLO08 | - | Awareness of the requirement of lifelong learning, to follow developments in science and technology and continuous self-renewal ability | 1 |
| PLO09 | - | Ability to communicate effectively orally and in writing, and to read and understand technical publications in at least one foreign language | 3 |
| PLO10 | - | Professional and ethical responsibility, | 1 |
| PLO11 | - | Awareness about project management, workplace practices, employee health, environmental and occupational safety, and the legal implications of engineering applications, | 0 |
| PLO12 | - | Becomes aware of universal and social effects of engineering solutions and applications, entrepreneurship and innovation, and knowledge of contemporary issues | 0 |
Week Plan
| Week | Topic | Preparation | Methods |
|---|---|---|---|
| 1 | Logic and Proofs, Propositions | Reading related chapter in lecture notes | |
| 2 | Sets, Function-Relation | Reading related chapter in lecture notes | |
| 3 | Algorithm Complexity, Modular Arithmetic, RSA | Reading related chapter in lecture notes | |
| 4 | Sequences, Strings, Induction, Recurrence Relations | Reading related chapter in lecture notes | |
| 5 | Combinatorics, The Pigeonhole Principle, Probability and Bayes Theorem | Reading related chapter in lecture notes | |
| 6 | Introduction to Graph Theory, Representations of Graphs | Reading related chapter in lecture notes | |
| 7 | Paths and Circuits in Graphs | Reading related chapter in lecture notes | |
| 8 | Midterm exam | Study to lecture notes and apllications | |
| 9 | Graph Algorithms | Reading related chapter in lecture notes | |
| 10 | Trees, Binary Trees | Reading related chapter in lecture notes | |
| 11 | Decision Trees, Game Trees | Reading related chapter in lecture notes | |
| 12 | Spanning Tree Algorithms | Reading related chapter in lecture notes | |
| 13 | Finite-State Machine and Automata | Reading related chapter in lecture notes | |
| 14 | Context Free Language an Grammar | Reading related chapter in lecture notes | |
| 15 | Review for Final exam | Reading related chapter in lecture notes | |
| 16 | Final Exam | Study to lecture notes and apllications | |
| 17 | Final Exam | Study to lecture notes and apllications |
Assessment (Exam) Methods and Criteria
| Assessment Type | Midterm / Year Impact | End of Term / End of Year Impact |
|---|---|---|
| 1. Midterm Exam | 100 | 40 |
| General Assessment | ||
| Midterm / Year Total | 100 | 40 |
| 1. Final Exam | - | 60 |
| Grand Total | - | 100 |
Student Workload - ECTS
| Works | Number | Time (Hour) | Workload (Hour) |
|---|---|---|---|
| Course Related Works | |||
| Class Time (Exam weeks are excluded) | 14 | 3 | 42 |
| Out of Class Study (Preliminary Work, Practice) | 14 | 3 | 42 |
| Assesment Related Works | |||
| Homeworks, Projects, Others | 0 | 0 | 0 |
| Mid-term Exams (Written, Oral, etc.) | 1 | 12 | 12 |
| Final Exam | 1 | 18 | 18 |
| Total Workload (Hour) | 114 | ||
| Total Workload / 25 (h) | 4,56 | ||
| ECTS | 5 ECTS | ||