Exercise Sheet 4
The rules for uploading are the same as always. If you forgot them, you can read them again here.
Your solutions (files can only be read by the uploader and by us)
Along with the PDF of your solutions and your source code, please also provide the following two figures, so that all can see them: the maximal time difference you measured between (1) and (2) for Exercise 1, the best speed-up you get from using compression for Exercise 4 (next to last column), and the programming language you used (last column).
No. |
Name |
Solution (PDF) |
Code (ZIP or TGZ) |
Factor for Ex. 1 |
Speed-up for Ex. 4 |
Progr. Language |
1 |
sequential access better by roughly factor 1.7 see pdf for details |
compression better by factor ~5.3 (comparing reading + decompression) |
Java |
|||
2 |
sequential access better by factor of 37 |
--- |
Java |
|||
3 |
max. time difference: ~189,14 ms -> seq. access better by factor ~1,8 |
compression better by factor ~9 (depends heavily on m and n) |
C# |
|||
4 |
seq. access better by factor ~14 |
compression better by factor ~2 |
Java |
|||
5 |
seq. access better by factor ~2 to 70, depends on increment value (see pdf) |
- |
Java |
|||
6 |
seq. access better by factor ~2 |
- |
Python |
|||
7 |
- |
- |
Java |