Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Please just do the Main.cpp I'm really lost with this assignment. 1.(50 points) Implement an Unsorted List ADT using a linked list implementation with an

Please just do the Main.cpp I'm really lost with this assignment.

1.(50 points) Implement an Unsorted List ADT using a linked list implementation with an extension of ADT with function SplitLists (Exercise 3 from Chapter 3, p. 185). Keep the function names the same as in Unsorted List ADT in Chapter 3.

SplitLists function requirements:

SplitLists(UnsortedType list, ItemType item, UnsortedType& list1, UnsortedType& list2)

Function: divides list into two lists according to the key of item

Preconditions: list has been initialized and is not empty

Postconditions: list1 contains all the items of list whose keys are less than or equal to items key; list2 contains all the items of list whose keys are greater than items key

a) Implement SplitLists as an array-based member function of the Unsorted List ADT.

b) Implement SplitLists as a linked member function of the Unsorted List ADT.

2.(50 points) Describe and implement the testcases for the functions SplitLists, MakeEmpty, InsertItem, DeleteItem, RetrieveItem, ResetList, GetNextItem based on their Preconditions and Postconditions.

Provide a text file (Word doc) with an itemized description of each set of testcases for each of the above mentioned functions followed by a printout of running those testcases.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

XML Data Management Native XML And XML Enabled Database Systems

Authors: Akmal Chaudhri, Awais Rashid, Roberto Zicari, John Fuller

1st Edition

0201844524, 978-0201844528

More Books

Students also viewed these Databases questions