Universität Wien
Warning! The directory is not yet complete and will be amended until the beginning of the term.

052100 VU Algorithms and Data Structures 2 (2020W)

3.00 ECTS (2.00 SWS), SPL 5 - Informatik und Wirtschaftsinformatik
Continuous assessment of course work
Moodle

Registration/Deregistration

Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).

Details

max. 50 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

Since I am still learning German, please use English for all communications. Also please address me simply by my first name, Sagar; no "Dr.", "Prof.", or "PhD", please!

  • Monday 05.10. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 12.10. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 19.10. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 09.11. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 16.11. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 23.11. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 30.11. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 07.12. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 14.12. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 11.01. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 18.01. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG
  • Monday 25.01. 09:45 - 11:15 Hörsaal 3, Währinger Straße 29 3.OG

Information

Aims, contents and method of the course

Since I am still learning German, please use English for all communications. Also please address me simply by my first name, Sagar; no "Dr.", "Prof.", or "PhD", please!

This course is about proofs related to correctness and running times of algorithms. Specifically, there is absolutely no programming involved; it is a theoretical course. After completing this course successfully, you will have a clear and intuitive understanding of several algorithmic strategies and in turn better computational thinking.

This course will be online. Lectures will be interactive and live-streamed on Moodle using either BigBlueButton or Blackboard Collaborate. Video recording of the lectures will also be available on Moodle.
Contents:
--Proof techniques
--Algorithmic Strategies: Recursive Backtracking, Branch and Bound, Greedy, Dynamic Programming
--Data Structures and Algorithms: Hashing, Pattern Matching, String Algorithms
--Advanced Data Structures, Algorithms, and Analysis: Network Flows and Geometric Algorithms

Assessment and permitted materials

I will update this with more specifics soon, but the assessment will likely involve a combination of class participation, quizzes, homeworks. Depending on the situation, I will either keep a final exam OR a project with presentation followed by an oral exam.

Minimum requirements and assessment criteria

percentage of points grade
>= 89% 1
>= 76% 2
>= 63% 3
>= 50% 4
< 50% 5

Examination topics

Everything covered in the lecture, the slides, uploaded videos, and the reading material.

Reading list

Will be uploaded on Moodle.

Association in the course directory

Last modified: Mo 28.09.2020 11:08