QueueArray.java This file implements QueueInterface.java This file has  * attributes of an array holding queue elements. An integer represents front  * index, an integer for rear index, and an integer to keep track number of  * elements in the queue. An overloaded constructor accepts an integer for  * initializing the queue size, e.g. array size. An enqueue method receives an  * object and place the object into the queue. The enqueue method will throw  * exception with message "Overflow" when the queue is full. A dequeue method  * returns and removes an object from front of the queue. The dequeue method  * will throw exception with message "Underflow" when the queue is empty. A size  * method returns number of elements in the queue. A toString method returns a  * String showing size and all elements in the queue.

determine if the statement is true or false If N represents the number of elements in the queue, then the size method of the ArrayBoundedQueue class is O(N).

b. Write out the order of elements that are contained in a queue after the following operations are performed. myQueue.enqueue(new Integer(16)); myQueue.enqueue(new Integer(12)); Integer num1 = myQueue.dequeue(); myQueue.enqueue(new Integer(6)); myQueue.enqueue(new Integer(8)); myQueue.enqueue(new Integer(30)); myQueue.enqueue(new Integer(24)); myQueue.enqueue(new Integer(18)); myQueue.dequeue(); myQueue.dequeue(); myQueue.dequeue(); myQueue.enqueue(new Integer(38); Show how step by step process of arriving at your answer.

A student record system uses an ArrayList object called studrecs tomaintain a collection of student details where each student is anobject defined by the Student class. The student class has accessormethods getName() and getRegNo()Write a for-each loop that iterates through the studrecs collectionwriting out each student’s name and registration number.

Change the __str__ method of the Queue class (provided below) so that it prints each object in the queue along with its order in the queue (see sample output below). class Queue():  def __init__(self):    self.queue = [] # implement with Python lists!    # start of physical Python list == front of a queue    # end of physical Python list == back of a queue   def enqueue(self, new_obj):    self.queue.append(new_obj);   def dequeue(self):    return self.queue.pop(0)  def peek(self):   return self.queue[0]  def bad_luck(self):     return self.queue[-1]  def __str__(self):    return str(self.queue) # let's try a more fun waySample output: >>> my_queue = Queue()>>> everyone = ["ESC", "ABC", "YOLO", "HTC"]>>> for initials in everyone:>>>  my_queue.enqueue(initials)>>> print(my_queue)Output: 1: ESC2: ABC3: YOLO4: HTC

You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…

Problem 7: Assume that a queue class called XQueue has a no argument constructor, an enqueue() method, a dequeue() method and an isEmpty() method. Write a method that merges two given queues by copying the elements in an alternating sequence and returning the resulting combined queue. Note: make sure that you don't include unnecessary spaces in your answer! public XQueue merge(XQueue q1, XQueue q2) { XQueue neWQueue = new XQueue(); while (!q1.isEmpty() && !q2.isEmpty()) { newQueue.enqueue( #01 ); newQueue.enqueue( #02); } while (!q1.isEmpty()) { #03 ; } while (!q2.is Empty()) { #04 ; } return newQueue (); }

DONT use any of the list methods (append, pop etc.). class mycircularqueue():        def __init__(self, m = 10):        self.maxsize = m        self.array = [None]*m        self.FRONT = self.REAR = -1                def enqueue(self, item):         # Inserts item at the rear of a non full queue and returns True. If unable to insert the item returns false                #######################################################################        # Remove the pass statement and write your code        #######################################################################        pass     def dequeue(self):        # Removes the item from the front of the queue and returns it. For unsuccessful dequeue return False                #######################################################################        # Remove the pass statement and write your code        #######################################################################        pass        def peek(self):        # Returns the…