Nevşehir Hacı Bektaş Veli University Course Catalogue
|
|||||
| Year/Semester of Study | 2 / Spring Semester | ||||
| Level of Course | 1st Cycle Degree Programme | ||||
| Type of Course | Compulsory | ||||
| Department | DEPARTMENT OF COMPUTER ENGINEERING | ||||
| Pre-requisities and Co-requisites | None | ||||
| Mode of Delivery | Face to Face | ||||
| Teaching Period | 14 Weeks | ||||
| Name of Lecturer | EBUBEKİR KAYA (ebubekir@nevsehir.edu.tr) | ||||
| Name of Lecturer(s) | EBUBEKİR KAYA, | ||||
| Language of Instruction | Turkish | ||||
| Work Placement(s) | None | ||||
| Objectives of the Course | |||||
| To learn a particular set of mathematical facts and how to apply them and how to think mathematically. | |||||
| Learning Outcomes | PO | MME | |
| The students who succeeded in this course: | |||
| LO-1 | Öğrenci, matematiksel model oluşturmanın temellerini öğrenecektir. |
PO-4 Students gain the ability to apply knowledge of mathematics, science and engineering. PO-5 Students gain the ability to define, model, formulate and solve general engineering problems. PO-7 Students gain the ability to identify, define, formulate and solve problems specific to Computer Engineering. PO-15 Students will be able to design a system or process to meet the desired needs. |
Examination |
| LO-2 | Öğrenci, matematiksel kavramları ve terminoloji öğrenecektir. |
PO-4 Students gain the ability to apply knowledge of mathematics, science and engineering. PO-5 Students gain the ability to define, model, formulate and solve general engineering problems. |
Examination |
| LO-3 | The student will know how to analyze recursive definitions, and how to use it. |
PO-4 Students gain the ability to apply knowledge of mathematics, science and engineering. PO-5 Students gain the ability to define, model, formulate and solve general engineering problems. PO-7 Students gain the ability to identify, define, formulate and solve problems specific to Computer Engineering. |
Examination |
| LO-4 | The student will understand how to use different types of discrete structures. |
PO-4 Students gain the ability to apply knowledge of mathematics, science and engineering. PO-5 Students gain the ability to define, model, formulate and solve general engineering problems. PO-15 Students will be able to design a system or process to meet the desired needs. |
Examination |
| LO-5 | The student will know how to perform mathematical proofs. |
PO-4 Students gain the ability to apply knowledge of mathematics, science and engineering. PO-5 Students gain the ability to define, model, formulate and solve general engineering problems. PO-15 Students will be able to design a system or process to meet the desired needs. |
Examination |
| PO: Programme Outcomes MME:Method of measurement & Evaluation |
|||
| Course Contents | ||
| Logic; Sets and Functions; Fundamentals of Algorithms; Integers and matrices; Counting Techniques; Chromatics Polinomials; Graphs; Trees; Boolean Algebra; Finite-State Machine with/without Output | ||
| Weekly Course Content | ||
| Week | Subject | Learning Activities and Teaching Methods |
| 1 | Basic concepts, logic, sets | Explaining, Question-answer, Problem Solving, Practice |
| 2 | Boolean algebra, Boole functions, logic gates | Explaining, Question-answer, Problem Solving, Practice |
| 3 | Functions, algorithms | Explaining, Question-answer, Problem Solving, Practice |
| 4 | Relations, properties, representation of relations | Explaining, Question-answer, Problem Solving, Practice |
| 5 | Integers, matrices | Explaining, Question-answer, Problem Solving, Practice |
| 6 | Proof methods, induction, recursive algorithms | Explaining, Question-answer, Problem Solving, Practice |
| 7 | Counting principals, permutation, combination | Explaining, Question-answer, Problem Solving, Practice |
| 8 | mid-term exam | |
| 9 | Counting principals, recursive functions | Explaining, Question-answer, Problem Solving, Practice |
| 10 | Recursive functions, solving methods | Explaining, Question-answer, Problem Solving, Practice |
| 11 | Graph theory, general graph concepts, isomorphism | Explaining, Question-answer, Problem Solving, Practice |
| 12 | Problems | Explaining, Question-answer, Problem Solving, Practice |
| 13 | Trees, general concepts, sorting trees | Explaining, Question-answer, Problem Solving, Practice |
| 14 | Modelling, finite state machines, turing machine | Explaining, Question-answer, Problem Solving, Practice |
| 15 | turing machine | Explaining, Question-answer, Problem Solving, Practice |
| 16 | final exam | |
| Recommend Course Book / Supplementary Book/Reading | ||
| 1 | Discrete Mathematics and Its Applications, Kenneth H. Rosen, McGraw-Hill | |
| 2 | Discrete Mathematics, R. Johnsonbaugh, Prentice Hall | |
| 3 | Discrete Mathematics, Kenneth A. Ross, Prentice Hall | |
| Required Course instruments and materials | ||
| Discrete Mathematics and Its Applications, Kenneth H. Rosen, McGraw-Hill Discrete Mathematics, R. Johnsonbaugh, Prentice Hall Discrete Mathematics, Kenneth A. Ross, Prentice Hall | ||
| Assessment Methods | |||
| Type of Assessment | Week | Hours | Weight(%) |
| mid-term exam | 8 | 1 | 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 | 1 | 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 | 13 | 4 | 52 |
| b) Search in internet/Library | 0 | ||
| 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 | 1 | 12 | 12 |
| mid-term exam | 1 | 1 | 1 |
| Own study for final exam | 1 | 12 | 12 |
| final exam | 1 | 1 | 1 |
| 0 | |||
| 0 | |||
| Total work load; | 120 | ||