Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Computer science education (3)
- Computer programming (2)
- Data analysis (2)
- Robotics (2)
- Analysis of algorithms (1)
-
- Bijections (1)
- Computational thinking (1)
- Counting principles (1)
- Discrete mathematics (1)
- Error correction (1)
- Error detection (1)
- Magic (1)
- Modular arithmetic (1)
- Multidimensional representations (1)
- Outreach (1)
- Parity checks (1)
- Permutations (1)
- Pigeonhole principle (1)
- Probability (1)
- Public engagement (1)
- Unplugged activities (1)
Articles 1 - 5 of 5
Full-Text Articles in Computer Sciences
Pythagorean Combinations For Lego Robot Building., Ronald I. Greenberg
Pythagorean Combinations For Lego Robot Building., Ronald I. Greenberg
Ronald Greenberg
This paper provides tips for LEGO robot construction involving bracing or gear meshing along a diagonal using standard Botball kits.
Some Applications Of Sophisticated Mathematics To Randomized Computing, Ronald I. Greenberg
Some Applications Of Sophisticated Mathematics To Randomized Computing, Ronald I. Greenberg
Ronald Greenberg
No abstract provided.
Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg
Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg
Ronald Greenberg
Abstract. This paper can be used in two ways. It can provide reference information for incorporating diagonal elements (for bracing or gear meshing) in educational robots built from standard LEGO kits. Alternatively, it can be used as the basis for an assignment for high school or college students to recreate this information; in the process, students will exercise skills in both computer programming and data analysis. Using the paper in the second way can be an excellent integrative experience to add to an existing course; for example, the Exploring Computer Science high school curriculum concludes with the units “Introduction to …
Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg
Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg
Ronald Greenberg
Magic tricks based on computer science concepts help grab student attention and can motivate them to delve more deeply. Error detection ideas long used by computer scientists provide a rich basis for working magic; probably the most well known trick of this type is one included in the CS Unplugged activities. This paper shows that much more powerful variations of the trick can be performed, some in an unplugged environment and some with computer assistance. Some of the tricks also show off additional concepts in computer science and discrete mathematics.
An Investigation Of Montmort's "Probleme De Recontres" And Generalizations, Ronald I. Greenberg
An Investigation Of Montmort's "Probleme De Recontres" And Generalizations, Ronald I. Greenberg
Ronald Greenberg
I have investigated a problem which may be phrased in many ways, such as finding the probability of answering a given number of questions correctly on a randomly-completed matching test which may have a number of extra "dud" answers. I have determined such probabilities, the average number of correct answers, and other allied results. I have also investigated a related problem involving the number of ways of choosing a different element from each of a certain collection of sets.