Ayuda
Ir al contenido

Dialnet


Problem Generalization for Designing Recursive Algorithms

    1. [1] Universidad de Sevilla

      Universidad de Sevilla

      Sevilla, España

  • Localización: The 11th International Conference on EUropean Transnational Educational: (ICEUTE 2020) / Álvaro Herrero Cosío (ed. lit.), Carlos Cambra Baseca (ed. lit.), Daniel Urda Muñoz (ed. lit.), Javier Sedano Franco (ed. lit.), Héctor Quintián Pardo (ed. lit.), Emilio Santiago Corchado Rodríguez (ed. lit.), 2021, ISBN 3-030-57798-8, págs. 388-398
  • Idioma: inglés
  • Texto completo no disponible (Saber más ...)
  • Resumen
    • This paper focuses on the difficulty for university students to acquire, within computational thinking, the skills to solve certain problems through recursion. The acquisition of this type of reasoning is essential to understand the different problem solving techniques that are based on recursive algorithms, such as divide and conquer or dynamic programming. Therefore, first, the generalizationof 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.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus

Opciones de compartir

Opciones de entorno