|
Vyučující
|
|
|
|
Obsah předmětu
|
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
|
|
Studijní aktivity a metody výuky
|
|
nespecifikováno
|
|
Výstupy z učení
|
The second part of the introductory course of algorithmization and programming, which is focused on the implementation of own abstract data structures (e.g. connection lists, trees, queues and stacks) and operations on them by mean of OOP classes. Students will also get to know the basic meansv of object polymorphism (interface and inheritance) with emphasis on the representation of iterators. Lectures and exercises will be in Python programming language.
|
|
Předpoklady
|
basics of procedural programming (loops, procedures), basics of object-oriented programming (class, methods), interface of containers (list, dictionary) and file streams (preferably in Python)
|
|
Hodnoticí metody a kritéria
|
nespecifikováno
preparation and oral defense of a seminar work
|
|
Doporučená literatura
|
|