Instructor: Eik List
Class Meeting: Every two weeks Mondays 01:30 pm (Start: October 10th 2016), Seminar room 14 (SR014), Bauhausstraße 11 (B11)
FAQ: 23 Feb 2017 and 23 Mar 2017, both 01:30 PM, B11, SR015
Computer Science and Media, M.Sc.
The problem sets usually have to be submitted before the problem session via e-mail to eik.list(at)uni-weimar.de.
- Problem Set 1 (due to 18 Oct 2016, 1:30 PM before the problem session)
- Problem Set 2 (due to 07 Nov 2016).
- Problem Set 3 (due to 21 Nov 2016).
- Problem Set 4 (due to 05 Dec 2016)
- Problem Set 5 (due to 16 Dec 2016)
- Specifications: thread.ads, elections.ads, murmur_hash2.ads, murmur_hash2_test_vectors.txt
- Update for Task 4: Removed the unnecessary State_Type; Removed the comment of the procedure "Hash" (it should not store any internal state, just compute a hash); Renamed its out parameter "Result" to not conflict with "Hash"; Updated the legacy C code with explicit 64-bit types to compile without warnings; Added test vectors.
- Problem Set 6 (due to 10 Jan 2017)
- Problem Set 7 (due to 23 Jan 2017)
- Specifications: gf2n.ads, graph.ads, graph.adb, graph_algorithms.ads, collision_search_context.ads, parallel_collision_search.ads, mitm.ads, mini_xtea.ads
- Update for Task 2: Uploaded graph implementation and updated the specification of the Graph_Algorithm package.
- Update for Task 2: The implementation of Remove_Edge in graph.adb has been updated.
- Bonus Problem Set (due to 10 Mar 2017)
- Problem Session 0 (Introduction, 10 Oct 2016)
- Problem Session 1 (18 Oct 2016)
- Problem Session 2 (07 Nov 2016)
- Problem Session 3 (21 Nov 2016)
- Problem Session 4 (05 Dec 2016)
- Problem Session 5 (16 Dec 2016)
- Problem Session 6 (10 Jan 2017)
- Problem Session 7 (23 Jan 2017)
- FAQ Session (23 Mar 2017)
- You can work in groups of at most three students. Only one write-up per group is required.
- We highly recommend to compose your solutions in LaTeX
- A LaTeX template can be found here. It can be simply build by using pdflatex.
- The testgen source can be found here.
Problem Set 2:
- Mini Project 1: Kazi Fakrul Islam
- Mini Project 2: Matti Wiegmann
Problem Set 3:
- Mini Project 1: Alexander Bondarenko
- Mini Project 2: André Karge
- Mini Project 3: Erdan Genc
- Mini Project 4: Masoud Allahyari
Problem Set 4:
- Mini Project 1: Joshua Reibert
- Mini Project 2: Kristof Komlossy
- Mini Project 3: Kai-Gerrit Lünsdorf
- Mini Project 4: Philipp Seltmann
Problem Set 5:
- Mini Project 1: Jannis Bossert
- Mini Project 2: Janek Bevendorff
- Mini Project 3: Kevin Lang
Problem Set 6:
- Mini Project 1: Andrii Artamonov
- Mini Project 2: Nathalie Dittrich
- Mini Project 3: Max Weber
Problem Set 7:
- Mini Project 1: Aaron Solbach
- Mini Project 2: None
- Mini Project 3: Sebastian Schmitz, Isabell Fidelak
- Mini Project 4: None
Bonus Problem Set:
- Mini Project 1: Joshua David König
- Mini Project 2: Georg Erfurt
- Mini Project 3: Hagen Hiller
- Mini Project 4: Ephraim Schott
- Mini Project 5: Sebastian Schmitz
The majority of the problem sets include so called mini-projects. Admission to oral examination is the successful completion of at least two such mini-projects, and presenting one mini-project. The presentation is about 15 minutes plus 5 minutes discussion.
- Deadline: TBA
- Policy: First come, first serve.
- Notification: TBA
- You get points for solving problems and mini-projects. Achieve at least 25% of the points per problem set to get a 1/3 bonus to your grade.
- After the end of lectures, bonus projects will be available. Solve them to at least 50% to get an additional 1/3 bonus to your grade.