4523 search results - page 2 / 905 » Using randomization in the teaching of data structures and a... |
SIGITE
2005
ACM
13 years 11 months ago
2005
ACM
Educators have long been trying to spice things up in their introductory programming courses. Traditionally, twodimensional arrays have been taught non-graphically using contrived...
SIGCSE
1997
ACM
13 years 10 months ago
1997
ACM
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
SIAMCOMP
1998
13 years 6 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
CG
2007
Springer
13 years 6 months ago
2007
Springer
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
SIGCSE
1997
ACM
13 years 10 months ago
1997
ACM
This paper describes our experiences incorporating Java in a Data Structures course. We describe the features of Java that made for a more interesting course, the difficulties tha...