Contents

• foundations of computability:
  • universal register machines
  • syntax and operational semantics of imperative programming languages
• formal methods for the specification and verification of imperative programs:
  • assertions,
  • Hoare-calculus, partial correctness, termination
• imperative and object-oriented programming concepts (Java):
  • primitive and composite data types,
  • methords (procedures and functions). calling conventions, overloading
  • modules, classes, objects
  • class hierarchies, inheritance, polymorphism
  • abstract classes, interfaces
• programming methods:
  • stepwise refinement
  • divide and conquer
  • backtracking
• analysis of time and space requirements:
  • O-notation
  • recursion and iteration
  • analysis of algorithms for sorting and searching
  • algorithms, data structures, data abstraction

• Concepts of Programming Languages, Robert Sebesta, Pearson Education , 10th Edition, 2012, ISBN: 0131395319
• Data Structures & Problem Solving Using Java, Mark Allen Weiss, Addison Wesley, 4. Auflage, 2010, ISBN: 0-321-54140-5
• Cormen, Leiserson, Rivest: Introduction to Algorithms, 3. Auflage 2009,
• Bundle of algorithms in java, third edition, parts 1-5. Sedgewick Robert und Michael Schidlowsky. Addison-Wesley Longman, Amsterdam. 2003.

Prerequisites

background as taught in the class "Functional Programming".

Please also sign up for the class in our KVV.