Nothing Special   »   [go: up one dir, main page]

Skip to main content

Problem Generalization for Designing Recursive Algorithms

  • Conference paper
  • First Online:
The 11th International Conference on EUropean Transnational Educational (ICEUTE 2020) (ICEUTE 2020)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1266))

Included in the following conference series:

Abstract

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 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Algoritmos iterativos y recursivos. https://drive.google.com/file/d/1qF7eDq0a7MvrFTbfWVJF7qKb9LZTrezb/view. Accessed 21 Jan 2020

  2. Knuth, D.E.: The Art of Computer Programming, Volume 3, Searching and Sorting. Addison-Wisley, Reading, MA (1973)

    MATH  Google Scholar 

  3. Ljung, L., Söderström, T.: Theory and Practice of Recursive Identification. MIT press, Cambridge (1983)

    MATH  Google Scholar 

  4. Shih-hua, H.: Theory of recursive algorithms I. Sci. Sinica 9, 843–875 (1960)

    MathSciNet  Google Scholar 

  5. Vorobiev, N.N.: Fibonacci numbers. Birkhäuser (2012)

    Google Scholar 

  6. Wing, J.M.: Computational thinking. Commun. ACM 49(3), 33–35 (2006). https://doi.org/10.1145/1118178.1118215

    Article  Google Scholar 

  7. Zapata-Ros, M.: Pensamiento computacional: Una nueva alfabetización digital. Revista de Educación a Distancia (RED) (September 2015). https://doi.org/10.6018/red/46/4

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Diana Borrego .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Borrego, D., Barba, I., Toro, M., Del Valle, C. (2021). Problem Generalization for Designing Recursive Algorithms. In: Herrero, Á., Cambra, C., Urda, D., Sedano, J., Quintián, H., Corchado, E. (eds) The 11th International Conference on EUropean Transnational Educational (ICEUTE 2020). ICEUTE 2020. Advances in Intelligent Systems and Computing, vol 1266. Springer, Cham. https://doi.org/10.1007/978-3-030-57799-5_40

Download citation

Publish with us

Policies and ethics