Sciweavers

53 search results - page 6 / 11
» sigcse 2005
Sort
View
SIGCSE
2005
ACM
180views Education» more  SIGCSE 2005»
14 years 3 months ago
Analyze that: puzzles and analysis of algorithms
The paper advocates a wider use of puzzles and puzzle-like games in teaching the analysis of algorithms. It discusses many specific examples—from classic puzzles of recreational...
Anany Levitin
SIGCSE
2005
ACM
240views Education» more  SIGCSE 2005»
14 years 3 months ago
A Java framework for experimentation with steganography
This article describes a Java framework for experimentation with fundamental steganographic techniques. The framework is built on top of Java's image processing libraries and...
Kenny Hunt
SIGCSE
2005
ACM
123views Education» more  SIGCSE 2005»
14 years 3 months ago
Taming Java for the classroom
Java is the canonical language for teaching introductory programming, but its complex syntax and abundance of constructs are difficult for beginners to learn. This paper shows how...
James I. Hsia, Elspeth Simpson, Daniel Smith, Robe...
SIGCSE
2008
ACM
295views Education» more  SIGCSE 2008»
13 years 9 months ago
A specimen MPI application: N-Queens in parallel
: The generalized problem of placing n queens on an n-by-n board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion...
Timothy J. Rolfe
SIGCSE
2005
ACM
102views Education» more  SIGCSE 2005»
14 years 3 months ago
Interpreting Java program runtimes
Many instructors use program runtimes to illustrate and reinforce algorithm complexity concepts. Hardware, operating system and compilers have historically influenced runtime resu...
Stuart A. Hansen