| Course Title | Code | Language | Type | Semester | L+U Hour | Credits | ECTS |
|---|---|---|---|---|---|---|---|
| Data Structures | CE214 | English | Compulsory | 4. Semester | 3 + 0 | 3.0 | 5.0 |
| Prerequisite Courses | |
| Course Level | Undergraduate |
| Mode of delivery | Verbally speaking, compiling and writing the codes and showing the results. |
| Course Coordinator | Dr. Öğr. Üyesi Hüseyin BODUR, Prof. Dr. IMAD FAKHRI TAHA ALYASEEN |
| Instructor(s) | |
| 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. |
| # | Öğrenme Kazanımı |
| 1 | Gain knowledge of different programming languages and paradigms and understand the history and evolution of these languages. |
| 2 | Gaining knowledge on type systems and type safety and understanding the differences between static and dynamic type systems. |
| 3 | Gain the ability to learn and apply advanced programming techniques such as object-oriented programming, functional programming and logic programming. |
| 4 | Developing the ability to improve the quality and security of software through program analysis and validation methods. |
| 5 | Ability to acquire basic knowledge of quantum programming languages and quantum computers and to follow future developments. |
| Week | Topics/Applications | Method |
|---|---|---|
| 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 |
| No | Program Requirements | Level of Contribution | |||||
|---|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | |||
| 1 | Adequate knowledge of mathematics, science and related engineering disciplines; Ability to use theoretical and applied knowledge in these fields in complex engineering problems | ✔ | |||||
| Program Requirements | DK1 | DK2 | DK3 | DK4 | DK5 |
|---|---|---|---|---|---|
| PY1 | 20 | 20 | 20 | 20 | 20 |
| Ders Kitabı veya Notu |
|
|---|---|
| Diğer Kaynaklar |
|
| ECTS credits and course workload | Quantity | Duration (Hour) | Total Workload (Hour) | |
|---|---|---|---|---|
|
Sınavlar |
Midterm 1 | 5 | 16 | 80 |
| Quiz 1 | 5 | 10 | 50 | |
| Total Workload | 130 | |||
| *AKTS = (Total Workload) / 25,5 | ECTS Credit of the Course | 5.0 | ||
