Principles of Computer Programming

Description

This course offers methods to solve small and medium sized problems an to implement them in a higher programming language. The emphasis is on the aspect of problem solving, not the programming language itself. Targets: Students should be able to analyse a problem and to propose appropriate data stuctures to represent the problem data. Students should be able to develop solutions for algorithmic problems using the principles of stepwise refinement and the divide-and-conquer principle. Students should be able to implement both iterative and recursive algorithms, and should be able to organise their methods using procedural abstraction. Students should be able to reason about the correctness and finiteness of simple algoritms. Students should have insight in different sorting strategies. Students should be able to grasp the time and space complexity of algorithms.