FI:U111 Design of Algorithms for CS II - Course Information

U111 Design of Algorithms for CS II

Extent and Intensity

1/2. 0 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

doc. RNDr. Zdeněk Botek, CSc. (lecturer)
RNDr. Jaroslav Pelikán, Ph.D. (lecturer)

Guaranteed by

Contact Person: doc. RNDr. Zdeněk Botek, CSc.

Prerequisites (in Czech)

U110 Návrh algoritmů pro VT I || I001 Introduction to Computer Science

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

• Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)

Syllabus

• Design and implementation of a real problem using Pascal (store, timetable, world championship, ...).
• Recursion, backtracking.
• Pointer data type. Dynamic data structures. Stack, queue, linear list.
• Metodic of programming.

Language of instruction

Czech

• Enrolment Statistics (recent)
  
• Permalink: https://is.muni.cz/course/fi/spring1998/U111