Details:
1st midterm: October 15 18:00, lecture room IB028
(Corrected midterms can be looked at on October 22 at class meeting. The problem sheet and sketches of solutions can be found here .)
2nd midterm: December 4 18:00, lecture room IB028
(The problem sheet for the second midterm and sketches of solutions can be found here .)
For getting a valid grade at least 40% of the score should be achieved (separately) on both midterms. The final grade is calculated by averaging the results of the two midterms both taken into account with weight 1/2. Conversion to grades is as follows: from 85% to 100% performance the grade is 5. Below that it is 4 from 70%, 3 from 55%, and 2 from 40%. Below 40% no valid grade is obtained.
Details:
Retake of 1st midterm: October 30 18:00, lecture room IB025.
(The problem sheet of the retake of the first midterm and sketches of solutions can be found here .)
Retake of 2nd midterm: December 16 8:00, lecture room IE220.
Final retake possibility (only for those who have one valid midterm and miss only the other one): January 2, 2020, 8:00 - 10:00, room IE216-1 (Please note that registration via neptun is required.)
Rules of how make up midterm scores are taken into account:
If someone takes a make up midterm for improving the result of the corresponding midterm, then the new result will be valid even if it is weaker than the original one. There is one exception to this: If on an original midterm one already achieved 40% of the score then the midterm remains valid (counted with a minimum 40% score) even if the make up score is below 40%.
In case someone fails to have one and only one of the midterms valid at the end of the semester, then (s)he can take one last opportunity to achieve 40% score on the missing midterm (and thus to obtain a valid grade) on an extra make up midterm. (This will be on January 2, 2020, 8:00 - 10:00, in room IE216-1; please note that registration via neptun is required.)
Examples for the Lempel-Ziv data compression algorithms LZ77 and LZ78 (Source: Györfi László, Gyôri Sándor, Vajda István "Információ- és kódelmélet", textbook in Hungarian, published by Typotex Kiadó)
Example for the Lempel-Ziv-Welch data compression algorithm (Source: Györfi László, Gyôri Sándor, Vajda István "Információ- és kódelmélet", textbook in Hungarian, published by Typotex Kiadó)
Some exercises we looked at in class