Undergraduate Program Status
Elective | Data Science - Specialization |
Course Level:
Bachelor's
Campus:
Vienna
Course Open to:
Students on-site
Term:
Winter
Host Unit:
Instructor:
TBD
US Credits:
2
ECTS Credits:
4
Course Description:
This course introduces advanced data structures and efficient algorithms on them, comprising Binary Search Trees, Red/Black Trees, Dynamic Programming, Amortized Analysis, Maximum Flow, (Fibonacci) Heaps, Number theoretic algorithms + RSA, and Neural Networks.
Learning Outcomes:
On successful completion of the course students will be able to understand and analyse some advanced data structures, understand the implementation and complexity analysis of fundamental algorithms, will have been exposed to algorithmic issues in a variety of areas, including linear programming and game-theory and will have some familiarity with randomised algorithms and approximation algorithms.
Assessment:
Homework (10%), Mid-term (40%), Final (50%)