FI:U210 Design of Algorithms for CS II

U210 Design of Algorithms for CS III

Faculty of Informatics
Autumn 1997

Extent and Intensity

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

U111 Design of Algorithms for CS II || I002 Design of Algorithms I
Prior going through U110 and U111 Design of Algorithms for CS II is suggested.

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.
Programming language C. Modular structure. Automatic, static, and dynamic variables. Visibility, modules. Library functions. Preprocessor.

Language of instruction

Czech

The course is also listed under the following terms Autumn 1996.