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

October 1:

• 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 15: Basic control structures (if, while, for), basic notions of computational complexity. Presentation.

October 22: 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)

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

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

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

November 26: Quicksort, pointers. Presentation.

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

December 10: 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 17: Sparse polynomials and matrices, low-level access to memory, hashing, heaps, arithmetic expressions, notations and conversion between them. Presentation.

January 7: (expected): Long numbers and their representation, graph representations, graph algorithms. Presentation.