Publication Date
In 2025 | 0 |
Since 2024 | 0 |
Since 2021 (last 5 years) | 1 |
Since 2016 (last 10 years) | 2 |
Since 2006 (last 20 years) | 3 |
Descriptor
Source
ACM Transactions on Computing… | 3 |
Author
Aivaloglou, Efthimia | 1 |
Edwards, Stephen H. | 1 |
Elmongui, Hicham G. | 1 |
Ernst, Jeremy V. | 1 |
Fletcher, George | 1 |
Hamouda, Sally | 1 |
Miedema, Daphne | 1 |
Shaffer, Clifford A. | 1 |
Velazquez-Iturbide, J. Angel | 1 |
Publication Type
Journal Articles | 3 |
Reports - Research | 3 |
Education Level
Higher Education | 3 |
Postsecondary Education | 3 |
Audience
Location
Belgium | 1 |
Chile | 1 |
France | 1 |
Germany | 1 |
Netherlands | 1 |
Poland | 1 |
Singapore | 1 |
United Kingdom | 1 |
United States | 1 |
Virginia | 1 |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Miedema, Daphne; Fletcher, George; Aivaloglou, Efthimia – ACM Transactions on Computing Education, 2023
Prior studies in the Computer Science education literature have illustrated that novices make many mistakes in composing SQL queries. Query formulation proves to be difficult for students. Only recently, some headway was made towards understanding why SQL leads to so many mistakes, by uncovering student misconceptions. In this article, we shed new…
Descriptors: Computer Science Education, Novices, Misconceptions, Programming Languages
Hamouda, Sally; Edwards, Stephen H.; Elmongui, Hicham G.; Ernst, Jeremy V.; Shaffer, Clifford A. – ACM Transactions on Computing Education, 2019
Recursion is one of the most important and hardest topics in lower division computer science courses. As it is an advanced programming skill, the best way to learn it is through targeted practice exercises. But the best practice problems are time consuming to manually grade by an instructor. As a consequence, students historically have completed…
Descriptors: Computer Science Education, Programming, Instructional Effectiveness, Difficulty Level
Velazquez-Iturbide, J. Angel – ACM Transactions on Computing Education, 2013
Greedy algorithms constitute an apparently simple algorithm design technique, but its learning goals are not simple to achieve.We present a didacticmethod aimed at promoting active learning of greedy algorithms. The method is focused on the concept of selection function, and is based on explicit learning goals. It mainly consists of an…
Descriptors: Mathematics, Experimental Teaching, Teaching Methods, Active Learning