| Course Title | Code | Semester | L+U Hour | Credits | ECTS |
|---|---|---|---|---|---|
| Data Structures | BM214 | 4. Semester | 3 + 0 | 3.0 | 5.0 |
| Prerequisites | None |
| Language of Instruction | Turkish |
| Course Level | Undergraduate |
| Course Type | |
| Mode of delivery | Verbally speaking, compiling and writing the codes and showing the results. |
| Course Coordinator |
Assist. Prof. Dr. Hüseyin BODUR |
| Instructor(s) |
Hüseyin BODUR |
| Assistants | |
| Goals | Learning Algorithms. Learn the structure of graf. Learn Algorithm Analysis. |
| Course Content | In the content of the course, both theoretical and applied explanations of the algorithms required in the students' life processes are made. They learn many basic and current algorithms throughout the course. |
| Learning Outcomes |
- Have a knowledge about data, basic data types, iterative and recursive solutions. - Have a knowledge of measuring performance of Algorithms. - Can solve problems by using List and Linked List Data Structures. - Can write effective programs by using Stack and Queue Data Structures. - Can make use of tree structures for searching, sorting and special purposes. - Have a knowledge about different application areas of Binary Trees. - Have a knowledge of Balanced and Unbalanced Trees. - Can compare infix, prefix and postfix solutions. |
| Week | Topics | Learning Methods |
|---|---|---|
| 1. Week | Structures, Recursive Functions, Class Structure | |
| 2. Week | Singly Linked List | |
| 3. Week | Doubly Linked List | |
| 4. Week | Stack and Queue Structure | |
| 5. Week | Sorting Algorithms | |
| 6. Week | Sorting Algorithms | |
| 7. Week | Search Algorithms | |
| 8. Week | Complexity Calculation | |
| 9. Week | Graphs | |
| 10. Week | Graph Coloring | |
| 11. Week | Minimum Spanning Trees | |
| 12. Week | Dijkstra and Kruskal Algorithm | |
| 13. Week | Binary Search Tree | |
| 14. Week | Infix, Postfix and Prefix Transformations |
| Data Structures and Algorithms in C++,Michael T. Goodrich , Roberto Tamassia , David M. Mount, ISBN-13: 978-0471202080 ISBN-10: 0471202088 |
| Program Requirements | Contribution Level | DK1 | DK2 | DK3 | DK4 | DK5 | DK6 | DK7 | DK8 | Measurement Method |
|---|---|---|---|---|---|---|---|---|---|---|
| PY1 | 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY2 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY3 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY4 | 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY5 | 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY6 | 5 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY7 | 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY8 | 3 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY9 | 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| PY10 | 4 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | - |
| 0 | 1 | 2 | 3 | 4 | 5 | |
|---|---|---|---|---|---|---|
| Course's Level of contribution | None | Very Low | Low | Fair | High | Very High |
| Method of assessment/evaluation | Written exam | Oral Exams | Assignment/Project | Laboratory work | Presentation/Seminar |
| Event | Quantity | Duration (Hour) | Total Workload (Hour) |
|---|---|---|---|
| Course Hours | 14 | 3 | 42 |
| Midterm 1 | 1 | 2 | 2 |
| Homework 1 | 1 | 15 | 15 |
| Homework 2 | 1 | 15 | 15 |
| Final | 1 | 2 | 2 |
| Practice | 1 | 1 | 1 |
| Classroom Activities | 1 | 25 | 25 |
| Total Workload | 102 | ||
| ECTS Credit of the Course | 5.0 | ||
