Data Structures and Algorithms. JAVA. 5. Show what is written by the following s
ID: 3577038 • Letter: D
Question
Data Structures and Algorithms. JAVA.
5. Show what is written by the following segment of code:
MyQueue<String> queue = new MyQueue<String>();
String item0 = “”;
String item1 = “B”;
String item2 = item1 + “E”;
String item3 = “P”;
queue.enqueue (item2);
queue.enqueue (item2 + “E”);
queue.enqueue (item1);
queue.dequeue();
item1 = item2 + “E”;
queue.enqueue (item1);
queue.enqueue (item3);
while (!queue.isEmpty())
{
item0 = queue.dequeue();
System.out.print (“Item: ” + item0);
}
System.out.print (“Item0: ” + item0);
System.out.print (“Item1: ” + item1);
System.out.print (“Item2: ” + item2);
System.out.print (“Item3: ” + item3);
Answer:
Explanation / Answer
Hi, Please fiind output:
BEE BEE P P BEE BE P
Explanation:
MyQueue<String> queue = new MyQueue<String>();
// Content of queue = front part =>{empty} <= rear part
String item0 = “”;
String item1 = “B”;
String item2 = item1 + “E”; // item2 = "BE"
String item3 = “P”;
queue.enqueue (item2); // front part =>{ "BE" } <= rear part
queue.enqueue (item2 + “E”); // front part =>{ "BE", "BEE" } <= rear part
queue.enqueue (item1); // front part =>{ "BE", "BEE", "B" } <= rear part
queue.dequeue(); // front part =>{BEE" } <= rear part
item1 = item2 + “E”; // item1 = "BE" + "E" = "BEE"
queue.enqueue (item1); // front part =>{BEE", "BEE" } <= rear part
queue.enqueue (item3); // front part =>{BEE", "BEE", "P" } <= rear part
while (!queue.isEmpty())
{
item0 = queue.dequeue();
System.out.print (“Item: ” + item0);
}
Output of while loop:
BEE BEE P
After while loop: item0 = "P" // last element of queue
System.out.print (“Item0: ” + item0); // P
System.out.print (“Item1: ” + item1); // BEE
System.out.print (“Item2: ” + item2); // BE
System.out.print (“Item3: ” + item3); // P
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.