Abstract
Engagement of students plays a crucial part in education, even if they are gifted children. We know a success story: the extracurricular mathematics camps of Lajos Pósa for talented teenagers in Hungary. The key to that success is the excellently engineered network of problems that guide students through discovering the world of higher level mathematics. It would be a novel approach to teach computer programming and algorithms in a similar way. In this paper we attempt to design a network of problems selected specifically for discovery learning of algorithms and data structures from beginner to advanced level, targeted for secondary and high school talented students. This could serve as the curriculum for extra classes or camps conducted with the problem-based teaching method we describe.
Highlights
There is a unique system for mathematics talent education in Hungary, led by mathematician Lajos Pósa and his students
We focus on the core programming skills by teaching algorithmic programming from the beginner to the highest level
Algorithmic programming involves dealing with well-defined problems to which the solution is an algorithm that calculates the desired output from the given input, and the program is a way of expressing this algorithm that allows executing and verifying the solution on a computer
Summary
There is a unique system for mathematics talent education in Hungary, led by mathematician Lajos Pósa and his students. The core element of this system is the series of camps in which gifted pupils can explore mathematics with inquiry-based learning [1]. It is the author’s goal to establish a similar initiative in the field of computer science. To use them for our educational goals, we need to organize these materials and exercises in such a way that enables learning through a series of problemsolving In this unit, we introduce some basic algorithmic patterns that are necessary as building blocks of further, more complex algorithms. Queries About Less or Equal Elements Balanced Parentheses, 8 Queens problem M - Nem kifizethető címlet (Unpayable Amount), M - Bélyeg (Stamps), SPOJ - KNAPSACK.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
