TEXNH trees: a new course in data structures

Authors:
Andrew T. Duchowski;Robert Geist;Robert Schalkoff;James Westall
Affiliations:
Clemson University, Clemson, SC, USA;Clemson University, Clemson, SC, USA;Clemson University, Clemson, SC, USA;Clemson University, Clemson, SC, USA
Venue:
Proceedings of the 42nd ACM technical symposium on Computer science education
Year:
2011

Citing 8
Cited 0

Fast, minimum storage ray-triangle intersection

Journal of Graphics Tools
Multidimensional binary search trees used for associative searching

Communications of the ACM
Graphical problem solving and visual communication in the beginning computer graphics course

SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
?????: a first step

Proceedings of the 35th SIGCSE technical symposium on Computer science education
Using graphics research to teach freshman computer science

ACM SIGGRAPH 2006 Educators program
Data Structures and Algorithm Analysis in C++ (3rd Edition)

Data Structures and Algorithm Analysis in C++ (3rd Edition)
τεΧνη: trial phase for the new curriculum

Proceedings of the 38th SIGCSE technical symposium on Computer science education
Te&d12;cn h and quest-oriented learning

Te&d12;cn h and quest-oriented learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The TEXNH method is an approach to undergraduate computer science education that is based on cognitive constructivisim, in the sense of Piaget, and which invokes several course design directives that include re-combining art and science, problem-based learning, problem selection from the visual problem domain, and cognitive apprenticeship. The paper describes a new TEXNH course in data structures. It includes a full comparative assessment of the realized improvement in student problem solving capability and, for the first time, cognitive authenticity in problem selection, in that the course problem is a variation on a very recent research result.