Merge pull request #1 from Alok02Jha/master

Add files via upload

Author: sukhdev01

248.DequeueUsingArrayC++ (1).txt

@@ -0,0 +1,134 @@
+#include <iostream>
+
+using namespace std;
+ 
+class DEQueue{
+private:
+ int front;
+ int rear;
+ int size;
+ int* Q;
+ 
+public:
+ DEQueue(int size);
+ ~DEQueue();
+ void display();
+ void enqueueFront(int x);
+ void enqueueRear(int x);
+ int dequeueFront();
+ int dequeueRear();
+ bool isEmpty();
+ bool isFull();
+};
+ 
+DEQueue::DEQueue(int size) {
+ this->size = size;
+ front = -1;
+ rear = -1;
+ Q = new int [size];
+}
+ 
+DEQueue::~DEQueue() {
+ delete [] Q;
+}
+ 
+bool DEQueue::isEmpty() {
+ if (front == rear){
+ return true;
+ }
+ return false;
+}
+ 
+bool DEQueue::isFull() {
+ if (rear == size - 1){
+ return true;
+ }
+ return false;
+}
+ 
+void DEQueue::enqueueFront(int x) {
+ if (front == -1){
+ cout << "DEQueue Overflow" << endl;
+ } else {
+ Q[front] = x;
+ front--;
+ }
+}
+ 
+void DEQueue::enqueueRear(int x) {
+ if (isFull()){
+ cout << "DEQueue Overflow" << endl;
+ } else {
+ rear++;
+ Q[rear] = x;
+ }
+}
+ 
+int DEQueue::dequeueFront() {
+ int x = -1;
+ if (isEmpty()){
+ cout << "DEQueue Underflow" << endl;
+ } else {
+ x = Q[front];
+ front++;
+ }
+ return x;
+}
+ 
+int DEQueue::dequeueRear() {
+ int x = -1;
+ if (rear == -1){
+ cout << "DEQueue Underflow" << endl;
+ } else {
+ x = Q[rear];
+ rear--;
+ }
+ return x;
+}
+ 
+void DEQueue::display() {
+ for (int i=front+1; i<=rear; i++) {
+ cout << Q[i] << flush;
+ if (i < rear){
+ cout << " <- " << flush;
+ }
+ }
+ cout << endl;
+}
+ 
+int main() {
+ 
+ int A[] = {1, 3, 5, 7, 9};
+ int B[] = {2, 4, 6, 8};
+ 
+ DEQueue deq(sizeof(A)/sizeof(A[0]));
+ 
+ for (int i=0; i<sizeof(A)/sizeof(A[0]); i++){
+ deq.enqueueRear(A[i]);
+ }
+ deq.display();
+ deq.enqueueRear(11);
+ 
+ for (int i=0; i<sizeof(A)/sizeof(A[0]); i++){
+ deq.dequeueFront();
+ }
+ deq.dequeueFront();
+ 
+ cout << endl;
+ 
+ for (int i=0; i<sizeof(B)/sizeof(B[0]); i++){
+ deq.enqueueFront(B[i]);
+ }
+ deq.display();
+ deq.enqueueFront(10);
+ deq.enqueueFront(12);
+ 
+ for (int i=0; i<sizeof(B)/sizeof(B[0]); i++){
+ deq.dequeueRear();
+ }
+ deq.display();
+ deq.dequeueRear();
+ deq.dequeueRear();
+ 
+ return 0;
+}

250.QueueUsing2STLStacksC++ (1).txt

@@ -0,0 +1,64 @@
+#include <iostream>
+#include <stack>
+
+using namespace std;
+ 
+class Queue{
+private:
+ stack<int> e_stk;
+ stack<int> d_stk;
+public:
+ Queue(){};
+ ~Queue(){};
+ void enqueue(int x);
+ int dequeue();
+};
+ 
+void Queue::enqueue(int x) {
+ e_stk.push(x);
+}
+ 
+int Queue::dequeue() {
+ int x = -1;
+ if (d_stk.empty()){
+ if (e_stk.empty()){
+ cout << "Queue Underflow" << endl;
+ return x;
+ } else {
+ while (!e_stk.empty()){
+ d_stk.push(e_stk.top());
+ e_stk.pop();
+ }
+ }
+ }
+ x = d_stk.top();
+ d_stk.pop();
+ return x;
+}
+ 
+int main() {
+ 
+ int A[] = {1, 3, 5, 7, 9};
+ 
+ Queue q;
+ 
+ cout << "Enqueue: " << flush;
+ for (int i=0; i<sizeof(A)/sizeof(A[0]); i++){
+ q.enqueue(A[i]);
+ cout << A[i] << flush;
+ if (i < sizeof(A)/sizeof(A[0])-1){
+ cout << " <- " << flush;
+ }
+ }
+ cout << endl;
+ 
+ cout << "Dequeue: " << flush;
+ for (int i=0; i<sizeof(A)/sizeof(A[0]); i++){
+ cout << q.dequeue() << flush;
+ if (i < sizeof(A)/sizeof(A[0])-1){
+ cout << " <- " << flush;
+ }
+ }
+ 
+ return 0;
+}