Design a queue abstract data type for float elements in a language that you know, including operations for enqueue, dequeue, and empty. The dequeue operation removes the element and returns its value

write operations which can be performed on queues in data structure?

class Queue {      private static int front, rear, capacity; private static int queue[];  Queue(int c) {  front = rear = 0;  capacity = c;  queue = new int[capacity]; }  static void queueEnqueue(int data) {   if (capacity == rear) {   System.out.printf("\nQueue is full\n");   return;  }     else {   queue[rear] = data;   rear++;  }  return; }  static void queueDequeue() {    if (front == rear) {   System.out.printf("\nQueue is empty\n");   return;  }   else {   for (int i = 0; i < rear - 1; i++) {    queue[i] = queue[i + 1];   }       if (rear < capacity)    queue[rear] = 0;       rear--;  }  return; }   static void queueDisplay() {  int i;  if (front == rear) {   System.out.printf("\nQueue is Empty\n");   return;  }     for (i = front; i < rear; i++) {   System.out.printf(" %d <-- ", queue[i]);  }  return; }   static void queueFront() {  if (front == rear) {   System.out.printf("\nQueue is Empty\n");   return;  }  System.out.printf("\nFront Element is: %d", queue[front]);…

Lists and tuples are two distinct data structures.

Java data struc

Stack: Stacks are a type of container with LIFO (Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only. Your Stack should not be of the fixed sized. It should be able to grow itself. bool empty() : Returns whether the Stack is empty or not. Time Complexity should be: O(1) bool full() : Returns whether the Stack is full or not. Time Complexity should be: O(1)int size() : Returns the current size of the Stack. Time Complexity should be: O(1)Type top () : Returns the last element of the Stack. Time Complexity should be: O(1) void push(Type) : Adds the element of type Type at the top of the stack. Time Complexity    should be: O(1) Type pop() : Deletes the top most element of the stack and returns it. Time Complexity    should be: O(1) Write non-parameterized constructor for the above class. Write Copy constructor for the above class. Write Destructor for the above class. Now write a global function show stack which…