Write a program that will take 10 integer values from the user. a. If the entered value is Even then enqueue it into a queue at even index and if the entered value is Odd then enqueue it into a queue at odd index. (Note: Even index will start from 0 & odd will start from 1 ). b. Dequeue the values and display the sum of the even values and the sum of the odd values.

-

 



Write a program that will take 10 integer values from the user.

a. If the entered value is Even then enqueue or link-list it into a queue at even index and if the entered value is Odd then enqueue it into a queue at odd index. (Note: Even index will start from 0 & odd will start from 1 ).

b. Dequeue the values and display the sum of the even values and the sum of the odd values.  

Answer:

C++ code:

#include "stdafx.h"


#include "iostream"

#include "conio.h"

 

using namespace std;

struct queue

{

 

int front, rear, size, data[10];

public:

     int even_sum = 0;

     int odd_sum = 0;

     queue()

     {

           front = 0;

           rear = -1;

           size = 10;

     }

     void enqueue(int x)

     {

           if (rear == 9)

           {

cout << "Queue is full no more elements can be insert" << endl;

           }

           else

           {

                ++rear;

                if (rear%2==0)

                {

                     data[rear] = x;

                }

                else

                {

                     data[rear] = x;

                }

           }

     }

     void dequeue()

     {

           if (front ==size)

           {

                cout << "Queue is already Empty" << endl;

           }

           front++;

     }

     void show()

     {

           int i = front;

           while (i <= rear)

           {

                cout << data[i++] << endl;

           }

     }

     void even_oddsum()

     {

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

           {

                if (data[i] % 2 == 0)

                {

                     even_sum = even_sum + data[i];

                }

                else

                {

                     odd_sum = odd_sum + data[i];

                }

           }

           cout << "Sum of Even Integers = " << even_sum << endl;

           cout << "Sum of odd Integers = " <<odd_sum << endl;

     }

};

  

int _tmain(int argc, _TCHAR* argv[])

{

     queue q1;

     q1.enqueue(0);

     q1.enqueue(1);

     q1.enqueue(2);

     q1.enqueue(3);

     q1.enqueue(4);

     q1.enqueue(5);

     q1.enqueue(6);

     q1.enqueue(7);

     q1.enqueue(8);

     q1.enqueue(9);

     cout << "After Inserting all values in Queue" << endl;

     q1.show();

     cout << "---------------------------" << endl;

     q1.dequeue();

     q1.dequeue();

     q1.show();

     cout << "After deleting values from Queue" << endl;

     q1.show();

     q1.even_oddsum();

 

          

     _getch();

     return 0;

}


Thank You!!!........)


Comments

Post a Comment

Popular posts from this blog

Oop(Object Oriented Programming) Project for final year students

-
Image
  Project Description: Write the C++ Code for the following parts                                                    A.     Create a class Product. Also create two descendants (derived from Product class) Food and Clothes. B.      The class Product must have a data members Product_Id, Price and Name. It contains a constructor to initialize the data members and “getdata ()” method to store the values in data members. C.      The class " Clothes " will have additional data members Color. The Clothes class also contains a constructor to initialize the data members and “getdata ()” method to store the values in data members. It additionally contains ·          storedata () method to store data in file named as “Clothes.txt” ·          readdata () method to read all information from this file ·          deletedata () to delete specific product from file ·          updatedata () to update any record ·          searchdata () to search the details of specific product entere
Read more

Linklist all concepts using Dynamic arrays(using nodes)

-
Image
  Double Link List (Add and Show nodes) #include <iostream> using namespace std; struct node {     int data;     node* pre, *nxt; }; class Link_List {         node *head, *current;     public:         Link_List()         {             head=current=NULL; // Means at the most link list has no node.         }        void List_Add(int n)         {             node*tempNode;             tempNode=new node;             tempNode->data=n;             tempNode->pre=NULL;             tempNode->nxt=NULL;             if(head==NULL)             {                 current=head=tempNode;             }             else             {                 current->nxt=tempNode;                 tempNode->pre=current;                 current=tempNode;             }         }         void show_Forward()         {             node *tempNode=head;             while(1)             {                 cout<<"\t"<<tempNode->data<<endl;                 if(tempNode->n
Read more

Write a C++ program to implement a suitable data structures (using array) of marble plates

-
Image
  Write a C++ program to implement a suitable data structures (using array) of marble plates. Your program should cover the following scenario, Suppose a waiter in a hotel is collecting plates from different tables and giving to dish washer. Dish washer is washing plates and throwing them into rack of plates. Some plates hit others very hard to break other (one above it) and/or itself. You need to develop an application that will find how many plates are broken and plates from which tables are broken. You will identify plates with unique numeric identity number. Every 5 th plate thrown into rack will break itself and one plate below it while every 7th plate will only break itself. Answer: #include "stdafx.h" #include "iostream" #include "conio.h" using namespace std; class Dishwasher { private :       int data[10];       int top;       int bottom;       int size; public :      Dishwasher() {            top = -1;            bottom = 0;        
Read more