How to Teach Problem Solving and Algorithm Design in High Schools by Constructive Induction or How to Reach True Competences in Informatics Education
Saved in:
| Title: | How to Teach Problem Solving and Algorithm Design in High Schools by Constructive Induction or How to Reach True Competences in Informatics Education |
|---|---|
| Language: | English |
| Authors: | Juraj Hromkovic, Regula Lacher |
| Source: | Informatics in Education. 2025 24(1):99-144. |
| Availability: | Vilnius University Institute of Mathematics and Informatics, Lithuanian Academy of Sciences. Akademjos str. 4, Vilnius LT 08663 Lithuania. Tel: +37-5-21-09300; Fax: +37-5-27-29209; e-mail: info@mii.vu.lt; Web site: https://infedu.vu.lt/journal/INFEDU |
| Peer Reviewed: | Y |
| Page Count: | 46 |
| Publication Date: | 2025 |
| Document Type: | Journal Articles Reports - Descriptive |
| Education Level: | High Schools Secondary Education |
| Descriptors: | Algorithms, Computer Science Education, High School Students, Teaching Methods, Problem Solving, Logical Thinking, Instructional Design, Lesson Plans |
| ISSN: | 1648-5831 2335-8971 |
| Abstract: | The design of algorithms is one of the hardest topics of high school computer science. This is mainly due to the universality of algorithms as solution methods that guarantee the calculation of a correct solution for all potentially infinitely many instances of an algorithmic problem. The goal of this paper is to present a comprehensible and robust algorithms design strategy called "constructive induction" that enables high school students to discover solution methods for a large variety of algorithmic problems. The concept of constructive induction is based on searching for a universal method for solving any instance of an algorithmic problem when solutions of smaller problem instances are available. In general, our approach strengthens learners in problem solving and their ability to use and develop abstract representations. Here we present a large collection of tasks that can be solved by constructive induction and show how to use this method to teach algorithm design. For some representative algorithmic tasks, we offer a detailed design of lessons in high school classes. We explain how our implementation of teaching in classrooms supports critical thinking, sustain ability of acquired knowledge, problem solving, and the ability to abstract, and so contributes to reaching deep competences in algorithmic thinking. |
| Abstractor: | As Provided |
| Entry Date: | 2025 |
| Accession Number: | EJ1468123 |
| Database: | ERIC |
| FullText | Links: – Type: pdflink Url: https://content.ebscohost.com/cds/retrieve?content=AQICAHj0k_4E0hTGH8RJwT4gCJyBsGNe_WN95AvKlDbXJGqwxwEgu1oHxwh24MXQ3UKMOlZWAAAA4zCB4AYJKoZIhvcNAQcGoIHSMIHPAgEAMIHJBgkqhkiG9w0BBwEwHgYJYIZIAWUDBAEuMBEEDMYkmm5xDH-O-2dCTwIBEICBm0jPffdYiDscIss4C1OEWib7HzwSGO44DzU8Q0kukPVuqq6NeTLPh4f6DG2M582-C6P51ZXGOnPk_JHzw5IAEcbm2OJQHwAWAk9lgsIfr-lUJ76tGO8-5YCfNWZRLNhG_Pyvxv5nqdkMOg8jA1icmecTWjjbob03zhNJKqfwhqhskJ5AvK2j6jk30PgLq4SE0NVh45sbDoVWkeZT Text: Availability: 0 CustomLinks: – Url: https://eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=EJ1468123 Name: ERIC Full Text Category: fullText Text: Full Text from ERIC |
|---|---|
| Header | DbId: eric DbLabel: ERIC An: EJ1468123 AccessLevel: 3 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: How to Teach Problem Solving and Algorithm Design in High Schools by Constructive Induction or How to Reach True Competences in Informatics Education – Name: Language Label: Language Group: Lang Data: English – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Juraj+Hromkovic%22">Juraj Hromkovic</searchLink><br /><searchLink fieldCode="AR" term="%22Regula+Lacher%22">Regula Lacher</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="SO" term="%22Informatics+in+Education%22"><i>Informatics in Education</i></searchLink>. 2025 24(1):99-144. – Name: Avail Label: Availability Group: Avail Data: Vilnius University Institute of Mathematics and Informatics, Lithuanian Academy of Sciences. Akademjos str. 4, Vilnius LT 08663 Lithuania. Tel: +37-5-21-09300; Fax: +37-5-27-29209; e-mail: info@mii.vu.lt; Web site: https://infedu.vu.lt/journal/INFEDU – Name: PeerReviewed Label: Peer Reviewed Group: SrcInfo Data: Y – Name: Pages Label: Page Count Group: Src Data: 46 – Name: DatePubCY Label: Publication Date Group: Date Data: 2025 – Name: TypeDocument Label: Document Type Group: TypDoc Data: Journal Articles<br />Reports - Descriptive – Name: Audience Label: Education Level Group: Audnce Data: <searchLink fieldCode="EL" term="%22High+Schools%22">High Schools</searchLink><br /><searchLink fieldCode="EL" term="%22Secondary+Education%22">Secondary Education</searchLink> – Name: Subject Label: Descriptors Group: Su Data: <searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+Science+Education%22">Computer Science Education</searchLink><br /><searchLink fieldCode="DE" term="%22High+School+Students%22">High School Students</searchLink><br /><searchLink fieldCode="DE" term="%22Teaching+Methods%22">Teaching Methods</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+Solving%22">Problem Solving</searchLink><br /><searchLink fieldCode="DE" term="%22Logical+Thinking%22">Logical Thinking</searchLink><br /><searchLink fieldCode="DE" term="%22Instructional+Design%22">Instructional Design</searchLink><br /><searchLink fieldCode="DE" term="%22Lesson+Plans%22">Lesson Plans</searchLink> – Name: ISSN Label: ISSN Group: ISSN Data: 1648-5831<br />2335-8971 – Name: Abstract Label: Abstract Group: Ab Data: The design of algorithms is one of the hardest topics of high school computer science. This is mainly due to the universality of algorithms as solution methods that guarantee the calculation of a correct solution for all potentially infinitely many instances of an algorithmic problem. The goal of this paper is to present a comprehensible and robust algorithms design strategy called "constructive induction" that enables high school students to discover solution methods for a large variety of algorithmic problems. The concept of constructive induction is based on searching for a universal method for solving any instance of an algorithmic problem when solutions of smaller problem instances are available. In general, our approach strengthens learners in problem solving and their ability to use and develop abstract representations. Here we present a large collection of tasks that can be solved by constructive induction and show how to use this method to teach algorithm design. For some representative algorithmic tasks, we offer a detailed design of lessons in high school classes. We explain how our implementation of teaching in classrooms supports critical thinking, sustain ability of acquired knowledge, problem solving, and the ability to abstract, and so contributes to reaching deep competences in algorithmic thinking. – Name: AbstractInfo Label: Abstractor Group: Ab Data: As Provided – Name: DateEntry Label: Entry Date Group: Date Data: 2025 – Name: AN Label: Accession Number Group: ID Data: EJ1468123 |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=eric&AN=EJ1468123 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English PhysicalDescription: Pagination: PageCount: 46 StartPage: 99 Subjects: – SubjectFull: Algorithms Type: general – SubjectFull: Computer Science Education Type: general – SubjectFull: High School Students Type: general – SubjectFull: Teaching Methods Type: general – SubjectFull: Problem Solving Type: general – SubjectFull: Logical Thinking Type: general – SubjectFull: Instructional Design Type: general – SubjectFull: Lesson Plans Type: general Titles: – TitleFull: How to Teach Problem Solving and Algorithm Design in High Schools by Constructive Induction or How to Reach True Competences in Informatics Education Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Juraj Hromkovic – PersonEntity: Name: NameFull: Regula Lacher IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 1648-5831 – Type: issn-electronic Value: 2335-8971 Numbering: – Type: volume Value: 24 – Type: issue Value: 1 Titles: – TitleFull: Informatics in Education Type: main |
| ResultId | 1 |