D&A -- Learning Objectives Week 1
---------------------------------
students
* learn to know the notions of "Problem", "Problem Instance" and "Algorithm".
* understand the employed RAM model of computation, and learn how algorithms, pseudo-code and the computation model relate to programs, programming language and computers
* understand asymptotic runtime notation O, Omega and Theta, and the relationship to algorithms, they can compare and classify different running times.
* know how to derive the asymptotic running time of simple programs with loops and recursion.
* see first Divide-&-Conquer examples and recurrence equations.
* understand how to solve simple recurrence equations with recurrence trees and substition. They know how to prove a closed form using mathematical induction.
* see first examples of correctness proofs using invariants and induction.