This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 15-121: Introduction to Data StructuresFall 2009Exercise10/28/2009BankListsDue: Sat, Nov 78am Relevant Reading:Chapter 4 of the Lewis and Chase bookSection 9.2 of the online text by EckAssignment: (worth 5 exercise points ) Using the files in BankLists.zipas a start.Look at the interface AccountList. Your task is to write two implementations of this interface: AccountListWithArraysand AccountListWithNodesMore details are below:AccountListWithArrays: This implementation should keep the data in an array and use parallel arrays to keep the various orders of the list.You should declare a default constructor. It is up to you to determine how large to make your initial array.There should be no upper limit on the number of accounts the list can handle (except for the overall size of memory allocated to the program).Returning an ArrayList of the accounts in proper order should take O(n) time (in other words, you don't have time to sort the list in any of these methods).words, you don't have time to sort the list in any of these methods)....
View Full Document
- Spring '09
- Data Structures