n items stock system using your singly linked list from LAB 05: Exercise # 1 Add an item should input from user all the required data for an item and add the item in front of linked list using the method addToHead(). Remove an item should input itemID from user and delete it from the list using the method delete(itemID), if present. Show list of items should display the items in list using the method printAll(). Exit should close the program (running in infinite loop) using return or break statement . A node in this list should contain following information about items: class Item { public long itemID; public String itemName; public String manufacturer; public int version; public String countryOfOrigin; public int year; public Node next; public Node(long ID, String itnm, String manufac, int ver, String origin, int y) { itemID = ID; itemName = itnm; manufacturer = manufac; version = ver; countryO

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
Implement an items stock system using your singly linked list from LAB 05: Exercise # 1 Add an item should input from user all the required data for an item and add the item in front of linked list using the method addToHead(). Remove an item should input itemID from user and delete it from the list using the method delete(itemID), if present. Show list of items should display the items in list using the method printAll(). Exit should close the program (running in infinite loop) using return or break statement . A node in this list should contain following information about items: class Item { public long itemID; public String itemName; public String manufacturer; public int version; public String countryOfOrigin; public int year; public Node next; public Node(long ID, String itnm, String manufac, int ver, String origin, int y) { itemID = ID; itemName = itnm; manufacturer = manufac; version = ver; countryOfOrigin = origin; year = y; } } Modify and use the program code in Lab 05 according to this problem. You can remove the methods which are not required to solve this problem. Sample run of the program Items in Store 1. Add an item 2. Remove an item 3. Show list of items 4. Exit Your choice?
Implement an items stock system using_your singly linked list from LAB 05: Exercise # 1
1. Add an item should input from user all the required data for an item and add the item in front of linked list using the method
addToHead().
2. Remove an item should input itemlD from user and delete it from the list using the method delete(itemID), if present.
3. Show list of items should display the items in list using the method printAll().
4. Exit should close the program (running in infinite loop) using return or break statement .
• A node in this list should contain following information about items:
class Item {
public long itemlD;
public String itemName;
String manufacturer;
public int versountryOfOrigin;
bijgnd
String
public int
public Node next;
public Node(long ID, String itnm, String manufac, int ver, String origin, int y) {
itemID = ID; itemName = itņm; maňufacturer = manufac;
version = vér; countryOfOrigin - origin; year = y;
year;
• Modify and use the program code in Lab 05 according to this problem. You can remove the methods which are not
required to solve this problem.
Sample run of the program
Items in Store
1. Add an item
2. Remove an item
3. Show list of items
4. Exit
Your choice?
Transcribed Image Text:Implement an items stock system using_your singly linked list from LAB 05: Exercise # 1 1. Add an item should input from user all the required data for an item and add the item in front of linked list using the method addToHead(). 2. Remove an item should input itemlD from user and delete it from the list using the method delete(itemID), if present. 3. Show list of items should display the items in list using the method printAll(). 4. Exit should close the program (running in infinite loop) using return or break statement . • A node in this list should contain following information about items: class Item { public long itemlD; public String itemName; String manufacturer; public int versountryOfOrigin; bijgnd String public int public Node next; public Node(long ID, String itnm, String manufac, int ver, String origin, int y) { itemID = ID; itemName = itņm; maňufacturer = manufac; version = vér; countryOfOrigin - origin; year = y; year; • Modify and use the program code in Lab 05 according to this problem. You can remove the methods which are not required to solve this problem. Sample run of the program Items in Store 1. Add an item 2. Remove an item 3. Show list of items 4. Exit Your choice?
Expert Solution
steps

Step by step

Solved in 2 steps

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