Retirement Benefits Data Storage Exercise, Essay Example

Introduction

The current project requires a retirement benefits data storage system.

Analysis

A non-linear data structure will be used to augment the implementation of the sort method. Thus, the retirement data storage systems will implement a tree data structure. The choice of a linked list precludes the possibility of complex data manipulation. These choices are effective use of system resources because no data array will be implemented. The size of the databases will only be dependent on the amount of data it contains. It is suitable to the task at hand because of the inherit flexibility of the structure.

Design
The class must include integers in an Abstract Data Type (ADT). Available methods follow:

• Insert
• Sort

The syntax for the sort is derived from .NET Framework Generic Collections. Return values are expected to include sorted values. The structure is represented below along with test data.

Variable          Type                Sample1          Sample2

Name              String              John Doe         Jane Doe

Amount           Integer             10000              20000

Code

using System;

using System.Collections.Generic;

public class InsertTest

{

public static void Main()

{

//Data declarations

string name = “John Doe”;

int amount = 10000;

string name2 = “Jane Doe”;

int amount2 = 20000;

List <int> list = new List <int>();

list.Add(amount2);

list.Add(amount);

string strTarget = String.Format(“{0} “, name2);

name = name.Trim() + ” “;

//Insert

strTarget = strTarget.Insert(strTarget.IndexOf(name2), name);

Console.WriteLine(strTarget);

// Sort & Print

list.Sort();

foreach (int value in list)

{

Console.Write(value);

Console.Write(”    “);

}

Console.ReadLine();

}

}