Data Structures

PA 06

Repeat Lab 10

Due by Wednesday, November 4th at the start of class

The introduction

In Lab10 I asked you to use a linked-list as the underlying data structure to produce an implementation of an index-based list.  As I complained in session 30, many of you did a LOUSY job of implementing and then testing your code for the solution to this lab. 

You failed to:

• ask questions when you were confused
• pay attention to the API for the indexed-list (what are the rules for how an indexed-list behaves?)
• test your code adequately

Your Assignment

Simply put... DO IT AGAIN.

Go back and look at the specification for Lab10.  Either use your final code from the lab as a starting point and fix your mistakes OR consider starting over from scratch and doing it RIGHT this time.

Testing your code

Download the following PyUnit test script:

• Lab10UnitTesting.py

This code contains tests of 7 main actions that I considered when grading your assignment to Lab10.  You should continue to work on your assignment for this assignment until your code can pass all 7 tests with no error or failures.  Passing this test suite does not guarantee that your code is perfect, but it will guarantee that you pass my tests and get full credit for this assignment.

If you find yourself unable to correct your code then TALK TO ME.  I can't help you if you don't ask.

Submitting your assignment

To get full credit for this assignment you must:

• Work on your code for linkedIndexedList.py from Lab10 until it passes all the tests in my test suite.
• Upload
  • linkedIndexedList.py