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

Skip to main content

Abstract

Computer Science degrees are often seen as challenging by students, especially in what concerns subjects such as programming, data structures or algorithms. Many reasons can be pointed out for this, some of which related to the abstract nature of these subjects and the lack of previous related knowledge by the students. In this paper we tackle this challenge using gamification in the teaching/learning process, with two main goals in mind. The first is to increase the intrinsic motivation of students to learn, by making the whole process more fun, enjoyable and competitive. The second is to facilitate the learning process by providing intuitive tools for the visualization of data structures and algorithmic output, together with a tool for automated assessment that decreases the dependence on the teacher and allows them to work more autonomously. We validated this approach over the course of three academic years in a Computer Science degree of the Polytechnic of Porto, Portugal, through the use of a questionnaire. Results show that the effects of using games and game elements have a generally positive effect on motivation and on the overall learning process.

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 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.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. Ahmad, A., Zeshan, F., Khan, M.S., Marriam, R., Ali, A., Samreen, A.: The impact of gamification on learning outcomes of computer science majors. ACM Trans. Comput. Educ. (TOCE) 20(2), 1–25 (2020)

    Article  Google Scholar 

  2. Aho Alfred, V., et al.: Data Structures and Algorithms. Addison-Wesley, Boston (1983)

    MATH  Google Scholar 

  3. Biernat, M.J.: Teaching tools for data structures and algorithms. ACM SIGCSE Bull. 25(4), 9–12 (1993)

    Article  Google Scholar 

  4. Carneiro, D., Barbosa, R.: A framework for online education in computer science degrees with a focus on motivation. In: De la Prieta, F., et al. (eds.) MIS4TEL 2021. LNNS, vol. 326, pp. 137–146. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-86618-1_14

    Chapter  Google Scholar 

  5. Carneiro, D.R., Silva, R.J.: Game elements, motivation and programming learning: a case study. In: First International Computer Programming Education Conference (ICPEC 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2020)

    Google Scholar 

  6. Dijkstra, E.W., et al.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  7. Draft, S.: Computer Science Curricula 2013. ACM and IEEE Computer Society, Incorporated, New York (2013)

    Google Scholar 

  8. Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)

    Article  Google Scholar 

  9. Gross, J.L., Yellen, J., Anderson, M.: Graph Theory and Its Applications. Chapman and Hall/CRC, London (2018)

    Book  MATH  Google Scholar 

  10. Ibanez, M.B., Di-Serio, A., Delgado-Kloos, C.: Gamification for engaging computer science students in learning activities: a case study. IEEE Trans. Learn. Technol. 7(3), 291–301 (2014)

    Article  Google Scholar 

  11. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48–50 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  12. Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389–1401 (1957)

    Article  Google Scholar 

  13. Siklóssy, L., Rich, A., Marinov, V.: Breadth-first search: some surprising results. Artif. Intell. 4(1), 1–27 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  14. Su, S., Zhang, E., Denny, P., Giacaman, N.: A game-based approach for teaching algorithms and data structures using visualizations. In: Proceedings of the 52nd ACM Technical Symposium on Computer Science Education, pp. 1128–1134 (2021)

    Google Scholar 

  15. Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  16. Vallerand, R.J., Pelletier, L.G., Blais, M.R., Briere, N.M., Senecal, C., Vallieres, E.F.: The academic motivation scale: a measure of intrinsic, extrinsic, and amotivation in education. Educ. Psychol. Measur. 52(4), 1003–1017 (1992)

    Article  Google Scholar 

Download references

Acknowledgments

This work has been supported by national funds through FCT - Fundação para a Ciência e Tecnologia through project UIDB/04728/2020.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Davide Carneiro .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 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

Carneiro, D., Carvalho, M. (2023). Teaching Data Structures and Algorithms Through Games. In: Kubincová, Z., Melonio, A., Durães, D., Rua Carneiro, D., Rizvi, M., Lancia, L. (eds) Methodologies and Intelligent Systems for Technology Enhanced Learning, Workshops, 12th International Conference. MIS4TEL 2022. Lecture Notes in Networks and Systems, vol 538. Springer, Cham. https://doi.org/10.1007/978-3-031-20257-5_1

Download citation

Publish with us

Policies and ethics