Question: a. Stack color = new Stack(5); b. Queue shape = new Queue(5); String x, y; d. S.push(blue); S.push(orange); f Q.enqueue(green); Q.enqueue(red); h. x=S.peekTop(); i. Q.enqueue(x);

a. Stack color = new Stack(5); b. Queue shape = new Queue(5); String x, y; d. S.push("blue"); S.push("orange"); f Q.enqueue("green"); Q.enqueue("red"); h. x=S.peekTop(); i. Q.enqueue(x); System.out.println("Popped: "+S.pop(); k. y=Q.dequeue(); 1. System.out.println("Removed: "+y); m. S.push(y); Q.enqueue(y); Q.enqueue("brown'); p. System.out.println("Front from Q:" +Q.peekFront()); 9. System.out.println("Top from S:" +S.peekTop(); System.out.println("Stack size: "+S.size(); System.out.println("Queue size: "+Q.size(); j. n. 0. r. S. After the code is executed, a) Show the output from the above program. (3.0 marks) b) List all the contents of the stack and queue. (1.5 marks) For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
