Institution Department of Computer Science, Hamburg University of Applied Sciences
Degree program B.Sc. Applied Computer Science (B-AI)
Semester Winter semester 2010/11
Course Algorithms and Data Structures (AD)
Course type lecture and practical training
Lecturer Prof. Dr. Friedrich Esser
Topics
  • Programming paradigms, functional programming, dynamic/static type system
  • Data types, Widening/Narrowing, API, Abstract Data Types (ADT)
  • Recursion, Tail recursion, Partial functions, Referential transparency, side effects, (im)mutability
  • Big O notation, Complexity classes, Complexity analysis, Running time vs. Memory, P / NP
  • Co-/Contra-/Invariance, Higher-order functions, Anonymous functions, Heuristics
  • Orders, Comparable, Iterable, Traversing, Sorting: stable, Quick sort, Insertion sort, Merge sort, Heap sort
  • Data Structures: Arrays, n-dimensional Arrays, Dynamic Arrays, Linked Lists, Stacks, Queues, Dequeues, Graphs, Trees, Heaps
  • Collection methods (Scala): exists, forall, count, find, sort, filter, partition, map, fold, reduce
Languages Java, (Scala)
Technologies Swing, JGraphX
IDE Eclipse, NetBeans
ECTS Credit Points 6
Examination type written test
Grade(s) 12 LP (2+)
TSP/ACO Screenshot

The folowing applications were developed in Java for the practical training: Interval arithmetic, Multi-interval arithmetic, Job ordering, Traveling Salesman Problem (TSP) with Ant Colony Optimization (ACO), CSV decision trees

Robin C. Ladiges / B-AI / AD

German flag