Abstract:

A central term in computer science is algorithm. Hence it is necessary that undergraduate students in computer science get deep knowledge in popular algorithms. The choice of didactical approaches can influence the success of learners.

Within this contribution we define the term algorithm and we state some important algorithms and algorithmic ideas by reviewing popular current textbooks as well as by analyzing current module descriptions. Further, we identify some fundamental skills about algorithms that should be learned by undergraduate students. Beside learning and understanding the algorithm itself it is also important to keep the main idea, to know the pros and cons or to compare the algorithm with other solutions to the problem. The sum of all these skills we call algorithmic thinking.

Then we describe several didactical approaches for teaching algorithms. These approaches should cover classical practice like blackboards as well as current ways of proceeding like Power Point. Moreover, upcoming resp. future roads like using smart boards or the application of the inverted classroom strategy will be considered. As a conclusion, we try to evaluate how well different skills can be fulfilled by each approach.

The paper concludes with a summary and an outlook.

Keywords:

Higher Education, Undergraduate, Computer Science, Algorithm.