irection: Continue the code below (choose only 1 version of code) and add case 4, case 5, and case 6. Add 3 more functions om insert, getValue, and clear from List ADT in our lecture. mport java.util.LinkedList; mport java.util.Scanner; Lass SampleLL public static void main(String[] args) { LinkedList 11s = new LinkedList(); String msg = "Choose a function: \n [1] Insert, [2]Get Value, [3] Clear, [0] Exit"; System.out.println(msg); Scanner scan = new Scanner(System.in); scan.nextInt (); int choice while(true) { if (choice==0) {

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
Direction: Continue the code below (choose only 1 version of code) and add case 4, case 5, and case 6. Add 3 more functions aside
from insert, getValue, and clear from List ADT in our lecture.
import java.util.LinkedList;
import java.util.Scanner;
class SampleLL
{
public static void main(String[] args) {
LinkedList<String> 11s = new LinkedList<String>();
String msg= "Choose a function: \n [1] Insert, [2] Get Value, [3] Clear, [0] Exit";
System.out.println(msg);
Scanner scan = new Scanner(System.in);
scan.nextInt ();
int choice
while(true) {
if (choice==0) {
System.exit(0);
Transcribed Image Text:Direction: Continue the code below (choose only 1 version of code) and add case 4, case 5, and case 6. Add 3 more functions aside from insert, getValue, and clear from List ADT in our lecture. import java.util.LinkedList; import java.util.Scanner; class SampleLL { public static void main(String[] args) { LinkedList<String> 11s = new LinkedList<String>(); String msg= "Choose a function: \n [1] Insert, [2] Get Value, [3] Clear, [0] Exit"; System.out.println(msg); Scanner scan = new Scanner(System.in); scan.nextInt (); int choice while(true) { if (choice==0) { System.exit(0);
}
switch (choice) {
case 1: System.out.println("Enter a word/symbol:");
11s.add(scan.next());
}
break;
case 2: System.out.println("Enter a number: ");
System.out.println(11s.get
(scan.nextInt()));
break;
case 3 11s.clear();
break;
default System.out.println("Invalid input!");
break;
System.out.println(msg);
choice scan.nextInt ();
Transcribed Image Text:} switch (choice) { case 1: System.out.println("Enter a word/symbol:"); 11s.add(scan.next()); } break; case 2: System.out.println("Enter a number: "); System.out.println(11s.get (scan.nextInt())); break; case 3 11s.clear(); break; default System.out.println("Invalid input!"); break; System.out.println(msg); choice scan.nextInt ();
Expert Solution
steps

Step by step

Solved in 2 steps with 1 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