FI:I002 Design of Algorithms I - Course Information

I002 Design of Algorithms I

Faculty of Informatics
Spring 1999

Extent and Intensity

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

! U212 Design of Algorithms for CS IV
It is recommended to register this course together with I065 Seminar on Design of Algorithms I. The students should be able to write simple algorithms and code them in some functional and some imperative language.

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

Programming paradigms, expressions, commands, state.
Correctness of algorithms, preconditions, postconditions, partial correctness, convergence. Verification methods.
Growth of functions. Recurrences, summations.
Computation length, algorithm complexity, problem complexity. Classes P, NP.
Basic data structures (lists, trees, graphs, arrays).
Searching, search trees.
Sorting, lower bound of sorting algorithms. Quick Sort, Merge Sort, Heap Sort.
Combinatorial and graph algorithms. Shortest Path, Minimum Spanning Tree, Colouring.
Greedy algorithms.

Literature

CORMEN, Thomas H., Charles Eric LEISERSON and Ronald L. RIVEST. Introduction to algorithms. Cambridge: MIT Press, 1989, xvii, 1028. ISBN 0070131430. info

Language of instruction

Czech

Further comments (probably available only in Czech)

The course is taught annually.
The course is taught: every week.