Answered Essay: stack_handout 09/08/17 09:13:34 stack.h: wrapper implemention based on single-linked list class stack_

Problem 1

See the stack_handoutfor the class definitionand wrapper implementationof a stack based on a list.Your task is to replace the wrapper implementation with code based on a dynamically allocated array. Assume the data stored on the stack are simple integers (int). Implement the public member functions stack(), ~stack(), empty(), size(), push(), pop() and top(). Single line functions may be defined within the class if you like. Multi-line functions should be defined outside of the class definition. The constructor initializes all member variables and allocates memory for the array. The destructor deallocates the array memory. Make the size of the array 10.Do not include resizing. Do not include any error checking.

Problem 2

What type of error checking should member functions push(), pop() and top() include if the code were to be used in real application?

Need help and tip please, Thanks!

stack_handout 09/08/17 09:13:34 stack.h: wrapper implemention based on single-linked list class stack_usage2.cpp: check for matching , brackets ** ADVANCED tinclude stack.h idefine QUOTE 34 #ifndef STACK-H define STACK_H include slinked-list.h class stack int main(int argc, char argv) const char *left = ({; const char *right = )); public: bool empty) const f return v.empty )h int size const return v.size) stack bracket string text; void push (const data t &din)v.push front (din) void popo v pop front const data t & topreturn v.front while (getline (cin, text) for (const char // skip double quoted text if (*p-QUOTE) { *p= text . c-str ( ); *p; p++) { private: while ( ++p!OUOTE) h continue; list v endif for i<2; i++) { (int // push left bracket onto stack i=0; stack_usagel.cpp: basic last-in, first-out example f (P left[i]) bracket push (left [i]) // cmp right bracket with top of stack ) else if (P - righti]) #include stack . h int main(int argc, cha argv]) if (bracket.top )lefti]) cout <<error: bracket stack v int value; <<left[i<<< right [i] <mismatchn else bracket.pop ) cout << enter values: n while (cin >> value) v.push (value) cout << value <<n; cout << LIFOn; while !v.emptyO) while (!bracket.empty 0) value = v.top ( ); v.pop ); cout << value <n cout <<error: no match for <<(char)bracket.top) <<n; bracket pop

stack_handout 09/08/17 09:13:34 stack.h: wrapper implemention based on single-linked list class stack_usage2.cpp: check for matching , brackets ** ADVANCED tinclude “stack.h” idefine QUOTE 34 #ifndef STACK-H define STACK_H include “slinked-list.h” class stack int main(int argc, char argv) const char *left = “({“; const char *right = “))”; public: bool empty) const f return v.empty )h int size const return v.size) stack bracket string text; void push (const data t &din)v.push front (din) void popo v pop front const data t & topreturn v.front while (getline (cin, text) for (const char // skip double quoted text if (*p-QUOTE) { *p= text . c-str ( ); *p; p++) { private: while ( ++p!OUOTE) h continue; list v endif for i

Expert Answer

 

1. Stack.h

#ifndef STACK_H

#define STACK_H

class Stack {

public:

Stack();

~Stack();

bool empty() const {return t==-1;}

bool size() const {return t+1;}

void push(int);

void pop();

int top();

private:

int *array;

int t;

};

Stack::Stack(){

array= new int[10];

t=-1;

}

Stack::~Stack(){

delete []array;

}

void Stack::push(int n) {

t++;

array[t]=n;

}

void Stack::pop() {

t–;

}

int Stack::top(){

return array[t];

}

#endif

2.

push() should check if stack is full before pushing

pop() should check if stack is empty before poping

top() should check if stack is empty before returning top element

Buy Essay
Calculate your paper price
Pages (550 words)
Approximate price: -

Help Me Write My Essay - Reasons:

Best Online Essay Writing Service

We strive to give our customers the best online essay writing experience. We Make sure essays are submitted on time and all the instructions are followed.

Our Writers are Experienced and Professional

Our essay writing service is founded on professional writers who are on stand by to help you any time.

Free Revision Fo all Essays

Sometimes you may require our writers to add on a point to make your essay as customised as possible, we will give you unlimited times to do this. And we will do it for free.

Timely Essay(s)

We understand the frustrations that comes with late essays and our writers are extra careful to not violate this term. Our support team is always engauging our writers to help you have your essay ahead of time.

Customised Essays &100% Confidential

Our Online writing Service has zero torelance for plagiarised papers. We have plagiarism checking tool that generate plagiarism reports just to make sure you are satisfied.

24/7 Customer Support

Our agents are ready to help you around the clock. Please feel free to reach out and enquire about anything.

Try it now!

Calculate the price of your order

Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

HOW OUR ONLINE ESSAY WRITING SERVICE WORKS

Let us write that nagging essay.

STEP 1

Submit Your Essay/Homework Instructions

By clicking on the "PLACE ORDER" button, tell us your requires. Be precise for an accurate customised essay. You may also upload any reading materials where applicable.

STEP 2

Pick A & Writer

Our ordering form will provide you with a list of writers and their feedbacks. At step 2, its time select a writer. Our online agents are on stand by to help you just in case.

STEP 3

Editing (OUR PART)

At this stage, our editor will go through your essay and make sure your writer did meet all the instructions.

STEP 4

Receive your Paper

After Editing, your paper will be sent to you via email.