Question

The language we are using in Data Structures is C++ right now.

Assignment9-Apr 3 References A A A X? A. Mailings Review A E E. A. View . :. 2+ . 1 . Albebote albebete Nere AutoCeDdte AaBbCcDc AabCeDdE Heading 1 Heading 2 Student Name: Student ID (Last 4 digits): Due Date: 4/3/2020 Note: For any program questions of the assignment, Make sure you complete programs. You may copy & paste the code to this word file, and submit them in one file. If you don't have Visual Studio, No Problemi You may use online compilers many great online compilers for C++, Java, & Python available now. One example is repl.it. Try it. It's completely free. You will be able to copy & paste your code to this word file and submit both programs in one file. This assignment is due on Apr 3, Friday. A deque is a data structure consisting of a list of items on which the following operations are possible: push(x): Insert item x on the front end of the deque. DORO: Remove the front item from the deque and return it. inject(x): Insert item x on the rear end of the deque. eject: Remove the rear item from the deque and return it. Write routines to support the deque that take adi) time per operation. ish (United States)

Answer 1

#include <iostream>

#define MAX 10

using namespace std;

class Deque

{

int front, rear, size;

int arr[MAX];

public:

Deque(int size)

{

this->size = size;

front = rear = -1;

}

bool isFull()

{

return ((front == 0 && rear == size-1)||front == rear+1);

}

bool isEmpty(){ return front == -1; }

void push(int data)

{

if(front == -1)

{

front = 0;

arr[++rear] = data;

}

else if(front != 0)

arr[--front] = data;

else

cout << "Overflow!\n\n";

}

void inject(int data)

{

if (isFull())

{

cout << "Overflow!\n\n";

return;

}

if (front == -1)

{

front++;

rear++;

}

else

rear = rear + 1;

arr[rear] = data;

}

int pop()

{

int res;

if(isEmpty())

{

cout << "Underflow!\n\n";

res = -1;

}

else

{

res = arr[front];

if(front == rear)

front = rear = -1;

else

front = front + 1;

}

return res;

}

int eject()

{

int res;

if(isEmpty())

{

cout << "Underflow!\n\n";

res = -1;

}

else

{

res = arr[rear];

if(front == rear)

front = rear = -1;

else

rear = rear - 1;

}

return res;

}

void show()

{

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

{

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

}

cout << endl;

}

};

int main()

{

Deque deque(5);

deque.push(17);

deque.inject(10);

deque.inject(23);

deque.inject(16);

cout << "Initial contents:\n";

deque.show();

cout << "\nDeleting from front:\n";

cout << "Item deleted = " << deque.pop() << endl;

cout << "\nContents after deleting:\n";

deque.show();

cout << "\nDeleting from rear:\n";

cout << "Item deleted = " << deque.eject() << endl;

cout << "\nContents after deleting:\n";

deque.show();

cout << "\nPushing an element at the front:\n";

deque.push(21);

cout << "Contents after pushing to the front:\n";

deque.show();

return 0;

}

************************************************************ SCREENSHOT ****************************************************

CODE SNIPPET SCREENSHOTS:

main.cpp saved #include <iostream> #define MAX 10 using namespace std; class Deque int front, rear, size; int arr[MAX]; public: Deque(int size) this->size = size; front = rear = -1; bool isFull() return ((front == 0 && rear == size-1) |front == rear+1); bool isEmpty(){ return front == -1; } void push(int data) { if(front == -1) front = 0;

main.cpp 5 saved if(front == -1) front = 0; arr[++rear] = data; } else if(front != 0) arr[--front] = data; else cout << "Overflow!\n\n"; void inject(int data) if (isFull()) cout << "overflow!\n\n"; return; if (front == -1) front++; rear++; else rear = rear + 1;

main.cpp 2 saved else rear = rear + 1; arr[rear] = data; int pop() int res; if(isEmpty()) cout << "Underflow!\n\n"; res = -1; else res = arr[front]; if(front == rear) front = rear = -1; else front = front + 1; return res; int eject()

main.cpp 3 saved int eject() int res; if(isEmpty()) cout << "Underflow!\n\n"; res = -1; else res = arr[rear]; if(front == rear) front = rear = -1; else rear = rear - 1; return res; void show() for(int i = front; i <= rear; i++) cout << arr[i] « " "; cout << endl;

107 108 main.cpp 2 saved 103 int main() 104 E{ 105 Deque deque (5); 106 deque.push(17); deque. inject(10); deque.inject(23); 109 deque.inject(16); 110 111 cout << "Initial contents:\n"; 112 deque.show(); 113 114 cout << "\nDeleting from front: \n"; 115 cout << "Item deleted = " << deque.pop() << endl; 116 cout << "\nContents after deleting: \n"; 117 deque.show(); 118 119 cout << "\nDeleting from rear: \n"; 120 cout << "Item deleted = " << deque.eject() << endl; cout << "\nContents after deleting: \n"; 122 deque.show(); 123 124 cout << "\nPushing an element at the front: \n"; 125 deque.push(21); 126 cout << "Contents after pushing to the front:\n"; deque.show(); 128 return 0; 129 } 121 127

CONSOLE OUTPUT:

clang version 7.0.0-3-ubuntu0.18.04.1 (tags/RELEASE 700/final), ? clang++-7 -pthread -o main main.cpp 3./main Initial contents: 17 10 23 16 Deleting from front: Item deleted = 17 Contents after deleting: 10 23 16 Deleting from rear: Item deleted = 16 Contents after deleting: 10 23 Pushing an element at the front: Contents after pushing to the front: 21 10 23