186.814 Algorithmics
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2019W, VU, 4.0h, 6.0EC
TUWEL

Properties

  • Semester hours: 4.0
  • Credits: 6.0
  • Type: VU Lecture and Exercise

Learning outcomes

After successful completion of the course, students are able to use advanced techniques to design efficient algorithms for the solution of computational problems. Furthermore, the students can justify the correctness of their algorithmic solutions and can determine their efficiency by theoretical methods.

Subject of course

This module covers advanced algorithms and data structures and algorithm analysis. It has an emphasis on (but is not limited to) algorithms on graphs and methods for problem solving and optimization. The module consists of a lecture together with exercises.

Topics covered:

  • Network flows and matchings
  • Planarity of graphs
  • A* algorithm
  • Randomized algorithms
  • Linear and (mixed) integer linear programming
  • Parameterized algorithms and kernelization
  • Graph decompositions and treewidth
  • Geometric Algorithms

Teaching methods

Introduction and explanation of general methods, discussion of examples, justification by giving formal arguments and proofs, independent problem solving, presentation and discussion of solutions.

Mode of examination

Immanent

Additional information

Organization

The course is divided by topics into six blocks, each consisting of three lectures and one blackboard exercise.
The final grade will be based on the blackboard exercises and on the final exam. There are six mandatory units of blackboard exercises.

First lecture takes place on October 2. After a brief presentation of the course organization, the first lecture will be given. 

 

Blackboard Exercises

They will take place on Thursday 17.10., 31.10., 7.11., 21.11., 28.11., and 12.12., each day in several groups at different times.
You will receive instructions a few weeks before these units and are expected to submit your solutions in advance and also to be able to present your solutions at the blackboard.
You have to register to one of the six groups in TISS and attendance to the exercise lessons of your particular group is compulsory.
Exercise sheets will be available for download.

The blackboard exercises take place in the library room HB 0408 of the Algorithms and Complexity group. It is located at Favoritenstrasse 9-11, Stairs 1, 4th floor

 

Final Exam

The final written exam takes place on January 20, 2020 and as an additional opportunity on March 5, 2020.
At least one exam has to be taken, if both are done then only the best result counts, and only one certificate will be issued.

 

Grading

The mark you receive depends on this final exam (40%) and your performance at the blackboard exercises (60%).
Blackboard exercises will influence your grade via two different measures:

  • the total number of exercises you indicate to have accomplished and submitted before the deadlines (40%),
  • your presentations of exercises at the blackboard (20%);

The minimal requirements for a positive grade are:

  • >=37% of all blackboard examples marked and successfully submitted in TUWEL (both) before the deadlines as well as at least 3 exercises per exercise sheet from at least 5 of the 6 exercise blocks
  • >=50% on average on your blackboard presentations
  • >=50% on at least one of the two written exams

To obtain full points for the exercises it is sufficient to mark and submit >=75% of all blackboards examples.

Overall grade distribution:
S1: [88%,100%]
U2: [75%,88%)
B3: [63%,75%)
G4: [50%,63%)
N5: [0%,50%)

Note: Once you attended at or submitted your solutions for at least one blackboard exercise session you will in any case receive a grade at the end of the term.

 

Course material

The lecture slides will be available in TUWEL.

 

Estimated effort

Hours   Activity
       32   Lecture
       65   Preparation of exercises
         6   Exercise groups
       45   Exam preparation
         2   Written exam
================
     150   Overall

 

Please send general and organisational questions to algorithmics@ac.tuwien.ac.at.

Lecturers

Institute

Course dates

