104.999 Discrete and geometric algorithms
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2020W, VO, 4.0h, 6.0EC
TUWEL

Properties

  • Semester hours: 4.0
  • Credits: 6.0
  • Type: VO Lecture
  • Format: Distance Learning

Learning outcomes

After successful completion of the course, students are able to...

The intended result of this course is to understand the contents of the course.
Among other effects, this understanding forms the basis for the capability to
correctly reproduce the statements and notions covered in the course as well as
for the ability to explain and apply the proof techniques used in the course.

Subject of course

This lecture is an introduction to the design and analysis of algorithms for
students of mathematics The structure of the lecture mostly follows the central
design principles for algorithms, such as divide-and-conquer, dynamic
programming, or greedy algorithms. In order to achieve a well-balanced
presentation of the subject, graph theory and data structures play an important
role throughout the lecture. The mathematical foundations of discrete
algorithms, such as elementary combinatorics or recurrence relations, will be
treated thoroughly. In the choice of concrete algorithms mathematical tasks,
such as matrix multiplication, linear optimisation, or geometric problems, have
been preferred.

Teaching methods

Presentation of the subject of the lecture.

Mode of examination

Written

Additional information

The lecture starts on Monday, October 5.

Lecturers

Institute

Course dates

DayTimeDateLocationDescription
Mon11:00 - 12:3005.10.2020 - 25.01.2021 TUWEL/Zoom (LIVE)Lecture
Wed13:00 - 14:3007.10.2020 - 27.01.2021 TUWEL/Zoom (LIVE)Lecture
Discrete and geometric algorithms - Single appointments
DayDateTimeLocationDescription
Mon05.10.202011:00 - 12:30 TUWEL/ZoomLecture
Wed07.10.202013:00 - 14:30 TUWEL/ZoomLecture
Mon12.10.202011:00 - 12:30 TUWEL/ZoomLecture
Wed14.10.202013:00 - 14:30 TUWEL/ZoomLecture
Mon19.10.202011:00 - 12:30 TUWEL/ZoomLecture
Wed21.10.202013:00 - 14:30 TUWEL/ZoomLecture
Wed28.10.202013:00 - 14:30 TUWEL/ZoomLecture
Wed04.11.202013:00 - 14:30 TUWEL/ZoomLecture
Mon09.11.202011:00 - 12:30 TUWEL/ZoomLecture
Wed11.11.202013:00 - 14:30 TUWEL/ZoomLecture
Mon16.11.202011:00 - 12:30 TUWEL/ZoomLecture
Wed18.11.202013:00 - 14:30 TUWEL/ZoomLecture
Mon23.11.202011:00 - 12:30 TUWEL/ZoomLecture
Wed25.11.202013:00 - 14:30 TUWEL/ZoomLecture
Mon30.11.202011:00 - 12:30 TUWEL/ZoomLecture
Wed02.12.202013:00 - 14:30 TUWEL/ZoomLecture
Mon07.12.202011:00 - 12:30 TUWEL/ZoomLecture
Wed09.12.202013:00 - 14:30 TUWEL/ZoomLecture
Mon14.12.202011:00 - 12:30 TUWEL/ZoomLecture
Wed16.12.202013:00 - 14:30 TUWEL/ZoomLecture

Examination modalities

Written exam

Exams

DayTimeDateRoomMode of examinationApplication timeApplication modeExam
Wed13:00 - 15:0030.06.2021 TUWEL/Zoomwritten01.06.2021 08:00 - 28.06.2021 08:00TISSSH Stefan Hetzl

Course registration

Begin End Deregistration end
05.10.2020 09:30

Curricula

Study CodeSemesterPrecon.Info
033 201 Technical Mathematics 5. Semester

Literature

Es wird ein Skriptum zu Verfügung gestellt werden. Als ergänzende Literatur können empfohlen werden:

  1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press, 3rd edition, 2009
  2. Jon M. Kleinberg and Éva Tardos. Algorithm design. Addison-Wesley, 2006
  3. Markus Nebel. Entwurf und Analyse von Algorithmen. Springer Vieweg, 2012
  4. Thomas Ottmann and Peter Widmayer. Algorithmen und Datenstrukturen, 5. Auflage.
    Spektrum Akademischer Verlag, 2012
  5. Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani. Algorithms. McGraw-
    Hill, 2008

Previous knowledge

Basic mathematical knowledge (Analysis 1, Linear Algebra and Geometry 1) and basic programming experience (Introduction to Programming).

 

Accompanying courses

Language

German