11 search results - page 1 / 3 » Teaching the analysis of algorithms with visual proofs |
SIGCSE
1998
ACM
13 years 9 months ago
1998
ACM
VL
1996
IEEE
13 years 9 months ago
1996
IEEE
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fra...
JAR
2007
13 years 4 months ago
2007
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
SIGCSE
1997
ACM
13 years 9 months ago
1997
ACM
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
TVCG
2010
13 years 3 months ago
2010
— Isosurfaces are fundamental volumetric visualization tools, and are generated by the well-known Marching Cubes cases that approximate contours of trilinearly-interpolated scala...