Page AlgorithmsWS13

Welcome to the Wiki of the MSc lectures Algorithms (19712)

News

Klausureinsicht - 2. Prüfung : 30 April 2014, 9-10h, T9, R012

Nachklausur: 09 April 2014, 10-12h, Takustr. 9 - großer Hörsaal

We will have a rehearsal on March 14th 14:15 in room T9, SR051. Please send me (Sandro) an email with your open questions.

Times and Places

• The lecture will start October 15th and end on December 06

Event	Day	Time	Address	Room
Lecture	Tue	10-12	Takustr. 9	SR006
Lecture	Thu	10-12	Takustr. 9	SR006
Exercise	Fri	12-14	Takustr. 9	SR 005
Exercise	Fri	14-16	Arnimallee 6	SR 032

Schedule

Lecture schedule

Date	Lecture	Lecturer
15.10.-22.10.	Graph algorithms
15.10.2013	Lecture 1: Shortest paths	Goldstein
17.10.2013	Lecture 2: Maximum flow	Goldstein
22.10.2013	Lecture 3: Matching	Goldstein
24.10.-29.10.	Analysis Methods and algorithm design
24.10.2013	Lecture 4: Types of algorithms	Reinert
29.10.2013	Lecture 5: Different types of analysis	Reinert
31.10.-19.11.	Hashing, Skiplists and tree decomposition
31.10.2013	Lecture 6: Hashing I	Reinert
05.11.2013	Lecture 7: Hashing II	Reinert/Andreotti
07.11.2013	Lecture 8: Skiplists I	Reinert/Andreotti
08.11.2013	Review 1 (during exercises)
12.11.2013	Lecture 9: Skiplists II	Reinert
14.11.2013	Lecture 10: Tree decomposition I	Reinert
19.11.2013	Lecture 11: Tree decomposition II	Reinert
21.11.-06.12.	Computability and Complexity
21.11.2013	Lecture 12: DFAs	Goldstein
26.11.2013	Lecture 13: Turing Machines and Computability I	Goldstein
28.11.2013	Lecture 14: Turing Machines and Computability II / Complexity I	Goldstein
29.11.2013	Review 2 (during exercises)
03.12.2013	Lecture 15: Complexity II	Goldstein
05.12.2013	Lecture 16: Lecture or rehearsal	Goldstein
06.12.2013	Exam (during exercises)

Additional Material

In this wiki you find additional material for the lectures and exercises (send your wiki login name to Sandro to get access): AdditionalMaterial

Results Exam 2

MatrNr.	Pts.	Mark
xxx8784	43	4,0
xxx9384	64	2,3
xxx3802	60	2,7
xxx4686	0	5,0
xxx1290	35	5,0
xxx1308	55	3,0
xxx7797	40	4,0

Results Exam 1

MatrNr.	Pts.	Mark
xxx5235	63	2,3
xxx3598	65	2,0
xxx8784	38,5	5,0
xxx2343	49	3,3
xxx9744	62,5	2,3
xxx4969	43	4,0
xxx7263	0	5,0
xxx9384	0	5,0
xxx5606	42	4,0
xxx9252	44,5	3,7
xxx3802	0	5,0
xxx8435	58	2,7
xxx3445	55	3,0
xxx3468	56	3,0
xxx4686	0	5,0
xxx0220	0	5,0
xxx7260	87	1,0
xxx7500	19	5,0
xxx9905	60	2,7
xxx2142	40	4,0
xxx1290	39	5,0
xxx1308	35,5	5,0
xxx7797	32	5,0

Contrary to the note on Task 5, we have decided not to give negative points on wrong answers in the multiple choice part.

Exercises

Sign up for the mailing list http://lists.fu-berlin.de/listinfo/AlgoOptiWS13

Nr.	Exercise	Discussion
1	exercise 1	21.10.
2	exercise 2	28.10.
3	exercise 3	01.11.
4	exercise 4	08.11.
5	exercise 5	15.11.
6	exercise 6	22.11.
7	exercise 7	--

The exercises will be split into a theoretical and a programming part. In the Friday exercise we will discuss questions and problems related to the programming assignments while the theoretical exercise sheets will be discussed on Monday. The accepted programming language for practical assignments is C++ and you will implement them in groups of three students. Every group will have their own subversion directory and the version of your code at deadline will be considered as your solution.

Reviews

Results Review 1

MatrNr	Pts
xxx235	28
xxx598	38,5
xxx784	22
xxx343	36
xxx744	32,5
xxx969	27
xxx263	24
xxx384	16
xxx606	38
xxx252	30,5
xxx802	27,5
xxx391	20
xxx435	38
xxx445	25
xxx468	30,5
xxx686	29
xxx0220	7
xxx260	34
xxx500	23,5
xxx905	39
xxx4220	24
xxx142	27

Results Review 2

MatrNr	Pts
xxx235	29
xxx598	37
xxx784	23,5
xxx343	20
xxx744	28,5
xxx969	24
xxx263	17,5
xxx384	25,5
xxx606	36
xxx252	21,5
xxx802	23
xxx435	28,5
xxx445	22
xxx468	27
xxx686	30
xxx260	43
xxx500	25
xxx905	36
xxx142	19

ProgrammingExercises

Requirements for Aktive Teilnahme

You have to hand in 75% of all practical assignments. (You have to show reasonable programs and can explain them.)

In addition you need to reach 50% of all points of the two reviews.