Eugene Kornykhin

slides: welcome (pdf), part1-1 (pdf), part1-2 (pdf), part1-3 (pdf), part2-1 (pdf), part2-2 (pdf), part2-3 (pdf), part3-1 (pdf) , part3-2 (pdf) , part3-3 (pdf)
Try Scheme in your browser! (you will use GNU intepreter for Scheme).
Download Scheme (Racket): Windows x86, Windows x64, Ubuntu x86, Debian squeeze x64, other links
Expression-only style conventions (without if statement)
1. all formal parameters are const
2. no global variables and fields
3. no functions with `void' return type
4. all local variables are const
5. only allowed statement is a return statement
6. only one return in function
Expression-only style conventions (with if statement)
1. all formal parameters are const
2. no global variables and fields
3. no functions with `void' return type
4. all local variables are const
5. each if-statement has else-branch
6. each branch of if-statement ends with return statement
7. each switch-statement has default-branch
8. no goto, while, for, do-while statements
9. no "expression statements" (f.e., "x;", "f(x);" statement)
10. no unreachable code
functional lists: fplists.h, fplists.cpp
advanced expression-only style trainings:
1. long arithmetic (addition, subtraction)
2. long multiplication in columns (idea for the solution)
3. Karatsuba multiplication (idea1, idea2)
the path in the maze problem solutions (don't look at them before the seminar): variant1, variant2, variant3, variant4
Doctor
homeworks ##1-3
1. homework #1.1 (rewrite according to expression-only style in C++): 00.c, 01.c, 02.c, 03.c
2. homework #1.2 (implement according to expression-only style in C++):
  1. for a given natural number, return its maximal prime divisor
  2. for a given natural number, return production of its maximal prime divisor and premaximal prime divisor, or 1, if a given number is prime
  3. for a given natural number, return the closest upper prime number for it
3. homework #2.1 (implement according to expression-only style in C++):
  1. for a given ordered list and a number, insert this number to the list preserving order
  2. for a given list of numbers and a number from this list, return count of its occurences in this list
  3. for a given list of numbers, return its reversed version
  4. for a given list of numbers, return sum of its items
  5. for given two ordered lists of numbers, merge theirs (ordered list with items from both lists)
4. homework #3.1 (implement according to expression-only style in C++ using tail recursion):
  1. for a given ordered list and a number, insert this number to the list preserving order
  2. for a given list of numbers and a number from this list, return count of its occurences in this list
  3. for a given list of numbers, return its reversed version
  4. for a given list of numbers, return sum of its items
  5. for given two ordered lists of numbers, merge theirs (ordered list with items from both lists)
  6. for a given list of numbers, return another list with the same items but without duplicates (order doesn't matter)
  7. for given two lists of numbers, return theirs common items without duplicates (order doesn't matter), source lists don't contain duplicates
  8. for given two lists of numbers, return theirs common items without duplicates (order doesn't matter), source lists may contain duplicates
  9. for a given list of numbers, return maximal sum of pair of different items from this list
Genetic programming: variants, additional slides, about visualization.

Eugene Kornykhin (Евгений Корныхин)

PhD in Computer Science from Lomonosov Moscow State University

Associate professor (доцент) at Lomonosov Moscow State University

Researcher at Institute for System Programming of Russian Academy of Sciences

Contact:

Teaching