| Course Title | Code | Semester | L+U Hour | Credits | ECTS |
|---|---|---|---|---|---|
| Data Structures | CE214 | 4. Semester | 3 + 0 | 3.0 | 5.0 |
| Prerequisites | None |
| Language of Instruction | English |
| 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 Prof. Dr. IMAD FAKHRI TAHA ALYASEEN |
| Instructors |
Şeyhmus YILMAZ |
| 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 |
- Gain knowledge of different programming languages and paradigms and understand the history and evolution of these languages. - Gaining knowledge on type systems and type safety and understanding the differences between static and dynamic type systems. - Gain the ability to learn and apply advanced programming techniques such as object-oriented programming, functional programming and logic programming. - Developing the ability to improve the quality and security of software through program analysis and validation methods. - Ability to acquire basic knowledge of quantum programming languages and quantum computers and to follow future developments. |
| 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 |
| Files | Linked List |
| Files | Queue |
| Files | Stack |
| Files | Insertion Sort |
| Files | Quick Sort |
| Files | Selection Sort |
| Program Requirements | Contribution Level | DK1 | DK2 | DK3 | DK4 | DK5 | Measurement Method |
|---|---|---|---|---|---|---|---|
| PY1 | 1 | 20 | 20 | 20 | 20 | 20 | 60 |
| 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) |
|---|---|---|---|
| Midterm 1 | 5 | 16 | 80 |
| Quiz 1 | 5 | 10 | 50 |
| Total Workload | 130 | ||
| ECTS Credit of the Course | 5.0 | ||
