FI:U212 Design of Algorithms for CS IV

U212 Design of Algorithms for CS IV

Faculty of Informatics
Spring 1998

Extent and Intensity

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

U210 Design of Algorithms for CS III
Before enrolling this course the students should go through U210 Design of Algorithms for CS III.

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

Verification of programs. Partial correctness. Verification methods.
Termination. Total correctness.
Brief introduction to complexity. Ranks of functions.
Sorting. Inner and outer sorting algorithms. Heapsort, Quicksort, Mergesort.
Combinatoric and graph algorithms. Shortest path, minimal spanning tree, flows in networks, colouring.

Language of instruction

Czech

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