Abstract:

This work places in the subject of Computer Science taught in the first course in the degree in Civil Engineering and in Mines and Energy Technology Engineering at the School of Engineering of Bilbao (UPV/EHU). This subject deals with data structure, algorithm design and implementation using mathematical software. Students also learn to analyze and design efficient algorithms, because sometimes not only it is important to design an algorithm that enables solving a problem, but also it is crucial to have an efficient resolution. Efficiency is related to the time of execution or to the space needed to develop the task. In this work some preliminaries about the dynamic programming technique will be given and diverse known problems will be solved using this technique and others (such as the recurrence relations). Computational times will be compared seeing that the dynamic approach stands out from other techniques. The aim of the work is enlighten students about the importance of dynamic programming especially when solving complex problems.

Keywords:

Algorithms, dynamic programming, efficiency.