ECTS - Discrete Mathematics with Applications
Discrete Mathematics with Applications (MATH211) Course Detail
Course Name | Course Code | Season | Lecture Hours | Application Hours | Lab Hours | Credit | ECTS |
---|---|---|---|---|---|---|---|
Discrete Mathematics with Applications | MATH211 | Diğer Bölümlere Verilen Ders | 2 | 2 | 0 | 3 | 4 |
Pre-requisite Course(s) |
---|
MATH157 and CMPE102 |
Course Language | English |
---|---|
Course Type | Service Courses Given to Other Departments |
Course Level | Bachelor’s Degree (First Cycle) |
Mode of Delivery | Face To Face |
Learning and Teaching Strategies | Lecture, Question and Answer, Problem Solving. |
Course Lecturer(s) |
|
Course Objectives | Discrete mathematics is an increasingly important field of mathematics because of its extensive applications in computer science, statistics, operations research, and engineering. The purpose of this course is to teach students to model, analyze, and solve combinatorial and discrete mathematical problems. This course introduces also the importance of algorithms in computing. |
Course Learning Outcomes |
The students who succeeded in this course;
|
Course Content | Analysis and Complexity of Algorithms, Elements of Discrete Probability Theory, Recursive and Iterative Implementations, Sorting and Searching Algorithms, Graphs, Trees and Paths. |
Weekly Subjects and Releated Preparation Studies
Week | Subjects | Preparation |
---|---|---|
1 | Growth of Functions: Asymptotic Notations O, Ω,Θ | pp. 518-528 |
2 | Analysis and Complexity of Algorithms | pp. 531-535 |
3 | The Pigeonhole Principle, Its Generalizations and Applications | pp. 420-431 |
4 | Permutations, Operations on Permutations | pp. 313-329 |
5 | The Fundamental Rule of Counting | pp. 349-355 |
6 | Combinations, Combinatorial Formulae | pp. 356-361 |
7 | Properties of Binomial Coefficients, Stirling’s Formula | pp. 362-370 |
8 | The Principle of Inclusion and Exclusion | pp. 326-330 |
9 | Recurrence Relations. Linear Recurrence Relations With Constant Coefficients | pp. 457-475 |
10 | Recurrence Relations. Linear Recurrence Relations With Constant Coefficients(Continued). | pp. 476-490 |
11 | Searching Algorithms | pp. 536 |
12 | Sorting Algorithms | pp. 536-540 |
13 | Generating Functions | |
14 | Graphs, Trees | pp. 649-665 |
15 | Problem solving and review | |
16 | Final Exam |
Sources
Course Book | 1. S. Epp, Discrete Mathematics with Applications, Brooks/Cole, 3rd Edition 2004 |
---|---|
Other Sources | 2. Kenneth H. Rosen, Discrete Mathematics and Its Applications, McGraw-Hill, 2007 |
3. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics, 5th Edition, Addison-Wesley, 2004 |
Evaluation System
Requirements | Number | Percentage of Grade |
---|---|---|
Attendance/Participation | - | - |
Laboratory | - | - |
Application | - | - |
Field Work | - | - |
Special Course Internship | - | - |
Quizzes/Studio Critics | - | - |
Homework Assignments | - | - |
Presentation | - | - |
Project | - | - |
Report | - | - |
Seminar | - | - |
Midterms Exams/Midterms Jury | 2 | 60 |
Final Exam/Final Jury | 1 | 40 |
Toplam | 3 | 100 |
Percentage of Semester Work | 60 |
---|---|
Percentage of Final Work | 40 |
Total | 100 |
Course Category
Core Courses | |
---|---|
Major Area Courses | |
Supportive Courses | |
Media and Managment Skills Courses | |
Transferable Skill Courses |
The Relation Between Course Learning Competencies and Program Qualifications
# | Program Qualifications / Competencies | Level of Contribution | ||||
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | ||
1 | Has the ability to apply scientific knowledge gained in the undergraduate education and to expand and extend knowledge in the same or in a different area | |||||
2 | Can apply gained knowledge and problem solving abilities in inter-disciplinary research | |||||
3 | Has the ability to work independently within research area, to state the problem, to develop solution techniques, to solve the problem, to evaluate the obtained results and to apply them when necessary | |||||
4 | Takes responsibility individually and as a team member to improve systematic approaches to produce solutions in unexpected complicated situations related to the area of study | |||||
5 | Can develop strategies, implement plans and principles on the area of study and can evaluate obtained results within the framework | |||||
6 | Can develop and extend the knowledge in the area and to use them with scientific, social and ethical responsibility | |||||
7 | Has the ability to follow recent developments within the area of research, to support research with scientific arguments and data, to communicate the information on the area of expertise in a systematically by means of written report and oral/visual presentation | |||||
8 | To have an oral and written communication ability in at least one of the common foreign languages ("European Language Portfolio Global Scale", Level B2) | |||||
9 | Has software and hardware knowledge in the area of expertise, and has proficient information and communication technology knowledge | |||||
10 | Follows scientific, cultural, and ethical criteria in collecting, interpreting and announcing data in the research area and has the ability to teach. | |||||
11 | Has professional ethical consciousness and responsibility which takes into account the universal and social dimensions in the process of data collection, interpretation, implementation and declaration of results in mathematics and its applications. |
ECTS/Workload Table
Activities | Number | Duration (Hours) | Total Workload |
---|---|---|---|
Course Hours (Including Exam Week: 16 x Total Hours) | 16 | 2 | 32 |
Laboratory | |||
Application | 16 | 2 | 32 |
Special Course Internship | |||
Field Work | |||
Study Hours Out of Class | 14 | 1 | 14 |
Presentation/Seminar Prepration | |||
Project | |||
Report | |||
Homework Assignments | |||
Quizzes/Studio Critics | |||
Prepration of Midterm Exams/Midterm Jury | 2 | 6 | 12 |
Prepration of Final Exams/Final Jury | 1 | 10 | 10 |
Total Workload | 100 |