Algorithm design
| 1. | Course title | Algorithm design | ||||||||||||
| 2. | Code | F23L2S097 | ||||||||||||
| 3. | Study programme | — | ||||||||||||
| 4. | Organizer of the study programme (unit, institute, department) | Faculty of Computer Science and Engineering | ||||||||||||
| 5. | Degree level (first, second, third cycle) | First cycle | ||||||||||||
| 6. | Academic year / semester | 4 / Summer | ||||||||||||
| 7. | Number of ECTS credits | 6 | ||||||||||||
| 8. | Teacher | |||||||||||||
| 9. | Prerequisites for enrolling in the course | Дискретна математика или Дискретни структури 2 или Математика 2 или Избрани теми од математика | ||||||||||||
| 10. | Course objectives (competences) | In this course, you will learn more algorithms and methods for solving computer problems, as well as certain data structures for their implementation. The student will gain programming experience, understand the principles of algorithm design, algorithm performance analysis, and learn the fundamental ideas of designing an efficient algorithm and combining it with an appropriate data structure. Ideas will be put into practice through laboratory exercises. | ||||||||||||
| 11. | Course content | What is an algorithm? Algorithm Design Techniques and Complexity Computing Techniques. Multidimensional Dynamic and Greedy Programming. Memoization in DP. Graph search (classification of edges and vertices, visit time and properties related to them). Algorithms for shortest paths from each to each vertex and their application. Algorithms that use surveying techniques. Union find, fibonacci pile and other more advanced structures and pimena. Flow through network and min-cut max-flow. Search trees (segmented, interval indexed). Algorithms for patterns in strings. Geometric algorithms. | ||||||||||||
| 12. | Learning methods | Lectures supported by slide presentations, interactive lectures, exercises (using equipment and software packages), teamwork, case studies, guest lecturers, independent completion of homework assignments, and learning in an electronic environment (forums, consultations). | ||||||||||||
| 13. | Total available time | 6 ECTS x 30 hours = 180 hours | ||||||||||||
| 14. | Distribution of the available time | 30 + 45 + 15 + 15 + 75 = 180 hours | ||||||||||||
| 15. | Forms of teaching activities |
| ||||||||||||
| 16. | Other forms of activities |
| ||||||||||||
| 17. | Grading |
| ||||||||||||
| 18. | Grading criteria (points / grade) |
| ||||||||||||
| 19. | Requirements for signature and taking the final exam | completed activities 15.1 and 15.2 | ||||||||||||
| 20. | Language of instruction | Macedonian and English | ||||||||||||
| 21. | Method of monitoring teaching quality | internal evaluation and survey mechanism | ||||||||||||
| 22. | Literature |
|