FI:U111 Design of Algorithms for CS II

U111 Design of Algorithms for CS II

Faculty of Informatics
Spring 1997

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)

Guaranteed by

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

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

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

The course is also listed under the following terms Spring 1996, Spring 1998.