|
| Course Description |
|
| Course Name |
: |
Finite Mathematics |
|
| Course Code |
: |
MT 352 |
|
| Course Type |
: |
Compulsory |
|
| Level of Course |
: |
First Cycle |
|
| Year of Study |
: |
3 |
|
| Course Semester |
: |
Spring (16 Weeks) |
|
| ECTS |
: |
4 |
|
| Name of Lecturer(s) |
: |
Asst.Prof.Dr. ŞEHMUS FINDIK
|
|
| Learning Outcomes of the Course |
: |
Defines distribution problems.
Solves the distributing problems using counting principles.
Finds the Binom coefficients.
Defines the Fibonacci numbers.
Knows the division algorithm.
|
|
| Mode of Delivery |
: |
Face-to-Face |
|
| Prerequisites and Co-Prerequisites |
: |
None |
|
| Recommended Optional Programme Components |
: |
None |
|
| Aim(s) of Course |
: |
To solve distribution problems by using the basic principles of counting. |
|
| Course Contents |
: |
Counting principles, Binomial coefficients, Cyclic permutations, Distrubution problems, Fibonachi numbers, Division algorithm, Prime numbers, the least common multiple and the greatest common divisor, surjective functions, Stirling numbers, Special functions, The pigeon hole principle, functional difficulty. |
|
| Language of Instruction |
: |
Turkish |
|
| Work Place |
: |
Classroom |
|
|
Course Outline /Schedule (Weekly) Planned Learning Activities |
| Week | Subject | Student's Preliminary Work | Learning Activities and Teaching Methods |
|
1 |
counting rules |
Review of the relevant pages from sources |
Lecture and discussion |
|
2 |
Binom coefficients |
Review of the relevant pages from sources |
Lecture and discussion |
|
3 |
Cyclic permutation |
Review of the relevant pages from sources |
Lecture and discussion |
|
4 |
Distrubution problems |
Review of the relevant pages from sources |
Lecture and discussion |
|
5 |
Fibonachi numbers |
Review of the relevant pages from sources |
Lecture and discussion |
|
6 |
Division algorithm |
Review of the relevant pages from sources |
Lecture and discussion |
|
7 |
Prime numbers |
Review of the relevant pages from sources |
Lecture and discussion |
|
8 |
Mid Term exam |
Review of the topics discussed in the lecture notes and sources |
Written exam |
|
9 |
The least common multiple and the greatest common divisor |
Review of the relevant pages from sources |
Lecture and discussion |
|
10 |
surjective functions |
Review of the relevant pages from sources |
Lecture and discussion |
|
11 |
Stirling numbers |
Review of the relevant pages from sources |
Lecture and discussion |
|
12 |
Special functions |
Review of the relevant pages from sources |
Lecture and discussion |
|
13 |
The pigeon hole principle |
Review of the relevant pages from sources |
Lecture and discussion |
|
14 |
functional difficulty |
Review of the relevant pages from sources |
Lecture and discussion |
|
15 |
General problem solving |
General rewiev |
Lecture and discussion |
|
16/17 |
Final exam |
Review of the topics discussed in the lecture notes and sources |
Written exam |
|
|
|
Required Course Resources |
| Resource Type | Resource Name |
| Recommended Course Material(s) |
 Discrete and Combinatorial Mathematics an applied introduction, Ralph Grimaldi, Addison-Wesley Publishing Company,1994.
Sonlu Matematik Olimpiyat Problemleri ve Çözümleri
(Tübitak Press)
Authors: Ünal Ufuktepe, Refail Alizade
Sayma, Ali Nesin
http://math.cu.edu.tr/sfindik/MT352/MT352.htm
|
| |
| Required Course Material(s) | |
|
|
|
Assessment Methods and Assessment Criteria |
|
Semester/Year Assessments |
Number |
Contribution Percentage |
|
Mid-term Exams (Written, Oral, etc.) |
1 |
100 |
|
Homeworks/Projects/Others |
0 |
0 |
|
Total |
100 |
|
Rate of Semester/Year Assessments to Success |
40 |
| |
|
Final Assessments
|
100 |
|
Rate of Final Assessments to Success
|
60 |
|
Total |
100 |
|
|
| Contribution of the Course to Key Learning Outcomes |
| # | Key Learning Outcome | Contribution* |
|
1 |
Is able to prove Mathematical facts encountered in secondary school. |
5 |
|
2 |
Recognizes the importance of basic notions in Algebra, Analysis and Topology |
1 |
|
3 |
Develops maturity of mathematical reasoning and writes and develops mathematical proofs. |
5 |
|
4 |
Is able to express basic theories of mathematics properly and correctly both written and verbally |
4 |
|
5 |
Recognizes the relationship between different areas of Mathematics and ties between Mathematics and other disciplines. |
3 |
|
6 |
Expresses clearly the relationship between objects while constructing a model |
5 |
|
7 |
Draws mathematical models such as formulas, graphs and tables and explains them |
3 |
|
8 |
Is able to mathematically reorganize, analyze and model problems encountered. |
5 |
|
9 |
Knows at least one computer programming language |
5 |
|
10 |
Uses effective scientific methods and appropriate technologies to solve problems |
0 |
|
11 |
Knows programming techniques and is able to write a computer program |
0 |
|
12 |
Is able to do mathematics both individually and in a group. |
0 |
|
13 |
Has sufficient knowledge of foreign language to be able to understand Mathematical concepts and communicate with other mathematicians |
0 |
|
14 |
In addition to professional skills, the student improves his/her skills in other areas of his/her choice such as in scientific, cultural, artistic and social fields |
0 |
| * Contribution levels are between 0 (not) and 5 (maximum). |
|
|
| Student Workload - ECTS |
| Works | Number | Time (Hour) | Total Workload (Hour) |
| Course Related Works |
|
Class Time (Exam weeks are excluded) |
14 |
2 |
28 |
|
Out of Class Study (Preliminary Work, Practice) |
14 |
2 |
28 |
| Assesment Related Works |
|
Homeworks, Projects, Others |
0 |
0 |
0 |
|
Mid-term Exams (Written, Oral, etc.) |
1 |
15 |
15 |
|
Final Exam |
1 |
20 |
20 |
|
Total Workload: | 91 |
| Total Workload / 25 (h): | 3.64 |
| ECTS Credit: | 4 |
|
|
|