Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 398 Weeks Ago, 2 Days Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 14 Sep 2017 My Price 9.00

specification of UnsortedType

C++ Programming assignment

Implement the following specification of UnsortedType using a circular linked list as the implementation structure.

 

template <class ItemType>

struct NodeType;

 

/* Assumption: ItemType is a type for which the operators

"<" and "==" are definedA????1either an appropriate built-in type or a class that overloads these operators. */

 

template <class ItemType>

class UnsortedType

{

public:

// Class constructor, destructor, and copy constructor

UnsortedType();

~UnsortedType();

UnsortedType(const UnsortedType<ItemType>&);

 

void operator=(UnsortedType<ItemType>);

 

bool IsFull() const;

// Determines whether list is full.

// Post: Function value = (list is full)

 

int GetLength() const;

// Determines the number of elements in list.

// Post: Function value = number of elements in list.

void RetrieveItem(ItemType& item, bool& found);

// Retrieves list element whose key matches item's key

// (if present).

// Pre: Key member of item is initialized.

// Post: If there is an element someItem whose key matches

//     item's key, then found = true and item is a copy of

//     someItem; otherwise found = false and item is

//     unchanged.

//     List is unchanged.

 

 

void InsertItem(ItemType item);

// Adds item to list.

// Pre: List is not full.

//       item is not in list.

// Post: item is in list.

 

void DeleteItem(ItemType item);

// Deletes the element whose key matches item's key.

// Pre: Key member of item is initialized.

//       One and only one element in list has a key matching

//       item's key.

// Post: No element in list has a key matching item's key.

 

void ResetList();

// Initializes current position for an iteration through the

// list.  

// Post: Current position is prior to list.

 

void GetNextItem(ItemType&);

// Gets the next element in list.

// Pre: Current position is defined.

//       Element at current position is not last in list.

// Post: Current position is updated to next position.

//       item is a copy of element at current position.

 

private:

NodeType<ItemType>* listData;

int length;

NodeType<ItemType>* currentPos;

};

Deliverables

A listing of the specification and implementation files for UnsortedType

A listing of the driver program for your test plan

A listing of the test plan as input to the driver.

A listing of the output from the driver.

Answers

(5)
Status NEW Posted 14 Sep 2017 07:09 PM My Price 9.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)