A B-Tree Assignment that is Realistic Enough That Students Can List It On Their Resumes

James S. Plank, EECS Department, University of Tennessee.

The Journal of Computing Sciences in Colleges, Volume 31, #2, December, 2015, pp. 278--282.

Abstract

This paper describes a programming assignment that I give in my CS494 class, where the students write a B-Tree implementation on top of a raw disk interface. The assignment may be found at http://web.eecs.utk.edu/~jplank/plank/classes/cs494/494/labs/Lab-2-B-Tree/.

Citation Information

Plain Text:

author          J. S. Plank
title           A {B-Tree} Assignment that is Realistic Enough That 
                Students Can List It On Their Resumes
journal         Journal of Computing Sciences in Colleges
volume          31
number          2
month           December
year            2015
pages           278-282
where           http://web.eecs.utk.edu/~jplank/plank/papers/CCSC-2015.html

Bibtex:

@ARTICLE{p:15:btree,
  author = "J. S. Plank",
  title = "A {B-Tree} Assignment that is Realistic Enough That 
    Students Can List It On Their Resumes",
  journal = "Journal of Computing Sciences in Colleges",
  volume = "31",
  number = "2",
  month = "December",
  year = "2015",
  pages = "278-282",
  where = "http://web.eecs.utk.edu/~jplank/plank/papers/CCSC-2015.html"
}