FI:U212 Návrh algoritmů pro VT IV - Course Information

U212 Návrh algoritmů pro VT IV

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

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

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

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

• Enrolment Statistics (Spring 1997, recent)
  
• Permalink: https://is.muni.cz/course/fi/spring1997/U212