//
//
//#include<iostream>
//#include<string>
//#include<stdlib.h>
//using namespace std;
//class cicularqueue {
//private:
//int *data;
//int size = 10;
//int front=0;
//int rear=0;
//
//public:
//cicularqueue();
//
//
//
//void Enqueue();
//void Dequeue();
//
//
//};
//
//cicularqueue::cicularqueue() {
//
//data = new int[size];
//this->front = 0;
//this->rear = 0;
//
//this->size = 10;
//
//
//}
//
//
//void cicularqueue::Enqueue() {
//int d;
//if (rear == size) {
//cout << "Queue is Full:";
//}
//else {
//
//cout << "Enter Data:";
//cin >> d;
//data[rear] = d;
//cout << " Data Enqueued is:"<< data[rear];
//rear=(rear+1)%size;
//
//
//
//}
//}
//
//
//
//
//
//void cicularqueue::Dequeue() {
//int temp=0;
//int temp1=0;
//float temp2=0;
//
//if (rear == size) {
//cout << "\n\tQueue is Empty:";
//}
//else {
//cout << ".Dequeued data is :" << data[front];
//temp1 = data[front];
//temp = temp + temp1;
// data[front]=0;
//front = (front + 1) % size;
//
//}
//cout << "..Average of Dequeued data is:" << temp2;
//}
//
//void main() {
//cicularqueue cq;
//
//for (int i = 0; i < 10; i++)
//{
//cq.Enqueue();
//}
//
//cq.Dequeue();
//cq.Dequeue();
//cq.Dequeue();
//cq.Dequeue();
//
//cq.Enqueue();
//cq.Enqueue();
//cq.Enqueue();
//cq.Enqueue();
//
//cout << endl;
//
//}
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//////////////.....................................Q 2...........................................
//////#include<iostream>
//////#include<string>
//////#include<stdlib.h>
//////using namespace std;
//////class cicularqueue {
//////private:
//////int data[5];
//////int size = 5;
//////int front=0;
//////int rear=0;
//////int count = 0;
//////
//////
//////
//////public:
//////cicularqueue();
//////
//////
//////
//////
//////void Enqueue();
//////void Dequeue (cicularqueue* q1, cicularqueue* q2);
//////
//////
//////};
//////
//////cicularqueue::cicularqueue() {
//////
//////data[5] = 0;
//////this->front = 0;
//////this->rear = 0;
//////this->count = 0;
//////this->size = 5;
//////
//////
//////}
//////
//////
//////void cicularqueue::Enqueue() {
//////int d;
//////if (rear == size) {
//////cout << "Queue is Full:";
//////}
//////else {
//////
//////cout << "Enter Data:";
//////cin >> d;
//////data[rear] = d;
//////cout << " Data Enqueued is:"<< data[rear];
//////rear=(rear+1)%size;
//////
//////count++;
//////
//////}
//////}
//////
//////
//////
//////
//////void cicularqueue::Dequeue(cicularqueue* q1,cicularqueue* q2) {
//////int temp;
//////
//////if (count == 0) {
//////cout << "\n\tQueue is Empty:";
//////}
//////else {
//////temp = q1->data[front];
//////q2->data[rear] = temp;
//////cout << "Enqueued data in Queue2 successfully :" << q2->data[rear];
////// q1->data[front]=0;
//////front = (front + 1) % size;
//////count--;
//////
//////}
//////
//////
//////
//////}
//////
//////
//////void main() {
//////cicularqueue q;
//////cicularqueue q2;
//////
//////
//////cout << "Enter data In Queue1";
//////for (int i = 0; i < 5; i++)
//////{
//////
//////q.Enqueue();
//////}
//////cout << "tEnter data In Queue2";
//////for (int i = 0; i < 5; i++)
//////{
//////q2.Enqueue();
//////}
//////
//////
//////
//////q.Dequeue(&q,&q2);
//////
//////
//////q.Enqueue();
//////
//////cout << endl;
//////
//////}
//////
//////