Question

In C++

Task 3: Use the stack and queue to simulate receiving and transforming data We are creating a system that will convert strings sent over a serial bus one character at a time. The conversion will be from big to little endian or from little to big endian. To simplify this, each character will be considered a word. Little endian will have the lowest address first. Big endian will have the biggest address first. For example (for this lab), the string "Data Structures" takes 15 characters excluding the null terminator. Assuming the 'D' is stored in address 0x1000 the last character would be stored in 0x100F. A little endian would pass the ‘D' first and the big 35 endian would pass the 's' first. 1. Write a program to simulate this system You will need a stack and a queue for the receiver. Each should be using an array of characters with a max size of 25. a. b. The sender will transmit data 1 character at a time to the recipient using big endian The recipient will store each character in a buffer (queue) until a null terminator is c. received d. The recipient will then transform the data from big endian to little endian using the queue and stack and store it in a message string variable. You can only use the enqueue and dequeue functions of the queue and push and pop functions of the stack to access the arrays Include in your main a way for the user to enter a message and send. Once the user sends the message, you should display the contents of the queue (create a print queue function in the queue class) with the entire message in it, display the contents of the stack (create a print stack function in the stack class), and display the transformed message. e. f. The main program should be written in such a way that it can send multiple messages without needing to be restarted.

Answer 1

#include<bits/stdc++.h>
using namespace std;

class Stack
{
public:      
   char stack[25];                           //declaring stack array in class Stack
   int top=-1;
  
   void push(char element)                   //push function
   {
       top++;
       stack[top]=element;
   }
  
   char pop()                               //pop function
   {
       char element=stack[top];
       top--;
       return element;
   }
  
   void print()                           //function for printing topmost element of stack
   {
       cout<<stack[top];
   }
};

class Queue
{
public:      
   char queue[25];                           //declaring queue array in class Queue
   int front=0,rear=0;
  
   void enqueue(char element)               //enqueue function
   {
   queue[rear] = element;
rear++;
   }
  
   char dequeue()                            //dequeue function
   {
       char element=queue[front];
   queue[front] = 0;
front++;
return element;
   }
  
   void print()                           //function for printing first element in queue
   {
       cout<<queue[front];
   }
};

int main()
{
   for(int i=1;i>0;i++)
   {
       string x;
       cout<<"Enter '1' to send a message or '2' to exit program and press Enter key(without quotes)"<<endl;
       getline(cin,x);
      
       if(x[0]=='1')
       {
           string s;
           Stack S;
           Queue Q;
           cout<<"Enter message to be send : ";
           getline(cin,s);
           int L=s.length();
          
           for(int i=0;i<L;i++)                       //message stored in queue(buffer according to question)
               Q.enqueue(s[i]);
              
           cout<<"Content of Queue : ";
           for(int i=0;i<L;i++)
           {
               Q.print();                               //printing the contents of Queue
               char element=Q.dequeue();               //transforming the message using Queue and Stack
               S.push(element);
           }
           cout<<endl;
          
           cout<<"Content of Stack : ";
           string transformed_message[L];
           for(int i=0;i<L;i++)
           {
               S.print();                               ////printing the contents of Queue
               transformed_message[i]=S.pop();
           }
           cout<<endl;
       }
       else
           break;
   }
}