Ponencia
Problem Generalization for Designing Recursive Algorithms
Autor/es | Borrego Núñez, Diana
Barba Rodríguez, Irene Toro Bonilla, Miguel Valle Sevillano, Carmelo del |
Departamento | Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos |
Fecha de publicación | 2020 |
Fecha de depósito | 2022-10-20 |
Publicado en |
|
ISBN/ISSN | 978-3-030-57798-8 2194-5357 |
Resumen | This paper focuses on the difficulty for university students to acquire,
within computational thinking, the skills to solve certain problems through recur sion. The acquisition of this type of reasoning is essential to ... This paper focuses on the difficulty for university students to acquire, within computational thinking, the skills to solve certain problems through recur sion. The acquisition of this type of reasoning is essential to understand the dif ferent problem solving techniques that are based on recursive algorithms, such as divide and conquer or dynamic programming. Therefore, first, the generalization of problems is proposed as a strategy for designing recursive algorithms. As a second step, that generalization is formalized through a specification sheet that contains different fields that correspond to the characteristics that are relevant to solve a problem recursively. |
Cita | Borrego Núñez, D., Barba Rodríguez, I., Toro Bonilla, M. y Valle Sevillano, C.d. (2020). Problem Generalization for Designing Recursive Algorithms. En ICEUTE 2020: 11th International Conference on EUropean Transnational Educational (388-398), Burgos, España: Springer. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Problem Generalization for ... | 225.3Kb | [PDF] | Ver/ | |