On Some Entertaining Applications of the Concept of Set in Computer Science Course
Krasimir Yordzhev, Hristina Kostadinova

TL;DR
This paper explores engaging programming education by using entertaining examples like Sudoku puzzles to demonstrate data structures and language features, enhancing learning through practical applications.
Contribution
It introduces a novel approach of using Sudoku puzzles as educational tools to illustrate set theory and programming concepts in computer science courses.
Findings
Sudoku-based algorithms effectively demonstrate set operations.
Using puzzles increases student engagement and understanding.
Practical examples improve comprehension of data structures.
Abstract
Some aspects of programming education are examined in this work. It is emphasised, based on the entertainment value, the most appropriate examples are chosen to demonstrate the different language constructions and data structures. Such an example is the demonstrated algorithm for solving the widespread nowadays "Sudoku" puzzle. This is made, because of the connection with the term set and putting it into practice in the programming. Using the so built program there are solved some combinatorial problems, connected to the Sudoku matrices. Key words: Education in programming, programming languages, data structures, set, Sudoku matrix, Sudoku puzzle.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
