Department of Computer Science and Engineering

CSE 247 / 502N

Spring 2016


Lab 0: The tale of a tail reference

Due: 3 February 2016 at 2:30 PM

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



Last modified 13:00:49 CST 27 January 2016 by Ron K. Cytron