Nevşehir Hacı Bektaş Veli University Course Catalogue
|
|||||
| Year/Semester of Study | 3 / Spring Semester | ||||
| Level of Course | 1st 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 | |||||
| To teach the basic concepts of discrete mathematics. | |||||
| Learning Outcomes | PO | MME | |
| The students who succeeded in this course: | |||
| LO-1 | Can learn basic concepts of discrete probability. |
PO-1 Have the ability to conceptualize the events and facts related to the field of mathematics such as Analysis, Geometry and Algebra with the help of the scientific methods and techniques and can define these concepts. |
Examination |
| LO-2 | Can know property of combinatorial designs. |
PO-2 Have the knowledge to critize, analyze, and evaluate the correctness, reliability, and validity of mathematical data. |
Examination |
| LO-3 | Perceive the discrete optimization. |
PO-2 Have the knowledge to critize, analyze, and evaluate the correctness, reliability, and validity of mathematical data. |
Examination |
| PO: Programme Outcomes MME:Method of measurement & Evaluation |
|||
| Course Contents | ||
| Discrete probability, discrete probability computations, discrete-time Markov chains, queueing theory, combinatorial designs, block designs, symmetric designs, Latin squares and orthogonal arrays, discrete optimization, location theory, game theory, Sperner’s lemma, fixed point theorems | ||
| Weekly Course Content | ||
| Week | Subject | Learning Activities and Teaching Methods |
| 1 | Discrete probability | Teaching |
| 2 | Discrete probability | Teaching |
| 3 | Discrete probability computations | Teaching |
| 4 | Discrete-time Markov chains | Teaching |
| 5 | Queueing theory | Teaching |
| 6 | Combinatorial designs | Teaching |
| 7 | Block designs | Teaching |
| 8 | mid-term exam | |
| 9 | Symmetric designs | Teaching |
| 10 | Latin squares and orthogonal arrays | Teaching |
| 11 | Discrete optimization | Teaching |
| 12 | Location theory | Teaching |
| 13 | Game theory | Teaching |
| 14 | Sperner’s lemma | Teaching |
| 15 | Fixed point theorems | Teaching |
| 16 | final exam | |
| Recommend Course Book / Supplementary Book/Reading | ||
| 1 | Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th Edition McGraw-Hill Companies, Inc., 2012. | |
| 2 | Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, 5th Edition, Pearson Addison Wesley, 2004. | |
| Required Course instruments and materials | ||
| Books and lecture notes | ||
| Assessment Methods | |||
| Type of Assessment | Week | Hours | Weight(%) |
| mid-term exam | 7 | 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) | 4 | 14 | 56 |
| Outside Class | |||
| a) Reading | 2 | 14 | 28 |
| b) Search in internet/Library | 3 | 14 | 42 |
| 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 | 4 | 7 | 28 |
| mid-term exam | 2 | 1 | 2 |
| Own study for final exam | 4 | 7 | 28 |
| final exam | 2 | 1 | 2 |
| 0 | |||
| 0 | |||
| Total work load; | 186 | ||