Implement the following specification of UnsortedType using a ci

ID: 3638163 • Letter: #

Question

Implement the following specification of UnsortedType using a circular linked list as the implementation structure.
 
template<class ItemType>
structNodeType;
 
/* Assumption:  ItemType is a type for which the operators
"<" and "==" are defined—either an appropriate built-in type or a class that overloads these operators. */
 
template<class ItemType>
classUnsortedType
{
public:
  // Class constructor, destructor, and copy constructor
UnsortedType();
  ~UnsortedType();
UnsortedType(constUnsortedType<ItemType>&);
 
void operator=(UnsortedType<ItemType>);
 
boolIsFull() const;
  // Determines whether list is full.
  // Post: Function value = (list is full)
 
intGetLength() const;
  // Determines the number of elements in list.
  // Post: Function value = number of elements in list.
 
voidRetrieveItem(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.
 
 
voidInsertItem(ItemType item);
  // Adds item to list.
  // Pre:  List is not full.
  //       item is not in list.
  // Post: item is in list.
 
voidDeleteItem(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.
 
voidResetList();
  // Initializes current position for an iteration through the
  // list.  
  // Post: Current position is prior to list.
 
voidGetNextItem(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;
};
<h2>Deliverables</h2>
<ul>
<li>A listing of the specification and implementation files for UnsortedType</li>
<li>A listing of the driver program for your test plan</li>
<li>A listing of the test plan as input to the driver.</li>
<li>A listing of the output from the driver.</li>
</ul>

Explanation / Answer

Hi, my fiend here is the circular linked class u can edit the way u want coz i can`t understand what is written in the question above if u need more help message me PLEASE RATE #include using namespace std; struct nodeType { char info; nodeType *link; }; class linkedListType { public: linkedListType() { head=new nodeType; head=0; } ~linkedListType() { destroyList(); } void insertFirst(char val) { nodeType *c; c=new nodeType; c->info=val; c->link=0; if(head==0) { head=c; head->link=head; } else { nodeType *p; p=head; while(p->link!=head) p=p->link; c->link=head->link; head=c; p->link=head; } } void insertLast(char val) { nodeType *p; p=new nodeType; p->info=val; p->link=head; if(head==0) { head=p; head->link=head; } else { nodeType *c; c=new nodeType; c=head; while(c->link!=head) c=c->link; c->link=p; } } void insertAfter(int loc,char val) { int count=0; nodeType *p; p=new nodeType; p->info=val; p->link=0; if(head==0) { head=p; head->link=head; } else { nodeType *c; c=head; while(countlink!=0) { c=c->link; count++; } if(c->link==head) { p->link=head; c->link=p; } else { p->link=c->link; c->link=p; } } } void insertBefore(int loc,char val) { nodeType *p; p=new nodeType; int count=0; p->info=val; p->link=0; if(head==0) { head=p; head->link=head; } else if(loc==0) insertFirst(val); else { nodeType *c=head; while(countlink; count++; } p->link=c->link; c->link=p; } } void initializeList() { destroyList(); } void destroyList() { nodeType *q; int count=0; int len=length(); if(head!=0) { while(count!=len) { q=head; head=head->link; delete q; count++; } } } bool isEmpty() { return (head == 0); } void print() { nodeType *curent=head; while(curent->link != head) { cout link; return (curent->info); } protected: nodeType *head; public: void copyList(const linkedListType &cf) { nodeType *p; nodeType *c; c=cf.head; if(cf.head==0) head=0; else { head=new nodeType; p=head; p->info=c->info; p->link=p; c=c->link; head=p; while(c!=cf.head) { p->link=new nodeType; p=p->link; p->info=c->info; p->link=0; c=c->link; } p->link=head; } } }; int main() { linkedListType obj1; cout

Navigate

<p class=\"MsoNormal\" style=\"text-indent: -0.25in; margin: 0in 0in 0pt 0.25in;

1) If the digtal circuits in a compute

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

<p class=\"NL\">Implement the following specification of UnsortedType using a ci

Question

Explanation / Answer

Related Questions

Navigate