Nevşehir Hacı Bektaş Veli University Course Catalogue

Information Of Programmes

INSTITUTE OF SCIENCE / MAT521 - MATHEMATICS

Code: MAT521 Course Title: COMBINATORICS I Theoretical+Practice: 3+0 ECTS: 6
Year/Semester of Study 1 / Fall Semester
Level of Course 2nd Cycle Degree Programme
Type of Course Optional
Department MATHEMATICS
Pre-requisities and Co-requisites None
Mode of Delivery Face to Face
Teaching Period 14 Weeks
Name of Lecturer SEZER SORGUN (ssorgun@nevsehir.edu.tr)
Name of Lecturer(s)
Language of Instruction Turkish
Work Placement(s) None
Objectives of the Course
The purpose of this course is to gain information and skills related with recurrence and inverse relations.

Learning Outcomes PO MME
The students who succeeded in this course:
LO-1 can explain the basic concepts of recurrence and inverse relations. PO-1 Fundamental theorems of about some sub-theories of Analysis, Applied Mathematics, Geometry, and Algebra can apply to new problems.
PO-2 Ability to assimilate mathematic related concepts and associate these concepts with each other.
PO-3 Mathematics, natural sciences and their branches in these areas and related issues has sufficient infrastructure solutions for the problems of theoretical and practical uses of mathematics.
PO-5 Ability to gain qualifications based on basic mathematical skills, problem solving, reasoning, association and generalization.
Examination
PO: Programme Outcomes
MME:Method of measurement & Evaluation

Course Contents
Recurrence, Inverse Relations
Weekly Course Content
Week Subject Learning Activities and Teaching Methods
1 Basic definitions about recurrence Oral Representation, Questioning- Answering, Problem Solving
2 Basic relations for binomial coefficients Oral Representation, Questioning- Answering, Problem Solving
3 Iterations of the basic recurrence Oral Representation, Questioning- Answering, Problem Solving
4 Some expansion formulas Oral Representation, Questioning- Answering, Problem Solving
5 Multinomial Abel identities Oral Representation, Questioning- Answering, Problem Solving
6 The simplest inverse relations Oral Representation, Questioning- Answering, Problem Solving
7 A class of inverse relations Oral Representation, Questioning- Answering, Problem Solving
8 mid-term exam
9 Chebyshev types Oral Representation, Questioning- Answering, Problem Solving
10 Legendre types Oral Representation, Questioning- Answering, Problem Solving
11 Abel inverse relations Oral Representation, Questioning- Answering, Problem Solving
12 Generating functions Oral Representation, Questioning- Answering, Problem Solving
13 Generating functions Oral Representation, Questioning- Answering, Problem Solving
14 Exponential generating functions Oral Representation, Questioning- Answering, Problem Solving
15 Multinomial inverses Oral Representation, Questioning- Answering, Problem Solving
16 final exam
Recommend Course Book / Supplementary Book/Reading
1 Riordan, John. Combinatorial identities. Vol. 6. New York: Wiley, 1968.
Required Course instruments and materials
Course book and laptop

Assessment Methods
Type of Assessment Week Hours Weight(%)
mid-term exam 8 2 40
Other assessment methods
1.Oral Examination
2.Quiz
3.Laboratory exam
4.Presentation
5.Report
6.Workshop
7.Performance Project
8.Term Paper
9.Project
final exam 16 2 60

Student Work Load
Type of Work Weekly Hours Number of Weeks Work Load
Weekly Course Hours (Theoretical+Practice) 3 14 42
Outside Class
       a) Reading 3 13 39
       b) Search in internet/Library 2 13 26
       c) Performance Project 0
       d) Prepare a workshop/Presentation/Report 0
       e) Term paper/Project 0
Oral Examination 0
Quiz 0
Laboratory exam 0
Own study for mid-term exam 3 8 24
mid-term exam 2 1 2
Own study for final exam 3 15 45
final exam 2 1 2
0
0
Total work load; 180