Implementation of Queue using Array

 _________________________Main.cpp_____________________________________


#include"OwnQueue.h"



int main()

{

    std::cout << "MY.. QUEUE!\n" << endl;

    OwnQueue queue;

    queue.dequeue();

    queue.enqueue(10);

    queue.enqueue(20);

    queue.enqueue(0);

    queue.enqueue(40);

    cout << queue.peek() << endl;

    queue.enqueue(50);

    queue.enqueue(70);

    cout << queue.isempty() << endl;

    cout << queue.isfull() << endl;

    queue.dequeue();

    queue.dequeue();

    queue.dequeue();

    queue.dequeue();

    cout << queue.peek() << endl;

    queue.dequeue();

    queue.dequeue();


    cout << queue.isempty() << endl;

    cout << queue.isfull() << endl; 


    queue.printqueue();

return 0;

}




_____________________________Header file content____________________________________

#pragma once

#include<iostream>

using namespace std;


#define MAXSIZE 5


class OwnQueue

{

int front, rear;

int queue[MAXSIZE];

public :

OwnQueue();

void enqueue(int data);

void dequeue();

int peek();

bool isempty();

bool isfull();

void printqueue();

};


_________________________.cpp file content __________________________________

#include "OwnQueue.h"

OwnQueue::OwnQueue() :front(-1),

rear(-1)

{

}


void OwnQueue::enqueue(int data)

{

if (rear == MAXSIZE-1)

{

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

}

else if ((front == -1))

{

front = rear = 0;

queue[rear] = data;

}

else

{

rear = rear+1;

queue[rear] = data;

}

}


void OwnQueue::dequeue()

{

  if ((rear == -1))

{

cout << "Queue size is empty" << endl;

}

else

{

constexpr int length = sizeof(queue) / sizeof(queue[0]) - 1;

int temp[length];

int j = 0;

int deldata = queue[front];

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

{

temp[j] = this->queue[i];

j++;

}


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

{

this->queue[i] = temp[i];

}


rear = rear - 1;

cout << "deque data " << deldata << endl;

}

}


int OwnQueue::peek()

{

return queue[front];

}


bool OwnQueue::isempty()

{

if (rear == -1)

{

return true;

}


return false;

}


bool OwnQueue::isfull()

{

if (rear == MAXSIZE-1)

{

return true;

}

return false;

}


void OwnQueue::printqueue()

{

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

{

cout << "data in queue " << queue[i] << endl;

}

}


Comments

Post a Comment

Popular posts from this blog

Dynamic Memory allocation in C++ for 1d, 2d and 3d array

#include <iostream> #define N 10 // Dynamically Allocate Memory for 1D Array in C++ int main() { // dynamically allocate memory of size N int* A = new int[N]; // assign values to allocated memory for (int i = 0; i < N; i++) A[i] = i + 1; // print the 1D array for (int i = 0; i < N; i++) std::cout << A[i] << " "; // or *(A + i) // deallocate memory delete[] A; return 0; } //2-Dimentional Array. // using single pointer; #include <iostream> // M x N matrix #define M 4 #define N 5 // Dynamically Allocate Memory for 2D Array in C++ int main() { // dynamically allocate memory of size M*N int* A = new int[M * N]; // assign values to allocated memory for (int i = 0; i < M; i++) for (int j = 0; j < N; j++) *(A + i*N + j) = rand() % 100; // print the 2D array for (int i = 0; i < M; i++) { for (int j = 0; j < N; j++) std::cout << *(A + i*N + j) << "
Read more

Write Your Own String Class:

class OwnString { private : char *string1 = NULL; int size; public: OwnString(void) { string1 = NULL; } OwnString(const char * strData) { size = strlen(strData); string1  = new char[size + 1]; int i = 0; while (*strData) { string1[i] = *strData; strData++; i++; } } OwnString & operator=(OwnString & obj) { if (this != &obj) { delete[]string1; size = obj.size; string1 = new char[size+1]; int i = 0; while (i<size+1) { string1[i] = obj.string1[i]; //strData++; i++; } } return *this; } OwnString (const OwnString & obj) { if (this != &obj) { delete[]string1; size = obj.size; string1 = new char[size + 1]; int i = 0; while (i < size + 1) { string1[i] = obj.string1[i]; //strData++; i++; } } } void print() { for (int i = 0; i < size; i++) { cout << string1[i]; }
Read more

Printing the odd and even no using Pthread

#include<iostream> #include <pthread.h> using namespace std; void *even(void * size) {             int x = reinterpret_cast<int> (size);         cout << "even no" <<endl;     for(int i = 0; i<x; i++)     {         if(i%2 == 0){                         cout << i << endl;         }             }     cout <<endl;     cout <<"even thread is terminited ";     cout <<endl; } void *odd(void *size ) {     pthread_t tid2;         int x = reinterpret_cast<int> (size);         cout << "odd no" <<endl ;     for(int i = 0; i<x; i++)     {         if(i%2 != 0){                         cout << i <<endl ;         }             }             pthread_create(&tid2, NULL, even, (void*)x);         cout <<endl;     pthread_join(tid2, NULL);         cout <<"odd thread is terminited ";     cout <<endl; } int main() {     int size;         cout <<
Read more