LTI
LTI

Exercises for Efficient Algorithms and Data Structures I

Announcements:

General Information:

  • Teaching Assistants:

    Richard Stotz, Dennis Kraft

  • Office Hours:

    By appointment

  • Exam

    Exam DateTimeRoomsExam Review
    Final examFebruary 20, 2018 16:00 – 18:30MW 2001March 1, 2018
    Repeat examMarch 29, 201816:00 – 18:30Interim 1April 12, 2018; 10-11 am

    You are allowed to bring one A4 sheet to the exam of which could have handwritten notes (no printouts or photocopies allowed). In case you do bring such a sheet, you must write your matriculation number and full name very clearly at the top right of the sheet.

    Note that if you use a photocopied or printed sheet, it will be considered a cheating attempt.

    You are allowed to bring a standard german-english or english-english dictionary. There must be no handwritten notes in the dictionary.

  • Points and Grades

    This table is valid for both exams.

    Grade Points
    1,0 34 – 42 points
    1,3 31 – 33,5 points
    1,7 29 – 30,5 points
    2,0 27 – 28,5 points
    2,3 25 – 26,5 points
    2,7 23 – 24,5 points
    3,0 21 – 22,5 points
    3,3 19 – 20,5 points
    3,7 16 – 18,5 points
    4,0 13 – 15,5 points
    4,3 10 – 12,5 points (fail)
    4,7 5 – 9,5 points (fail)
    5,0 0 – 4,5 points (fail)

  • Place and Time:

    GruppeZeitRaum TutorBemerkung
    A01Mo. 12:00 - 14:00 00.08.038Stotz
    A02Mo. 12:00 - 14:00 00.09.038StotzMerged with group A01
    A03Mo. 14:00 - 16:00 02.09.023Liebl
    B04Di. 10:00 - 12:00 00.08.053KraftMerged with group B05
    B05Di. 12:00 - 14:00 03.11.018Kraft
    B06Di. 14:00 - 16:00 00.08.038Somogyi
    D07Do. 10:00 - 12:00 03.11.018Liebl
    E08Fr. 12:00 - 14:00 00.13.009Stotz
    E09Fr. 14:00 - 16:00 00.08.036Kraft

    All tutorials start cum tempore, i.e. 15 minutes late.

    If a tutorial is cancelled (Fachschaftsvollversammlung, Studentische Vollversammlung, public holidays), please attend another tutorial in the same week.

  • Submission of Solutions to Exercises:

    Exercises are posted on this webpage on Mondays. Solutions should be submitted in English by 10:15 on Monday of the following week, in the mailbox "Efficient Algorithms" on the basement floor in the MI-building.

    Solutions can be submitted in groups of up to 2 persons.

    Submissions must be handwritten by one member of the group. On each submission, you should also write the Matrikel No., Name of each student and also write the number of the tutorial session which each person in the group attends. Please also indicate which member wrote the solution. Please use this cover sheet [PDF]. Without this information, we can not grade submissions.

    Each student in a group gets the same marks for the corresponding assignment. The corrected solutions can be collected the following week in the corresponding tutorial.

    Solutions will be discussed in the tutorial of the week when the sheet has been handed in, i.e, the sheet may not be graded by this time.

  • Bonus

    It is possible to obtain a bonus on the exam (of 0.3 or 0.4 points, see lecture) if
    • 50 % of the points are achieved on submissions 2 - 8.
    • 50 % of the points are achieved on submissions 9 - 14.
    • Each group member has written at least 4 solutions.

    Please note that copying solutions from fellow students or other sources is considered cheating and immediately excludes from the bonus. Please respect the Student Code of Conduct.

    The bonus does count for the repeat exam.

Exercises and Solutions

Please use this cover sheet [PDF]

Sheet Date Tutorials Exercise Sheet Solution Comment
1 Oct. 16, 2017 23.10. – 27.10. [PDF] [PDF] Tutorial Exercises Only
2 Oct. 23, 2017 30.10. – 3.11. [PDF] [PDF]
3 Oct. 30, 2017 6.11. – 10.11. [PDF] [PDF]
4 Nov. 6, 2017 13.11. – 17.11. [PDF] [PDF]
5 Nov. 13, 2017 20.11. – 24.11. [PDF] [PDF]
6 Nov. 20, 2017 27.11. – 1.12. [PDF] [PDF]
7 Nov. 27, 2017 4.12. – 8.12. [PDF] [PDF] Updated 27-11-17, 6pm
8 Dec. 4, 2017 11.12. – 15.12. [PDF] [PDF]
9 Dec. 11, 2017 18.12. – 22.12. [PDF] [PDF]
10 Dec. 18, 2017 8.1. – 12.1. [PDF] [PDF] Updated Tutorial Exercise
11 Jan. 8, 2018 15.1. – 19.1. [PDF] [PDF] Added Tutorial Exercise
12 Jan. 15, 2018 30.1. – 3.2. [PDF] [PDF]
13 Jan. 22, 2018 29.1. – 2.2. [PDF] [PDF]
14 Jan. 29, 2018 5.2. – 9.2. [PDF] [PDF]

Previous Exams

The old exams only show you how an exam can look like. The contents of the course may have changed in the meantime. Proceed with caution.

We do not publish any model solutions for old exams.

Other


July 2022: Jens Quedenfeld completed his doctoral degree.

June 2022: Maximilian Janke completed his doctoral degree.

March 2022: Alexander Eckl completed his doctoral degree.

June 2021: Leon Ladwig completed his doctoral degree.

February 2020: The Program Committee of SWAT 2020 is chaired by Susanne Albers.

February 2020: Susanne Albers is invited speaker at the ACM India Annual Event.

ESA/ALGO 2019 will be organized by Susanne Albers and her group.

May 2019: Susanne Albers is invited speaker at the symposium 50 Years Informatics

July 2019: Susanne Albers is invited speaker at SIROCCO 2019, Italy.

December 2017: Susanne Albers will give keynote address at the Graduation Day, Department of Computer Science at RWTH Aachen University.

April 2017: New Research Training Center AdONE, funded by the German Research Foundation.

Susanne Albers receives ERC Advanced Grant. Press release of the Bavarian State Ministry of the Sciences, Research and the Arts.

August 2016: Susanne Albers is keynote speaker at Euro-Par 2016, Grenoble.

Susanne Albers, Nicole Megow and Andreas S. Schulz will organize MAPSP 2017.

Juni 2016: Susanne Albers gives an invited lecture at the Academy of Sciences and Literature, Mainz.

September 2015: Susanne Albers is invited speaker at MPI-INF – 25th Anniversary. The program features several Turing Award winners, Leibniz Prize winners, Humboldt Prize winners and ERC Grant winners.

June 2015: Susanne Albers is keynote speaker at the 31st International Symposium on Computational Geometry (SOCG15), Eindhoven.

June 2015: Susanne Albers is invited speaker of the tutorial on Network Creation Games: How Does the Internet Form? organized by Erik D. Demaine (MIT) and MohammadTaghi Hajiaghayi (University of Maryland). 16th Conference on Electronic Commerce (EC15), Portland, Oregon.

Lehrstuhl für Algorithmen und Komplexität
Prof. Dr. Susanne Albers

Boltzmannstr. 3
85748 Garching bei München

Tel +89.289.17706
Fax +89.289.17707

E-Mail
News