NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 3 results Save | Export
Peer reviewed Peer reviewed
PDF on ERIC Download full text
Juraj Hromkovic; Regula Lacher – Informatics in Education, 2025
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…
Descriptors: Algorithms, Computer Science Education, High School Students, Teaching Methods
Peer reviewed Peer reviewed
Direct linkDirect link
Paul Mayer; Rich Baraniuk – ACM Transactions on Computing Education, 2025
It is argued that logic, and in particular mathematical logic, should play a key role in the undergraduate curriculum for students in the computing fields, which include electrical engineering (EE), computer engineering (CE), and computer science (CS). This is based on (1) the history of the field of computing and its close ties with logic, (2)…
Descriptors: Teaching Methods, Logical Thinking, Computer Science Education, Engineering Education
Peer reviewed Peer reviewed
Direct linkDirect link
Manuel B. Garcia – Education and Information Technologies, 2025
The global shortage of skilled programmers remains a persistent challenge. High dropout rates in introductory programming courses pose a significant obstacle to graduation. Previous studies highlighted learning difficulties in programming students, but their specific weaknesses remained unclear. This gap exists due to the predominant focus on the…
Descriptors: Programming, Introductory Courses, Computer Science Education, Mastery Learning