CS330 Spring 2004 Lecture 13
George Tzanetakis
Slides
This lecture will not contain any slides as it consists mainly of
programming examples in sml.
SML code
Code in text format
Suggested exercises
13.1) The function insertList of the hash table example shown in the
nodes can be
made more efficient if we just insert the element onto the front of the
list
without checking whether or not it is already on the list. However, if
we do so ,
then the deleteList function must be modified as well. Why ? Write
revised functions to support duplicate elements on a bucket list
13.2) In order to represent a matrix one possibility is
an Array of Arrays of reals. Write a module (signature and structure)
that supports creation of a matrix from a list of lists and
provides function to perform matrix addition and multiplication.