Information Package / Course Catalogue
| Course Code | : MAT230 |
| Course Type | : Area Elective |
| Couse Group | : First Cycle (Bachelor's Degree) |
| Education Language | : Turkish |
| Work Placement | : N/A |
| Theory | : 2 |
| Prt. | : 0 |
| Credit | : 2 |
| Lab | : 0 |
| ECTS | : 2 |
1-Teaching Boolean algebra and graph structures 2-Teaching Euler and Hamiltonian paths and circuits 3-Teaching Prim’s and Dijkstra’s algorithms 4-Teaching tree structures and sorting algorithms
Boolean algebra, simplification of Boolean expressions, digital circuits, disjunctive normal form, Karnaugh maps, graph theory, isomorphisms of graphs, paths and circuits, Euler path and circuit, Hamiltonian path and circuit, trees, minimum spanning tree, Prim’s algorithm, minimum distance paths, Dijkstra’s algorithm, movement within a tree, binary search tree, B-tree, sorting algorithms.
| 1. | Being able to learn concepts related to Boolean translation and digital circuits |
| 2. | Being able to learn information about graph theory |
| 3. | Being able to learn about Euler, Hamiltonian path and circuit |
| 4. | Being able to understand the concept of tree structure |
| 5. | Being able to use Prim and Dijkstra algorithms |
| 6. | Being able to efficiently use binary search tree |
| 7. | Being able to learn sorting algorithms |
| 1. | Lovász, L., Pelikán, J. &Vesztergombi, K. Discrete Mathematics Elementary and Beyond, Springer, 2003. |
| 2. | Grimaldi, P. R. Discrete and Combinatorial Mathematics 5th Edition. Pearson Addison Wesley, 2004. |
| 3. | Rosen, K.H. Discrete Mathematics and Its Applications 5th Edition. McGraw-Hill, 2003. |
| 4. | Ayrık matematik ve uygulamaları, Kenneth H. Rosen, Palme Yayıncılık. |
| 5. | Grimaldi, P. R. Discrete and Combinatorial Mathematics 5th Edition. Pearson Addison Wesley, 2004. |
| 6. | Lecture notes will be given to the students. |
| Type of Assessment | Count | Percent |
|---|---|---|
| Attending Lectures | 1 | %5 |
| Assignment | 1 | %5 |
| Midterm Examination | 1 | %30 |
| Final Examination | 1 | %60 |
| Activities | Count | Preparation | Time | Total Work Load (hours) |
|---|---|---|---|---|
| Lecture - Theory | 14 | 0 | 2 | 28 |
| Assignment | 1 | 0 | 1 | 1 |
| Individual Work | 14 | 0 | 1 | 14 |
| Midterm Examination | 1 | 2 | 1 | 3 |
| Final Examination | 1 | 3 | 1 | 4 |
| TOTAL WORKLOAD (hours) | 50 | |||
PÇ-1 | PÇ-2 | PÇ-3 | PÇ-4 | PÇ-5 | PÇ-6 | PÇ-7 | PÇ-8 | PÇ-9 | PÇ-10 | PÇ-11 | PÇ-12 | PÇ-13 | PÇ-14 | PÇ-15 | PÇ-16 | PÇ-17 | PÇ-18 | |
OÇ-1 | 5 | 4 | 5 | 4 | 4 | 3 | 3 | 5 | 3 | 5 | ||||||||
OÇ-2 | 5 | 5 | 5 | 4 | 5 | 5 | 3 | 5 | 4 | 5 | ||||||||
OÇ-3 | 4 | 5 | 5 | 4 | 5 | 5 | 3 | 5 | 5 | 5 | ||||||||
OÇ-4 | 4 | 4 | 5 | 4 | 5 | 5 | 3 | 5 | 5 | 5 | ||||||||
OÇ-5 | 4 | 4 | 5 | 4 | 5 | 5 | 3 | 5 | 5 | 5 | ||||||||
OÇ-6 | 4 | 4 | 5 | 4 | 5 | 5 | 3 | 5 | 5 | 5 | ||||||||
OÇ-7 | 4 | 4 | 5 | 4 | 4 | 4 | 3 | 5 | 5 | 5 | ||||||||