Z-Z-X; Z=Y-Z: ENQUEUE (Q.Z): DEQUEUE (Q,Y): X=Y-Z: ENQUEUE (Q.Y): Value of Y? Value of X? 3rd element in the Queue? Front in the Queue? Value of X? No. of elements in the Queue? TEST I. STACKS AND QUEUES SIMULATION. Simulate the following algorithms and answer the corresponding questions written on the opposite side of each statement. (40 points - 1 point each) ALGORITHM 1: CLEARSTACK(S); X=1; Y=2; Z=3; PUSH (S,Y); PUSH (S,Y); PUSH (S,Y*Y+2); PUSH (S,5); POP (S,X); Top of the stack? Value of Y? 2nd element of stack? POP (S,Z); POP (S,Y); PUSH (S,X+Y); PUSH (S,Y*Z); PUSH (S,X+1); X=Y; Value of X? Bottom of the Stack? No. of Elements in the Stack? Value of X? Y=Z; Z=X; PUSH (S,X+Y+Z); POP (S,Y); PUSH (S,Z); PUSH (S,X+Y); PUSH (S,Y*Z); POP (S,Z); POP (S,X); Z=Z-X; Z=Y-Z; PUSH (S,Z); POP (S,Y); X=Y-Z; PUSH (S,Y); ALGORITHM 2: CLEARQUEU(Q); Value of Z? Value of Y? 4th element of Stack? Top of the Stack? No. of elements in Stack? Value of Y? Value of X? Value of Y? Value of X? 3rd element of Stack? Top of the Stack? Value of X? No. of elements in Stack? X=1; Y=2; Z=3; ENQUEUE (Q,Y); ENQUEUE (Q,Y); ENQUEUE (Q,Y*Y+2); Front of the queue? Value of Y? 2nd element of queue? ENQUEUE (Q,5); DEQUEUE (Q,X); DEQUEUE (Q,Z); DEQUEUE (Q,Y); ENQUEUE (Q,X+Y); ENQUEUE (Q,Y*Z); ENQUEUE (Q,X+1); X=Y; Value of X? Rear of the Queue? No. of ElementQ in the Queue? Value of X? Y=Z; Z=X; ENQUEUE (Q,X+Y+Z); DEQUEUE (Q,Y); ENQUEUE (Q,Z); ENQUEUE (Q,X+Y); ENQUEUE (Q,Y*Z); DEQUEUE (Q,Z); DEQUEUE (Q,X); Value of Z? Value of Y? 4th element in the Queue? Front in the Queue? No. of elementQ in the Queue? Value of Y? Value of X?

The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.

How is an array stored in main memory? How is a linked list stored in main memory? What are their comparative advantages and disadvantages? Give examples of data that would be best stored as an array and as a linked list.