NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 6 results Save | Export
Peer reviewed Peer reviewed
PDF on ERIC Download full text
Ginat, David – Informatics in Education, 2021
The notion of algorithm may be perceived in different levels of abstraction. In the lower levels it is an operational set of instructions. In higher levels it may be viewed as an object with properties, solving a problem with characteristics. Novices mostly relate to the lower levels. Yet, higher levels are very relevant for them as well. We…
Descriptors: Problem Solving, Computation, Comparative Analysis, Competence
Peer reviewed Peer reviewed
Direct linkDirect link
Armoni, Michal; Ginat, David – Computer Science Education, 2008
Reversing is the notion of thinking or working in reverse. Computer science textbooks and tutors recognize it primarily in the form of recursion. However, recursion is only one form of reversing. Reversing appears in the computer science curriculum in many other forms, at various intellectual levels, in a variety of fundamental courses. As such,…
Descriptors: Computer Science Education, Problem Solving, Computer Science, Models
Peer reviewed Peer reviewed
Direct linkDirect link
Ginat, David – Journal of Computers in Mathematics and Science Teaching, 2005
Sometimes, if you do not begin at the end, you end at the beginning. This problem-solving phenomenon, in the realm of computer science (CS), is the subject of this paper. Beginning at the end yields a "working backwards" approach, opposite to that of "working forwards." One might expect 3rd year CS students to be aware of and effectively utilize…
Descriptors: Computer Science, Problem Solving, Heuristics, Preservice Teachers
Ginat, David – JCSE Online, 2002
Discusses algorithmic problem solving in computer science education, particularly algorithmic insight, and focuses on the relevance and effectiveness of the heuristic simplifying constraints which involves simplification of a given problem to a problem in which constraints are imposed on the input data. Presents three examples involving…
Descriptors: Algorithms, Computer Science Education, Heuristics, Mathematical Formulas
Peer reviewed Peer reviewed
Direct linkDirect link
Ginat, David – Computer Science Education, 2004
The paper presents a study of novice difficulties with range conceptions in loop design. CS2 students were asked to solve four related enumeration tasks, which required various loop boundary specifications. The student solutions varied considerably in conciseness and efficiency. The solution diversity reveals significant differences in range…
Descriptors: Novices, Computer Science Education, Grade 12, Programming
Peer reviewed Peer reviewed
Direct linkDirect link
Ginat, David – Mathematics and Computer Education, 2006
In this paper, the author aims to offer an elaboration of simple, yet powerful, mathematical patterns through mathematical games. Mathematical games may serve as colorful instructional tools for teachers and textbooks, and may raise students' motivation and intuition. Patterns are fundamental in mathematics and computer science. In the case of…
Descriptors: Student Motivation, Computer Science, Educational Games, Mathematical Concepts