Exercise #5 What is the output of the following code? а. import java.util.LinkedList; import java.util.Queue; public class QueueExample { public static void main(String[] args) Queueq= new LinkedList<>(); for (int i = 0; i <7; i+=2) q.add(i); System.out.println("Elements of queue "+ q); int e = q.remove(); System.out.println("removed element-"+ e); e = q.remove(); System.out.println("removed element-"+ e); q.add(4); System.out.println(q); int head = q.peek(); System.out.println("head of queue-"+ head); System.out.println(q); int size = q.size(); System.out.println("Size of queue-"+ size);

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Exercise #5 What is the output of the following code?
а.
import java.util.LinkedList;
import java.util.Queue;
public class QueueExample {
public static void main(String[] args)
Queue<Integer>q=new LinkedList<>();
for (int i = 0; i <7; i+=2)
q.add(i);
System.out.println("Elements of queue "+ q);
int e = q.remove();
System.out.println("removed element-"+ e);
e = q.remove();
System.out.println("removed element-"+ e);
q.add(4);
System.out.println(q);
int head = q.peek();
System.out.println("head of queue-"+ head);
System.out.println(q);
int size = q.size();
System.out.println("Size of queue-"+ size);
Transcribed Image Text:Exercise #5 What is the output of the following code? а. import java.util.LinkedList; import java.util.Queue; public class QueueExample { public static void main(String[] args) Queue<Integer>q=new LinkedList<>(); for (int i = 0; i <7; i+=2) q.add(i); System.out.println("Elements of queue "+ q); int e = q.remove(); System.out.println("removed element-"+ e); e = q.remove(); System.out.println("removed element-"+ e); q.add(4); System.out.println(q); int head = q.peek(); System.out.println("head of queue-"+ head); System.out.println(q); int size = q.size(); System.out.println("Size of queue-"+ size);
Expert Solution
steps

Step by step

Solved in 5 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY