Assume you are using a array-based queue and have just instantiated a queue of capacity 10. You enqueue 5 elements, dequeue 5 elements, and then enqueue 1 more element. Which index of the internal array elements holds the value of that last element you enqueued? A.  0. B.  1  C.  4.  D.  5.  E.  6

Assume a linked list contains following integers: 7, 2, 9, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; Node<int> *aNode; int s; while(curNode!=NULL){ {       aNode=curNode;       curNode=curNode->getNext(); } s=aNode->getItem();   A. 15 B. 3 C. 7 D. 2

If the following is a circular array based queue of size 99 43 54 76 93 77 18 If rear is at index 1 and front is at index 6, what is the size of the queue? Answer:

I have implemented a stack using arrays. The array is 5 elements long and is called examstack. The contents are: examstack[0] = 36 examstack[1] = 49 examstack[2] = 7 examstack[3] = 67 examstack[4] = 9 If I did a Pop what would be returned? 9 or 36 09 07 O 67 O 9 or 67 36 or 49 O 36 49

If front=2 and rear=5, how many elements are there in an array-based queue (note: rear is pointing at the next free location) O 3 4 2 5

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…

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…