R002 Návrh algoritmů pro rozšiřující studium III

Faculty of Informatics
Autumn 1998
Extent and Intensity
0/0. 0 credit(s). Type of Completion: z (credit).
Teacher(s)
RNDr. Libor Škarvada (lecturer)
Guaranteed by
Contact Person: RNDr. Libor Škarvada
Prerequisites
R000 Návrh algoritmů pro VT I && R001 Návrh algoritmů pro VT II
Prior going through R000 and R001 is recommended.
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
  • Recursive functions, tail recursion, memoization, backtracking.
  • Tree-traversing algorithms, minimax procedure and alpha-beta procedure.
  • Parameters of functions, call by name, call by value. Pointers, call by reference; call by result. Higher-order functions, functional and procedural parameters.
  • Compiler memory classes, stack, heap. Abstract data types. Modules.
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 Autumn 1997.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/autumn1998/R002