Algorithms and Data Structures 1 CS

Course Algorithms and Data Structures 1 CS
Type VO, UE
Lecturer Ferscha (VO)
Gruenberger (UE G1, UE G2, UE G3, UE G4, UE G5)
Course-Id 340.100 (VO)
340.110 (UE G1)
340.111 (UE G2)
340.112 (UE G3)
340.113 (UE G4)
340.114 (UE G5)
Hours/week 2 (VO)
1 (UE G1, UE G2, UE G3, UE G4, UE G5)
Target audience Students of Computer Science in the second term
Objectives Students are able to think algorithmically. They know the basic static and dynamic data structures, the most important sorting and search algorithms, and the concepts of recursion and random numbers. Furthermore, they are able to analyze the complexity of algorithms with respect to runtime and memory requirements.

In the exercise, students apply the topics presented in the lecture in practice by designing and implementing algorithms in Java.

  • Complexity
  • Lists/Stacks/Queues
  • Recursion
  • Backtracking
  • Trees
  • Heaps, Priority Queues
  • Sorting
  • Digital Sorting
  • Strings and Patterns
  • Random Numbers
  • Randomized Algorithms

Criteria for evaluation VL: Exam at the end of term.
UE: Assessment of weekly assignments.
Study material All material will be available in the course section in Moodle. Additional literature will be announced in the course.