prog1 - COP 3530 Programming Assignment #1 Summer 2002...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Title: “Program Assignment 1: Analyzing Performance of Self-Organizing Lists” Points: 100 points – 60pts for coded portion, 40 points for written analysis Due Date: In class Wednesday June 12, 2002 Objectives: (1) To implement in Java, a variety of self-organizing list structures, and (2) produce empirical results to gauge the behavior of the self-organizing variants when compared to a standard linear list. Description: Create a Java program that implements three different variants of the self- organizing list structure (namely move-to-front, count, and transpose) as well as a standard non- self-organizing list and determine for a set of five randomly generated “access sequences” the number of comparisons required for each search in the variants and compare it with the number of comparisons required in the standard list. Technique: 1. Create a standard linked list which contains 26 nodes with each node containing a letter from the English alphabet. Call this list standard. The nodes of the standard list can be entered in alphabetic order. So the standard list will look like: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 2. Copy the standard list created in step 1 into three other lists called:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 06/13/2011.

Page1 / 2

prog1 - COP 3530 Programming Assignment #1 Summer 2002...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online