Module 1: Lists, Queues, & Stacks

Lab


Lab 1: The tale of a tail reference

Lab 1: The tale of a tail reference

Abstract: This course is greatly concerned with characterizing the performance of a given approach or algorithm. In this lab, you measure the time of appending to two different implementations of the List ADT: one has tail reference, and other does not.

Goals of this lab:


Warmup procedure


Your work for this lab


How to submit your work


Submitting your work (read carefully)



Last modified 09:46:23 CDT 22 August 2016