Objectives
In the first half of the course, students are familiarized with the growth speed comparison of the most relevant mathematical functions in terms of algorithmics. Then, the execution efficiency of algorithms is analyzed from the point of view of time constraints. After this, students learn the functioning of the most important general sorting and selection algorithms. Also the possibilities of making them more efficient in special cases is considered. The theme of the final part of the course is the characteristics of the most relevant storage and search structures and their possible implementations using different basic data structures.
The course strengthens the following working life skills: creativity, multi-professionalism, problem solving skills, information and communication technology skills and communication skills.
In the first half of the course, students are familiarized with the growth speed comparison of the most relevant mathematical functions in terms of algorithmics. Then, the execution efficiency of algorithms is analyzed from the point of view of time constraints. After this, students learn the functioning of the most important general sorting and selection algorithms. Also the possibilities of making them more efficient in special cases is considered. The theme of the final part of the course is the characteristics of the most relevant storage and search structures and their possible implementations using different basic data structures.
The course strengthens the following working life skills: creativity, multi-professionalism, problem solving skills, information and communication technology skills and communication skills.
- Opettaja
Csaba Raduly-Baka