Transactive discussion during collaborative learning is crucial for building on each other's reasoning and developing problem solving strategies. In a tabletop collaborative learning activity, student actions on the interface can drive their thinking and be used to ground discussions, thus affecting their problem-solving performance and learning.…

This study aims to provide a deeper understanding about the Bebras tasks, which is one of the computational thinking (CT) unplugged activities, in terms of age level, task category, and CT skills. Explanatory sequential mixed method was adopted in the study in order to collect data according to the research questions. The participants of the study…

How set theory, combinatorics, probability, and the study of algorithms can be used in solving two problems is described in detail. Three computer programs are listed. (MNS)

Presents a student module modeling knowledge states and learning skills of students in the field of Newtonian dynamics. Uses data recorded during the exploratory activity in microworlds to infer mental representations concerning the concept of force. A fuzzy algorithm able to follow the cognitive states the student goes through in solving a task…

Topics covered include alternate methods for finding LCM and GCF, imaginative word problems, and a primes-breakdown method of factoring quadratics. (MP)

Presents a developmental taxonomy which promotes sequencing activities to enhance the potential of matching these activities with learner needs and readiness, suggesting that the order commonly found in the classroom needs to be inverted. The proposed taxonomy (story, skill, and algorithm) involves problem-solving emphasis in the classroom. (JN)

A learning pattern designed to help students cut down the amount of memorization needed in learning the basic multiplication facts is suggested and reviewed. (MP)

Four procedures used by children for deriving answers to unknown subtraction facts are described. They are counting forward, counting backward, derivation, and bridging. (MP)

Presented is a method where a quadratic equation is solved and from its roots the eigenvalues and corresponding eigenvectors are determined immediately. Included are the proposition, the procedure, and comments. (KR)

Described is computational geometry which used concepts and results from classical geometry, topology, combinatorics, as well as standard algorithmic techniques such as sorting and searching, graph manipulations, and linear programing. Also included are special techniques and paradigms. (KR)

A computer program named BUGGY is described. The program is designed to duplicate "traditional" student mathematical mistakes; pupils are to identify the nature of the errors the computer makes. (MP)

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)

Algorithmic and investigative approaches to mathematics are compared and discussed. Their mutually contradictory spirit is explored. Examples of the application of each method to a mathematics problem are presented. (CW)

This article, which is organized around a single, well-known algorithm for root extraction, presents a way of incorporating dynamical systems into the teaching of mathematics. Included are sample exercises using complex numbers and the computer where students have the opportunity to do some analysis on this algorithm. (KR)

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)