Course detail

Selected Chapters from Programming

FSI-0VPAcad. year: 2025/2026

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.

Language of instruction

Czech

Number of ECTS credits

2

Mode of study

Not applicable.

Guarantor

Ing. Jiří Kovář, Ph.D.

Department

Institute of Automation and Computer Science (ÚAI)

Entry knowledge

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.

Rules for evaluation and completion of the course

Course-unit credit is conditional on an active attendance at seminars.

Attendance at the seminars is controlled. An absence can be compensated for via solving given problems.

Aims

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.
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.

Study aids

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Kernighan, B.W. - Ritchie, D. M.: Programovací jazyk C. Computer Press, 2006.
Wirth, N.: Algoritmy a štruktúry údajov. Alfa, Bratislava, 1988.

Recommended reading

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.

Classification of course in study plans

  • Programme B-PRP-P Bachelor's 1 year of study, summer semester, elective

  • Programme B-ZSI-P Bachelor's

    specialization STI , 1 year of study, summer semester, elective

Type of course unit

 

Computer-assisted exercise

26 hod., compulsory

Teacher / Lecturer

Ing. Jiří Kovář, Ph.D.

Syllabus

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.
6. Functions.
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.