Upon completion of this course the student is able to:
- write, design and analyze basic recursive procedures in a structured way;
- manipulate and analyze basic composed data structures;
- write, design and analyze basic control structures, like conditional statements and loops, and provide a formal proof for the correctness of such constructs.
This course code is only for repeat students who need to re-take the exam from last year.
In this course, the student learns to write and analyze programs. The emphasis lies on acquiring knowledge of- and building comprehension about basic data structures, like lists and binary trees. Students will be introduced to algorithmic principles like while-loops and recursion. We will also dedicate attention to correctness proofs.