Analysis of new variants of coalesced hashing
ACM Transactions on Database Systems (TODS)
The design and analysis of coalesced hashing
The design and analysis of coalesced hashing
An empirical study of insertion and deletion in binary search trees
Communications of the ACM
Balancing binary trees by internal path reduction
Communications of the ACM
Implementations for coalesced hashing
Communications of the ACM
| Hi-index | 0.00 |
Data structures is a well known course taught in most computer science departments. This course typically includes a study of the most conventional data structures and their associated algorithms. Complexity of the algorithms is often a major focus of the course. To facilitate the student's understanding of the algorithms and their complexity, three projects are proposed. This paper concerns itself with an empirical approach to these projects. In addition to the usual knowledge gained from performing these projects, students learn an analytical technique that can be applied to many algorithms and to research.