Question

USING THE C++ CODE BELOW, CAN YOU PLEASE SOLVE THE QUESTION AND EXPLAIN THE STEPS.

class StaticStack

{

private:

int *stack;

int capacity;

int top; // index of the top element

public:

StaticStack(int size); // constructor

~StaticStack();

bool isFull();

bool isEmpty();

void push(int);

int pop();

};

#include "StaticStack.h"

#include <iostream>

using namespace std;

StaticStack::StaticStack(int size)

{

stack = new int[size]; // constructing a size sized array

capacity = size;

top = -1; // empty stack

  

}

StaticStack::~StaticStack()

{

delete [] stack;

}

bool StaticStack::isFull()

{

return (top == capacity -1);

}

bool StaticStack::isEmpty()

{

return (top == -1);

}

void StaticStack::push(int data)

{

if (isFull())

{

cout << "The stack is currently full " << "\n";

}

else

{

top++;

stack[top] = data; // Generally -> keep careful because stuff on the right is assigned to stuff on the left

}

}

int StaticStack::pop()

{

int num = 0;

if (isEmpty())

cout << "The stack is empty";

else

{

top--;

num = stack[top+1];

}

return num;

}

2. (Gaddis Exercises 18.15) Balanced Multiple Delimiters A string may use more than one type of delimiter to bracket information into blocks. For example, A string may use braces3, parentheses (), and brackets [ ] as delimiters. A string is properly delimited if each right delimiter is matched with a preceding left delimiter of the same type in such a way that either the resulting blocks of information are disjoint, or one of them is completely nested within the other. Write a program that uses a single stack to check whether a string containing braces, parentheses, and brackets is properly delimited.

Answer 1

We write the as follows as

class StaticStack // as class

int *stack, top, capacity;// Variables as private scope only in class access

public  StaticStack(int size); // constructor

~StaticStack(); // destructor

// Here we take some field as

bool isFull(); // It checks whether stack is full or not it returns true or false

bool isEmpty(); //  It checks whether stack is empty or not it returns true or false

void push(int); // this function push the data into the stach using push integer type element.

int pop(); // this function throws back the data from the stack.

// We declare StaticStack::StaticStack(int size) using namespace and use scope resolution operator ( : : ).

// We implement the above function as push, pop, isFull, isEmpty.

StaticStack::~StaticStack() // this is destructor implement when object goes out of scope this //autometically called and delete stack object.

{  delete [] stack; }

******************************************************************************************************

2. Balanced Multiple Delimeters:

#include<iostream>

#include<stack>

#include<string>

using namespace std;

bool Pair(char begin, char end){

if( begin == '( ' && end ==')' )

return true;

else if(begin == '{' && end =='}')

return true;

else if( begin == '['&& end ==']')

return true;

return false; }

bool AreBalanced(String exp){

stack<char> S;

for(int i=0;i<exp.length();i++)

{

if(exp[i] == '(' || exp[i] == '{' || exp[i] == '[')
	S.push(exp[i]);

else if(exp[i] == ')' || exp[i] == '}' || exp[i] == ']')

{

if(S.isEmpty() || ! Pair(S.top, exp[i]))

return false;

else

S.pop();

} }

return S.empty() ? true:false;

}

int main(){

String Expression;

cout<< " Enter your expression : ";

cin>> expression;

if(AreBalanced(expression))

cout<< " expression is balanced";

else

coout<<" expression is not balanced";

}

*****************************************************************************************************