Question

HI USING C++ CAN YOU PLEASE PROGRAM THIS ASSIGNMENT AND ADD COMMENTS:

stackARRAY:

#include<iostream>

#define SIZE 100

#define NO_ELEMENT -999999

using namespace std;

class Stack {

int arr[SIZE]; // array to store Stack elements

int top;

public:

Stack() {

top = -1;

}

void push(int); // push an element into Stack

int pop(); // pop the top element from Stack

int topElement(); // get the top element

void display(); // display Stack elements from top to bottom

};

void Stack :: push(int data) {

//if stack is full tell the user sorry it is full

if (top == SIZE-1) {

cout << "Sorry, the stack is full" << endl;

} else {

top++;

arr[top] = data;

}

}

int Stack :: pop() {

//if stack is empty tell the user sorry it is empty

if (top == -1) {

cout << "Sorry, the stack is empty" << endl;

return NO_ELEMENT;

}

int val = arr[top];

top--;

return val;

}

int Stack :: topElement() {

//if stack is empty tell the user no it is empty

if (top == -1) {

cout << "Sorry, the stack is empty" << endl;

return NO_ELEMENT;

}

return arr[top];

}

void Stack :: display() {

cout << "Stack display:" << endl;

for (int i = top ; i >=0 ; i--) {

cout << arr[i] << endl;

}

}

int main() {

Stack s;

s.push(12);

s.push(5);

s.push(13);

s.display();

cout << "Top Element : " << s.topElement() << endl;

s.pop();

s.push(7);

s.display();

return 0;

}

queueARRAY:

#include<iostream>

#define SIZE 100

using namespace std;

class Queue {

int arr[SIZE];

int front, rear;

public :

Queue() {

front = rear = -1;

}

void enqueue(int); // insert an element into queue

int dequeue(); // Remove the front element from queue

void display(); // display the queue elements

};

void Queue :: enqueue(int data) {

//queue is empty

if (rear == -1) {

rear = 0;

front = 0;

arr[rear] = data;

}

//queue is full

else if (rear == SIZE-1) {

cout << "Queue is full" << endl;

} else {

rear++;

arr[rear] = data;

}

}

int Queue :: dequeue() {

//queue is empty

if (front == -1) {

cout << "Queue is empty";

return -1;

} else {

//queue has only one element

if (front == rear) {

int val = arr[front];

front = rear = -1;

return val;

} else {

int val = arr[front];

front++;

return val;

}

}

}

void Queue :: display() {

if (rear == -1) {

cout << "Empty queue!" << endl;

return;

}

cout << "Displaying the queue" << endl;

for (int i = front ; i <= rear; i++) {

cout << i << " " << arr[i] << endl;

}

}

int main() {

Queue q;

q.display();

q.enqueue(7);

q.enqueue(11);

q.enqueue(8);

q.enqueue(2);

q.display();

q.dequeue(); // 7 is dequeued

q.dequeue(); // 11 is dequeued

q.enqueue(5);

q.display();

return 0;

}

Implement a queue data structure using two stacks. Remember a queue has enqueue and dequeue functions You could use either the array or linked list implementation for stacks and queues Note l went through both array and linked list implementation for stacks and queues in class this week. The source code implementations are available under the Canvas directory: Files->stacks_queues.

Answer 1

#include <iostream>

#define SIZE 100

#define NO_ELEMENT -999999

using namespace std;

class Stack {

int arr[SIZE]; // array to store Stack elements

int top;

public:

Stack() {

top = -1;

}

void push(int); // push an element into Stack

int pop(); // pop the top element from Stack

int topElement(); // get the top element

void display(); // display Stack elements from top to bottom

int isEmpty();

};

void Stack :: push(int data) {

//if stack is full tell the user sorry it is full

if (top == SIZE-1) {

cout << "Sorry, the stack is full" << endl;

} else {

top++;

arr[top] = data;

}

}

int Stack :: isEmpty() {

return top==-1;

}

int Stack :: pop() {

//if stack is empty tell the user sorry it is empty

if (top == -1) {

cout << "Sorry, the stack is empty" << endl;

return NO_ELEMENT;

}

int val = arr[top];

top--;

return val;

}

int Stack :: topElement() {

//if stack is empty tell the user no it is empty

if (top == -1) {

cout << "Sorry, the stack is empty" << endl;

return NO_ELEMENT;

}

return arr[top];

}

void Stack :: display() {

cout << "Stack display:" << endl;

for (int i = top ; i >=0 ; i--) {

cout << arr[i] << endl;

}

}

struct Queue {

Stack stack1, stack2;

void enQueue(int x)

{

while (!stack1.isEmpty()) {

stack2.push(stack1.pop());

}

stack1.push(x);

while (!stack2.isEmpty()) {

stack1.push(stack2.pop());

}

}

int deQueue()

{

if (stack1.isEmpty()) {

cout << "Queue is Empty";

return -1;

}

int x = stack1.pop();

return x;

}

};

int main()

{

Queue q;

q.enQueue(10);

q.enQueue(22);

q.enQueue(45);

cout << q.deQueue() <<endl;

cout << q.deQueue() << endl;

cout << q.deQueue() << endl;

return 0;

}

=======================================
SEE OUTPUT


main.cpp曰 saved ▼ https://Wonde 63 cLang versi 64 struct Queue Stack stackl, stack2; 65 cLang++- ./main 10 67 void enQueue(int x) 68 45 while (!stack1.isEmpty()) stack2.push(stack1.pop()); 69 70 71 stack1.push(x); while stack2.isEmpty()) stack1.push(stack2.pop ()); 72 73 74 75 76 78 int deQueue() 79 80 if (stack1.isEmpty()) f 81 82 cout << "Queue is Empty"; 83 return -1; 84 int x- stack1.pop(); 85 86 return x; 87 88 ;

main.cpp Esaved https://Wonderfullnc 84 clang version 7.0 int x = stack!" pop(); 85 86 return x; cLang++-pth ./main 10 87 89 45 90 int main() 91 92 Queue q q.enQueue (10); q.enQueue (22); q.enQueue (45); 93 94 95 96 cout << q.deQueue () <<endl; cout << q.deQueue) << endl; cout << q.deQueue() << endl; 97 98 100 101 return 0; 102

Thanks, PLEASE COMMENT if there is any concern.