Answered: ment these five methods and main…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

implement these five methods and main function: 1. getSize() // return the total number of items stored in the bag. Note: DlkdBag does not have itemCount member variable. 2. addFH() //add anEntry from head 3. addFT() //add anEntry from tail 4. display() // display bag items from head to tail 5. clear() // get rid of the bag, and release all memory used by the bag 6. main() // driver code to test all the methods you've implemented Submission: Put everything into a single file, name it as LastNameFirstInitial_a3.cpp (e.g., if your name is John Doe

bool addFT (const T& nEntry); // add from tail
void clear () ;
void display (0 const;
};
Please implement these five methods and main function:
1. getSize( ) // return the total number of items stored in the bag. Note: DlkdBag does not have
itemCount member variable.
2. addFH( ) //add anEntry from head
3. addFT( ) //add anEntry from tail
4. display( ) // display bag items from head to tail
5. clear( ) // get rid of the bag, and release all memory used by the bag
6. main( ) // driver code to test all the methods you've implemented
Submission: Put everything into a single file, name it as LastNameFirstInitial_a3.cpp (e.g., if your name is
John Doe, it will be DoeJ_a3.cpp), and then upload it to your blackboard account by the due day.

ds
Given two classes Dnode (for doubly linked node) and DlkdBag (for doubly linked bag) below:
// Dnode: doubly linked node
template<class T>
class Dnode {
T item;
Dnode<T>* next;
Dnode<T>* prev;
public:
Dnode () :next (nullptr), prev (nullptr) { )
Dnode (const T& anItem) :next (nullptr), prev (nullptr), item (anItem){ }
Dnode (const T& anItem, Dnode<T>* nn, Dnode<T>* pn) :next (nn), prev (pn),
item (anItem){ }
void setItem (const T& anItem){item = anItem; }
void setNext (Dnode<T>* nn) { next = nn; }
void setPrev (Dnode<T>* pn) { prev = pn;)
T getItem () const { return item; }
Dnode<T>* getNext () const { return next; }
Dnode<T>* getPrev () const { return prev; }
// DlkdBag: doubly linked bag
template<class T>
class DlkdBag {
Dnode<T>* head;
Dnode<T>* tail;
Dnode<T>* getPtrTo (const T& tgt) const;
public:
DlkdBag () : head (nullptr), tail (nullptr) {}
DlkdBag (const DlkdBag<T>& aBag);
int getSize () const;
bool addFH (const T& nEntry); // add from head
bool addFT (const T& nEntry); // add from tail
void clear ();
void display () const;

Expert Solution

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions