Using Real Execution Timings to Enliven a Data Structures Class
Document Type
Conference Proceeding
Publication Date
2012
Abstract
Which is faster, an array list or a linked list? In our data structures course we increase the engagement of our students by asking them to predict the outcome of a future race between competing data structures. We record their predictions for future validation, and subsequently as we analyze the data structures, students are more engaged in the analysis because it either lends credence or doubt towards the accuracy of their predictions. Some of their expectations get radically broken by the analysis, and in the end everyone gets surprised by the actual runtime results. Everyone benefits because the class is more engaging and the results are more memorable
Recommended Citation
Boothe, B. Using Real Execution Timings to Enliven a Data Structures Course. (2012). In Arabnia, H.R., Clincy, V.A., & Deligiannidis, L. (Eds.) The International Conference on Frontiers in Education: Computer Science and Computer Engineering (FECS). Volume I. (pp. 113-117).
Comments
Copying without a fee is permitted provided that the copies are not made or distributed for direct commercial advantage, and credit to source is given. Abstracting is permitted with credit to the source.
Please contact the publisher for other copying, reprint, or republication permission.
Copyright © 2012 CSREA Press ISBN: 1-60132-212-7, 1-60132-213-5 (1-60132-214-3) Printed in the United States of America