Sciweavers

SIGCSE
2005
ACM
366views Education» more  SIGCSE 2005»
15 years 2 months ago
Using asynchronous discussions to enhance student participation in CS courses
As Computer Science (CS) educators, we are involved in teaching a variety of undergraduate and graduate courses such as database management systems, networking, software developme...
Bhagyavati, Stan Kurkovsky, Christopher C. Whitehe...
SIGCSE
2005
ACM
240views Education» more  SIGCSE 2005»
15 years 2 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
217views Education» more  SIGCSE 2005»
15 years 2 months ago
Alternatives to two classic data structures
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
Chris Okasaki
SIGCSE
2005
ACM
192views Education» more  SIGCSE 2005»
15 years 2 months ago
Ubiquitous presenter: increasing student access and control in a digital lecturing environment
The University of Washington’s Classroom Presenter lecturing system enables an active lecturing environment by combining a standard electronic slide presentation format with the...
Michelle Wilkerson, William G. Griswold, Beth Simo...
SIGCSE
2005
ACM
180views Education» more  SIGCSE 2005»
15 years 2 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
Education
Top of PageReset Settings