|
Size: 3101
Comment:
|
Size: 5715
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 2: | Line 2: |
| Line 6: | Line 5: |
| Line 8: | Line 6: |
||'''No.''' ||'''Name''' ||'''Solution (PDF)''' ||'''Code (ZIP or TGZ)''' || '''Factor for Ex. 1''' || '''Speed-up for Ex. 4''' || '''Progr. Language''' || ||1 ||[[SearchEnginesWS0910/BjörnBuchholdExercises|Björn Buchhold]] ||[[attachment:SearchEnginesWS0910/BjörnBuchholdExercises/björn_buchhold_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/BjörnBuchholdExercises/björn_buchhold_ex4.zip|ZIP]] || sequential access better by roughly factor 1.7 see pdf for details || compression better by factor ~5.3 (comparing reading vs reading + decompression)|| Java || ||2 ||[[SearchEnginesWS0910/RichardZahoranskyExercises|Richard Zahoransky]] ||[[attachment:SearchEnginesWS0910/RichardZahoranskyExercises/Richard_Zahoransky_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/RichardZahoranskyExercises/Richard_Zahoransky_ex4.zip|ZIP]] || sequential access better by factor of 37 || --- || Java || ||3 ||[[SearchEnginesWS0910/FlorianBaeurleExercises|Florian Bäurle]] ||[[attachment:SearchEnginesWS0910/FlorianBaeurleExercises/florian_baeurle_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/FlorianBaeurleExercises/florian_baeurle_ex4.zip|ZIP]] || 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 ||[[SearchEnginesWS0910/MirkoBrodesserExercises|Mirko Brodesser]] ||[[attachment:SearchEnginesWS0910/MirkoBrodesserExercises/mirko_brodesser_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/MirkoBrodesserExercises/mirko_brodesser_ex4.zip|ZIP]] || seq. access better by factor ~14 || compression better by factor ~2 || Java || ||5 ||[[SearchEnginesWS0910/EricLacherExercises|Eric Lacher]] ||[[attachment:SearchEnginesWS0910/EricLacherExercises/Eric_Lacher_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/EricLacherExercises/Eric_Lacher_ex4.zip|ZIP]] || seq. access better by factor ~2 to 70, depends on increment value (see pdf) || - || Java || ||6 ||[[SearchEnginesWS0910/ThomasLiebetrautExercises|Thomas Liebetraut]] ||[[attachment:SearchEnginesWS0910/ThomasLiebetrautExercises/thomas_liebetraut_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/ThomasLiebetrautExercises/thomas_liebetraut_ex4.tgz|tgz]] || seq. access better by factor ~2|| - || Python || ||7 ||[[SearchEnginesWS0910/JonasKrischExercises|Jonas Krisch]] ||[[attachment:SearchEnginesWS0910/JonasKrischExercises/jonas_krisch_ex1.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/JonasKrischExercises/jonas_krisch_ex4.zip|ZIP]] || - || - || Java || |
||'''No.''' ||'''Name''' ||'''Solution (PDF)''' ||'''Code (ZIP or TGZ)''' ||'''Factor for Ex. 1''' ||'''Speed-up for Ex. 4''' ||'''Progr. Language''' || ||1 ||[[SearchEnginesWS0910/BjörnBuchholdExercises|Björn Buchhold]] ||[[attachment:SearchEnginesWS0910/BjörnBuchholdExercises/björn_buchhold_ex4_2.pdf|PDF(2nd upload, corrected version)]] ||[[attachment:SearchEnginesWS0910/BjörnBuchholdExercises/björn_buchhold_ex4.zip|ZIP]] ||sequential access better by roughly factor 1.7 see pdf for details ||compression better by factor ~5.3 (comparing reading vs reading + decompression) ||Java || ||2 ||[[SearchEnginesWS0910/RichardZahoranskyExercises|Richard Zahoransky]] ||[[attachment:SearchEnginesWS0910/RichardZahoranskyExercises/Richard_Zahoransky_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/RichardZahoranskyExercises/Richard_Zahoransky_ex4.zip|ZIP]] ||sequential access better by factor of 37 ||--- ||Java || ||3 ||[[SearchEnginesWS0910/FlorianBaeurleExercises|Florian Bäurle]] ||[[attachment:SearchEnginesWS0910/FlorianBaeurleExercises/florian_baeurle_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/FlorianBaeurleExercises/florian_baeurle_ex4.zip|ZIP]] ||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 ||[[SearchEnginesWS0910/MirkoBrodesserExercises|Mirko Brodesser]] ||[[attachment:SearchEnginesWS0910/MirkoBrodesserExercises/mirko_brodesser_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/MirkoBrodesserExercises/mirko_brodesser_ex4.zip|ZIP]] ||seq. access better by factor ~14 ||compression better by factor ~2 ||Java || ||5 ||[[SearchEnginesWS0910/EricLacherExercises|Eric Lacher]] ||[[attachment:SearchEnginesWS0910/EricLacherExercises/Eric_Lacher_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/EricLacherExercises/Eric_Lacher_ex4.zip|ZIP]] ||seq. access better by factor ~2 to 70, depends on increment value (see pdf) ||- ||Java || ||6 ||[[SearchEnginesWS0910/ThomasLiebetrautExercises|Thomas Liebetraut]] ||[[attachment:SearchEnginesWS0910/ThomasLiebetrautExercises/thomas_liebetraut_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/ThomasLiebetrautExercises/thomas_liebetraut_ex4.tgz|tgz]] ||seq. access better by factor ~2 ||- ||Python || ||7 ||[[SearchEnginesWS0910/JonasKrischExercises|Jonas Krisch]] ||[[attachment:SearchEnginesWS0910/JonasKrischExercises/jonas_krisch_ex1.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/JonasKrischExercises/jonas_krisch_ex4.zip|ZIP]] ||- ||- ||Java || ||8 ||[[Triatmoko]] ||[[attachment:Triatmoko_Exe4.pdf|Pdf]] ||[[attachment:Triatmoko_exe4.rar|Rar]] ||- ||- ||Borland Delphi 7 || ||9 ||[[SearchEnginesWS0910/MatthiasSauerExercises|Matthias Sauer]] ||[[attachment:SearchEnginesWS0910/MatthiasSauerExercises/matthias_sauer_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/MatthiasSauerExercises/mathtias_sauer_ex4.zip|ZIP]] ||seq. access better by factor ~15 ||compression worse by factor ~2 ||C# || ||10 ||[[SearchEnginesWS0910/DanielSchauenbergExercises|Daniel Schauenberg]] ||[[attachment:SearchEnginesWS0910/DanielSchauenbergExercises/daniel_schauenberg_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/DanielSchauenbergExercises/daniel_schauenberg_ex4.tar.gz|tar.gz]] || permutation access takes ~150% || -- || python || ||11 ||[[SearchEnginesWS0910/JonasSterniskoExercises|Jonas Sternisko]] ||[[attachment:SearchEnginesWS0910/JonasSterniskoExercises/jonas_sternisko_ex04.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/JonasSterniskoExercises/jonas_sternisko_ex04.tar.gz|tar.gz]] || permutation access about 10-times slower (geometric mean) || -- || Python || ||12 ||[[SearchEnginesWS0910/ZhongjieCaiExercises|Zhongjie Cai]] ||[[attachment:SearchEnginesWS0910/ZhongjieCaiExercises/zhongjie_cai_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/ZhongjieCaiExercises/zhongjie_cai_ex4.zip|ZIP]] || sequence access faster by factor 1.1~1.8 || compression faster by 2~3 || VB.Net || ||13 ||[[SearchEnginesWS0910/MatthiasFrorathExercises|Matthias Frorath]] ||[[attachment:SearchEnginesWS0910/MatthiasFrorathExercises/Matthias_Frorath_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/MatthiasFrorathExercises/Matthias_Frorath_ex4.zip|ZIP]] || sequence access faster by factor 1.25~2.5 || - || Python || ||14 ||[[SearchEnginesWS0910/PareshParadkarExcercises|Paresh Paradkar]] ||[[attachment:SearchEnginesWS0910/PareshParadkarExcercises/Paresh_Paradkar_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/MatthiasFrorathExercises/Paresh_Paradkar_ex4.zip|ZIP]] || - || - || Java || ||15 ||[[SearchEnginesWS0910/nibblerExcercises|Ivo M.]] ||[[attachment:SearchEnginesWS0910/nibblerExercises/se_loesung04.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/nibblerExercises/src_ivo.tar|tar]] || - || - || || ||16 ||[[SearchEnginesWS0910/MariusGreitschusExercises|MariusGreitschus]] ||[[attachment:SearchEnginesWS0910/MariusGreitschusExercises/marius_greitschus_ex4.pdf|PDF]] ||[[attachment:SearchEnginesWS0910/MariusGreitschusExercises/marius_greitschus_ex4.tar.gz|tar.gz]] || sequencial access better by factor of ~48 || Encoding speeds up at a factor of ~1.04 || C# || |
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 vs 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 |
|||
8 |
- |
- |
Borland Delphi 7 |
|||
9 |
seq. access better by factor ~15 |
compression worse by factor ~2 |
C# |
|||
10 |
permutation access takes ~150% |
-- |
python |
|||
11 |
permutation access about 10-times slower (geometric mean) |
-- |
Python |
|||
12 |
sequence access faster by factor 1.1~1.8 |
compression faster by 2~3 |
VB.Net |
|||
13 |
sequence access faster by factor 1.25~2.5 |
- |
Python |
|||
14 |
- |
- |
Java |
|||
15 |
- |
- |
|
|||
16 |
sequencial access better by factor of ~48 |
Encoding speeds up at a factor of ~1.04 |
C# |