Problem 1: Consider an array-based queue implementation. Suppose we wish to use an extra bit in queue records to indicate whether a queue is empty. 1. Modify the declarations and operations for a circular queue to accommodate this feature. 2. Would you expect the change to be worthwhile?

c) Given a Python Queue class implemented with the abstract data type (ADT) below, write a new method popqueue(), which will “pop" (remove and return) the last-in element from the rear end of the queue. | Operation (Queue) Description sizeQ():int | GIVEN: Get (and return) the size of the queue (total number of elements) enqueue (elt): dequeue (): elt popqueue(): elt Remove (and return) the last-in element from rear end of Queue GIVEN: Insert elt into Queue GIVEN: Remove (and return) element from Queue Finish this new Python popqueue () method, by completing the method body below: def popqueue ( self ): # remove and return rear elt # body of the method. TO BE COMPLETED by student o No other extra variable could be added including Python's list, except int and range with function range(). o No more than 4 lines of typical python code (without semicolon symbol ;) allowed in the method body. * Hint: you may finish this task using its own given methods of the Queue class, and a for loop…

5. Given an efficient circular bent array-based queue q capable of holding 7 objects. Show the final contents of the array after the following code is executed: for (int k = 1; k <= 6; k++) q.enqueue(k); for (int k = 1; k <= 3; k++) { q.dequeue(); q.enqueue(q.dequeue()); } 0 1 2 3 4 5 6

1. consider an array based queue implementation. suppose we wish to use an extra bit in the queue records to indicate whether a queue is empty. a. Modify the declarationsand operations for a circular queue to accomodate this feature. b. Would you see the change to be worthwide.

29The Java interface construct is used to create a formal specification of our Queue ADT. T OR F

a) Given a typical Queue q with elements [E,D,C,B,A] (where Front/left of Queue at E and Rear/right of Queue at A), determine and list elements of the updated Queue in the similar form (Front/left and Rear/right), after the following execution: q.enqueue( q. dequeue() ) q. enqueue( G ) q.dequeue() b) Given a typical Stack s with elements [T,W,X,Y,Z] (where Top/left of Stack at T) and a typical Queue q with elements [E,D,C,B,A] (where Front/left of Queue at E and Rear/right of Queue at A), determine and list elements of the updated Stack and those of the updated Queue in their similar forms after the following execution: q. enqueue( s.pop() ) s.push( R ) q.enqueue( s. peek () ) s. push( q.dequeue() ) q.enqueue( s. pop() ) OP

If the sequence number space is k bits large, you should seriously consider using both the selective-repeat technique and the Go-Back-N strategy in your search for a solution. What is the maximum allowable size for the sender window that we are allowed to make use of?