R003 Návrh algoritmů pro rozšiřující studium IV

Faculty of Informatics
Spring 1999
Extent and Intensity
0/0. 0 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
Contact Person: RNDr. Libor Škarvada
Prerequisites
R002 Návrh algoritmů pro rozšiřující studium III
Before enrolling this course the students should go through R002 .
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Programming language C. Modular structure. Automatic, static, and dynamic variables. Visibility, modules. Library functions. Preprocessor.
  • Sorting. Inner and outer sorting algorithms. Heapsort, Quicksort, Mergesort.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Spring 1998.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/spring1999/R003