DayTimeDateLocationDescription
Wed09:00 - 11:0002.10.2019 - 11.12.2019FAV Hörsaal 1 Helmut Veith - INF Lecture
Mon15:00 - 17:0007.10.2019 - 16.12.2019FAV Hörsaal 1 Helmut Veith - INF Lecture
Thu09:30 - 16:3017.10.2019 - 12.12.2019 library HB 0408Exercise Groups 1-6 (refer to the groups for exact times)
Mon13:00 - 15:0021.10.2019FAV Hörsaal 1 Helmut Veith - INF Lecture
Mon13:00 - 15:0018.11.2019FAV Hörsaal 1 Helmut Veith - INF Lecture
Mon13:00 - 15:0002.12.2019FAV Hörsaal 1 Helmut Veith - INF Lecture
Wed09:00 - 11:0015.01.2020FAV Hörsaal 1 Helmut Veith - INF Algorithmics Question Time
Algorithmics - Single appointments
DayDateTimeLocationDescription
Wed02.10.201909:00 - 11:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Mon07.10.201915:00 - 17:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Wed09.10.201909:00 - 11:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Mon14.10.201915:00 - 17:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Wed16.10.201909:00 - 11:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Thu17.10.201909:30 - 16:30 library HB 0408Exercise Groups 1-6 (refer to the groups for exact times)
Mon21.10.201913:00 - 15:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Wed23.10.201909:00 - 11:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Thu24.10.201909:30 - 16:30 library HB 0408Exercise Groups 1-6 (refer to the groups for exact times)
Mon28.10.201915:00 - 17:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Wed30.10.201909:00 - 11:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Thu31.10.201909:30 - 16:30 library HB 0408Exercise Groups 1-6 (refer to the groups for exact times)
Mon04.11.201915:00 - 17:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Wed06.11.201909:00 - 11:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Thu07.11.201909:30 - 16:30 library HB 0408Exercise Groups 1-6 (refer to the groups for exact times)
Mon11.11.201915:00 - 17:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Wed13.11.201909:00 - 11:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Thu14.11.201909:30 - 16:30 library HB 0408Exercise Groups 1-6 (refer to the groups for exact times)
Mon18.11.201913:00 - 15:00FAV Hörsaal 1 Helmut Veith - INF Lecture
Wed20.11.201909:00 - 11:00FAV Hörsaal 1 Helmut Veith - INF Lecture

Examination modalities

Submission of solutions of examples, presentation of independent solutions in whiteboard classes, solving exam questions in written tests.

Group dates

GroupDayTimeDateLocationDescription
Exercise Group 1Thu10:00 - 11:0017.10.2019 - 12.12.2019 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 1
Exercise Group 2Thu11:00 - 12:0017.10.2019 - 12.12.2019 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 2
Exercise Group 3Thu12:00 - 13:0017.10.2019 - 12.12.2019 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 3
Exercise Group 4Thu14:00 - 15:0017.10.2019 - 12.12.2019 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 4
Exercise Group 5Thu15:00 - 16:0017.10.2019 - 12.12.2019 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 5
Exercise Group 6Thu16:00 - 17:0017.10.2019 - 12.12.2019 Institutsbibliothek HB 0408 (Favoritenstrasse)186.814 Algorithmics Exercise Group 6
Exercise Group 7Thu17:00 - 18:0017.10.2019 - 12.12.2019 Institutsbibliothek 1921 HB 0408 (Favoritenstraße)186.814 Algorithmics Exercise Group 7

Course registration

Begin End Deregistration end
24.09.2019 00:00 07.10.2019 23:59

Group Registration

GroupRegistration FromTo
Exercise Group 108.10.2019 09:0013.10.2019 23:59
Exercise Group 208.10.2019 09:0013.10.2019 23:59
Exercise Group 308.10.2019 09:0013.10.2019 23:59
Exercise Group 408.10.2019 09:0013.10.2019 23:59
Exercise Group 508.10.2019 09:0013.10.2019 23:59
Exercise Group 608.10.2019 09:0013.10.2019 23:59
Exercise Group 708.10.2019 09:0013.10.2019 23:59

Curricula

Study CodeObligationSemesterPrecon.Info
066 645 Data Science Not specified
066 646 Computational Science and Engineering Not specified
066 926 Business Informatics Mandatory elective
066 931 Logic and Computation Mandatory1. Semester
066 932 Visual Computing Mandatory elective
066 937 Software Engineering & Internet Computing Mandatory elective
066 938 Computer Engineering Mandatory elective
860 GW Optional Courses - Technical Mathematics Not specified

Literature

Slides and relevant articles will be made available for download.

Previous knowledge

A good understanding of basic algorithms and data structures and methods to analyze them.

Preceding courses

Continuative courses

Language

English