Here we summarize the content of individual lectures on Programming held in English language:

October 5:

• Organization of the course, requirements for course credit (semester project with documentation, test on pointers, active participance at classes [assignments] that gets mainly measured by number of points in CodEx).
• What is an algorithm, correctness of algorithm, examples of several algorithms (mainly including proof of correctness),
• formulated stable-matching problem (shall be solved next lecture).
• Presentation.

October 19: Basic control structures (if, while, for), basic notions of computational complexity. Presentation.

October 26: Arrays, sieve of Eratosthenes, unary and binary searching in the array, Horner's method, how to define (and call) functions and procedures, global and local variables. Presentation (next time we start around functions)

November 2: Precomputation (maximum constant submatrix), nested functions, introduction to the recursion (simple problems solved by recursion). Presentation.

November 9: Dean's day of sport (no lecture)

November 16: Enumerated data-types, control structure "case ... of ...", compiler directives, files (text files). Presentation.

November 23: Structures (data type "record"), binary files. Presentation. Simple sorting algorithms, units. Presentation.

November 30: Quicksort, pointers. Presentation.

December 7: Directive "forward", linked lists. Queue, buffer, binary trees, binary search trees, the notion of balancedness. Presentation, we finished at frame 47.

December 14: AVL-trees, red-black-trees, A-B-trees, remark on A-sort canonical representation of k-ary tree with a data structure for binary tree. Presentation.

December 21: Due to absence of the majority we made an individual lecture.

January 4: Sparse polynomials and matrices, low-level access to memory, hashing. Presentation.

January 11: Long numbers and their representation, graph representations, graph algorithms. Presentation.