Publication Date
| In 2026 | 0 |
| Since 2025 | 1 |
| Since 2022 (last 5 years) | 1 |
| Since 2017 (last 10 years) | 1 |
| Since 2007 (last 20 years) | 1 |
Descriptor
Author
| Deise Monquelate Arndt | 1 |
| Jean Carlo Rossa Hauck | 1 |
| Kalman, Dan | 1 |
| Magel, E. Terry | 1 |
| Ramon Mayor Martins | 1 |
| Sorkin, Sylvia J. | 1 |
Publication Type
| Journal Articles | 4 |
| Guides - Classroom - Teacher | 3 |
| Computer Programs | 1 |
| Information Analyses | 1 |
| Opinion Papers | 1 |
Education Level
| Elementary Secondary Education | 1 |
Audience
| Teachers | 4 |
| Practitioners | 3 |
| Researchers | 1 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Deise Monquelate Arndt; Ramon Mayor Martins; Jean Carlo Rossa Hauck – Informatics in Education, 2025
Critical thinking is a fundamental skill for 21st-century citizens, and it should be promoted from elementary school and developed in computing education. However, assessing the development of critical thinking in educational contexts presents unique challenges. In this study, a systematic mapping was carried out to investigate how to assess the…
Descriptors: Critical Thinking, Elementary Secondary Education, Computer Science Education, 21st Century Skills
Magel, E. Terry – Computing Teacher, 1989
Discusses problems associated with teaching non-recursive binary searching in computer language classes, and describes a teacher-directed dialog based on dictionary use that helps students use their previous searching experiences to conceptualize the binary search process. Algorithmic development is discussed and appropriate classroom discussion…
Descriptors: Algorithms, Computer Science Education, Concept Formation, Dialogs (Language)
Peer reviewedSorkin, Sylvia J. – Mathematics and Computer Education, 1991
Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)
Descriptors: Algorithms, College Mathematics, Computer Science Education, Computer Software
Peer reviewedKalman, Dan – Mathematics Magazine, 1990
Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)
Descriptors: Algebra, Algorithms, College Mathematics, Computer Science


