After completing the course, the student shall know and be able to use commonly occurring data structures, be able to analyze code and algorithms considering run time complexity and know different sorting algorithms. To fulfill the goal, the student shall be able to:
– explain differences in different categories of run time complexity
– explain the concept of recursion
– calculate ”big-Oh” for given code sections and described algorithms
– explain differences in level of abstraction for data types, structures and functions
– explain different categories of algorithms
– explain and use the most common abstract data types
– explain and use the most common search/ sorting algorithms