| Course title | Algorithms and Programming II |
|---|---|
| Course code | KI/EAPR2 |
| Organizational form of instruction | Lecture + Lesson |
| Level of course | unspecified |
| Year of study | not specified |
| Semester | Winter and summer |
| Number of ECTS credits | 7 |
| Language of instruction | English |
| Status of course | unspecified |
| Form of instruction | Face-to-face |
| Work placements | This is not an internship |
| Recommended optional programme components | None |
| Course availability | The course is available to visiting students |
| Lecturer(s) |
|---|
|
| Course content |
|
1. Implementation of classes (data fields, methods, constructors) 2. Abstract data types (ADT), implementation of sequential data structures (queue, stack, sorted list) 3. Implementation of algorithms over sequential collections - search algorithms 4. - 5. Implementation algorithms over sequential collections - sorting algorithms 6. Linked structures and their object implementation (linked lists, trees, etc.) 7. - 8. Implementation of algorithms over linked structures 9. Assignment of seminar work, discussion and implementation proposal 10. Interfaces (protocols or abstract base classes in Python parlance), iterators and their implementations, interfaces of basic collections 11. Complete implementation of own collection 12. Inheritance (advantages and disadvantages) 13. Practical use of inheritance
|
| Learning activities and teaching methods |
| unspecified |
| Learning outcomes |
| Prerequisites |
|
basics of procedural programming (loops, procedures), basics of object-oriented programming (class, methods), interface of containers (list, dictionary) and file streams (preferably in Python)
|
| Assessment methods and criteria |
|
unspecified
preparation and oral defense of a seminar work |
| Recommended literature |
|
|
| Study plans that include the course |
| Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester |
|---|