Descriptor
Author
| Gal-Ezer, Judith | 1 |
| Gruska, Jozef | 1 |
| Lichtenstein, Orna | 1 |
| Sanders, Ian | 1 |
| Sorkin, Sylvia J. | 1 |
| Wilcocks, Derek | 1 |
Publication Type
| Journal Articles | 4 |
| Opinion Papers | 4 |
| Guides - Classroom - Teacher | 2 |
| Reports - Descriptive | 2 |
| Computer Programs | 1 |
| Information Analyses | 1 |
Education Level
Audience
| Practitioners | 1 |
| Teachers | 1 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedWilcocks, Derek; Sanders, Ian – Computers & Education, 1994
Discussion of how to teach programming skills to novice programmers focuses on the use of a program animator that uses a copies model of recursion to teach the recursive function. Various mental models are reviewed; testing the recursion animator is described; and possibilities for further research are suggested. (12 references) (LRW)
Descriptors: Algorithms, Computer Assisted Instruction, Computer Science Education, Courseware
Peer reviewedGruska, Jozef – Education and Computing, 1993
Describes shortcomings of computer science/engineering education and explains a new focus on informatics. Highlights include simulation, visualization, algorithmization, design of information processing models, parallel computing, a history of informatics, informatics versus physics and mathematics, and implications for education. (51 references)…
Descriptors: Algorithms, Computer Science Education, Computer Simulation, Higher Education
Peer reviewedGal-Ezer, Judith; Lichtenstein, Orna – Mathematics and Computer Education, 1997
Shows by means of a mathematical example how algorithmic thinking and mathematical thinking complement each other. An algorithmic approach can lead to questions that deepen the understanding of mathematics material. (DDR)
Descriptors: Algorithms, Case Studies, Cognitive Processes, Computer Science Education
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


