Selected Chapters from Programming
FSI-0VPAcad. year: 2018/2019
The course introduces students to the technology of the program writing and building, the formulation of selected classes of algorithms in the C programming language and the use of advanced data structures. The focus is also placed on developing large projects and the basics of teamwork. Explanation of all terms is performed by a using of practical examples.
Learning outcomes of the course unit
The course "Selected Chapters from Programming" allows students to gain knowledge of algorithms and data structures in a higher extent than in the basic compulsory courses.
Ability to operate a computer and knowledge of common operations with files is a prerequisite. At least partial knowledge of programming in any language is an advantage but not essential.
Recommended optional programme components
Recommended or required reading
Wirth, N.: Algoritmy a štruktúry údajov. Alfa, Bratislava, 1988.
Herout, P.: Učebnice jazyka C. Kopp, 2006.
Vystavěl, R.: Moderní programování učebnice pro začátečníky. moderníProgramování, 2009.
Kernighan, B.W. - Ritchie, D. M.: Programovací jazyk C. Computer Press, 2006.
Planned learning activities and teaching methods
The course is taught through exercises which are focused on practical topics presented in lectures.
Assesment methods and criteria linked to learning outcomes
Course-unit credit is conditional on an active attendance at seminars.
Language of instruction
The goal is to to master the selected parts of programming. The idea is to complete missing input knowledge to improve the ability of candidates to right real programmes during their further study and practice.
Specification of controlled education, way of implementation and compensation for absences
Attendance at the seminars is controlled. An absence can be compensated for via solving given problems.
Type of course unit
26 hours, compulsory
Teacher / Lecturer
1. Introduction, organizational guidelines. Structure and properties of algorithms.
2. Control structures. The structure of the program.
3. Simple data types. Arrays. Input and output.
4. Arrays and pointers.
5. Data type "struct". File operations.
7. Recursive algorithms.
8. Dynamic data structures.
9. Sorting algorithms.
10. Large projects development.
11. Large projects development.
12. Consultation of individual projects.
13. Consultation of individual projects. Accreditation.