Create, compile, and run a program that manages a linked list. Specifically, create a linked list for the store's inventory. Put at least 12 items in the list. Ask for an item by SKU number. If the item is not in the inventory, just say so. If it is in the inventory, tell the item's name, cost and quantity on hand. Data fields are: Name SKU number Cost of item Quantity on hand Data fields are: Name, SKU number, Cost of item, Quantity on hand For this lab, you will need to use the files Baginterface.java, Item.java, and LinkedBag.java. You should modify Item.java. Also, you should rename it. You can model your code on OnlineShopper.java. You only need to submit any of those files if you change them. Also, please submit a list of the grocery items as a text file along with your code.

Create, compile, and run a program that manages a linked list. Specifically, create a linked list for the store's inventory. Put at least 12 items in the list. Ask for an item by SKU number. If the item is not in the inventory, just say so. If it is in the inventory, tell the item's name, cost and quantity on hand. Data fields are: Name SKU number Cost of item Quantity on hand Data fields are: Name, SKU number, Cost of item, Quantity on hand For this lab, you will need to use the files Baginterface.java, Item.java, and LinkedBag.java. You should modify Item.java. Also, you should rename it. You can model your code on OnlineShopper.java. You only need to submit any of those files if you change them. Also, please submit a list of the grocery items as a text file along with your code.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write an application program using single LinkedList or circular single LinkedList to store the ISBN of a books. Create a class called “Book”, add appropriate data fields to the class, add the operations (methods) insert ( at front, end, and specific position), remove (from at front, end, and specific position), and display to the class.
Write a program in three parts. The first part should create a linked list of 26 nodes. The second part should fill the list with the letters of the alphabet. The third part should print the contents of the linked list. NOT USE malloc, only use <iostream>. Do not use global variables. The use of global constants c++
Write a program in three parts. The first part should create a linked list of 26 nodes. The second part should fill the list with the letters of the alphabet. The third part should print the contents of the linked list. NOT USE malloc, only use <iostream>
Create an implementation of LinkedList provided. For each implementation create a tester to verify the implementation of thatdata structure performs as expected Your task is to: Create a client ( a class with a main ) ‘StagBusClient’ which builds a bus route by performing the following operations on your linked list: Create (insert) 4 stations List the stations Check if a station is in the list (print result) Check for a station that exists, and one that doesn’t Remove a station List the stations Add a station before another station. List the stations Add a station after another station. Print the stations LinkedList.java package linkedList; public interface LinkedList { public Boolean isItemInList(String thisItem); // true if it is, false if not public Boolean addItem(String thisItem); // true if added, false if it was already there, or an error public Integer itemCount(); public void listItems(); public Boolean deleteItem(String thisItem); // true if deleted, false if not…
Using eclipse, write a Console Java program that inserts 25 random integers in the range of 0 to 100 into a Linked List. (Use SecureRandom class from java.security package.SecureRandom rand = new SecureRandom(); - creates the random number objectrand.nextInt(100) - generates random integers in the 0 to 100 range)Using a ListItreator output the contents of the LinkedList in the original order. Using a ListItreator output the contents of the LinkedList in the reverse order.
?? The language is c++, please take a screenshot of your output. Write the definition of the class linkedQueueType, which is derived from the class unorderedLinkedList. write a program to test various operations of this class. Following are code template. Please provide input and output screen shot. (ref:C++ by D.S. Malik. pages 495 Programming Exercise # 7) //Program to test the queue operations #include <iostream>#include "queueLinked.h" using namespace std; int main(){linkedQueueType<int> queue;linkedQueueType<int> copyQueue; int num; cout << "Queue Operations" << endl;cout << "Enter numbers ending with -999" << endl;cin >> num; while (num != -999){// queue.addQueue(num); //add an element to the queuecin >> num;} copyQueue = queue; //copy queue into copyQueue cout << "queue: ";// while (!queue.isEmptyQueue())// {// cout << queue.front() << " ";// queue.deleteQueue();// } cout << endl; // cout <<…
What are the fundamental operations of a linked list and the main advantage of a linked list over an array? Test program LinkedList.java, and make sure that you understand each operation in the program. (refer to linkedListApplication.java). In this code which part I will keep main.java file and which part I will keep LinkedList.java.java file. Because I will use main.java IDE. Otherwise my program doesn't run. import java.util.*; public class LinkedList{ public Node header; public LinkedList() { header = null; } public final Node Search(int key) { Node current = header; while (current != null && current.item != key) { current = current.link; } return current; } public final void Append(int newItem) { Node newNode = new Node(newItem); newNode.link = header; header = newNode; } public final Node Remove() { Node x = header; if (header != null) {…
Write a c++ program in which make a LinkedList where you have to make a class and then this class have two members first one would be the value of type int and the second one would be the address of the Node and the type of this address should be the same as class. Secondly, you have to insert Nodes in the LinkedList which would be empty in the beginning and then his list will be filled up by user during run time. NOTE: You can’t make a LinkedList during compiled time you have to make a LinkedList during Run time on the demand of user, Suppose user will first ask you that how many nodes he wants to insert into the LinkedList.
how to answer the following questions Given that values is of type LLNode<Integer> and references a linked list (possibly empty) of Integer objects, what does the following code do if invoked as mystery(values)? int mystery(LLNode<Integer> list) { if (list == null) return 0; else return mystery(list.getLink()); } A. returns the last number on the values list B. returns how many numbers are on the values list C. returns sum of the numbers on the values list D. return 0 Given that values is of type LLNode<Integer> and references a linked list (possibly empty) of Integer objects, what does the following code do if invoked as mystery(values)? int mystery(LLNode<Integer> list) { if (list == null) return 0; else return list.getInfo() + mystery(list.getLink()); } A.returns how many numbers are on the values list. B. returns sum of the numbers on the values list. C. returns 0 D. returns the last number on the values…
Your task is to: Implement the LinkedList interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in the test harness. Create a client ( a class with a main ) ‘StagBusClient’ which builds a bus route by performing the following operations on your linked list: - Create (insert) 4 stations - List the stations - Check if a station is in the list (print result). Check for a station that exists, and one that doesn’t - Remove a station. List the stations - Add a station before another station. List the stations - Add a station after another station. Print the stations LinkedList.java package linkedList; public interface LinkedList { public Boolean isItemInList(String thisItem); // true if it is, false if not public Boolean addItem(String thisItem); // true if added, false if it was already there, or an error public Integer itemCount(); public void listItems(); public Boolean deleteItem(String thisItem); // true if deleted,…
Given that values is of type LLNode<Integer> and references a linked list (possibly empty) of Integer objects, what does the following code do if invoked as mystery(values)? int mystery(LLNode<Integer> list) { if (list == null) return 0; else return list.getInfo() + mystery(list.getLink()); } A.returns how many numbers are on the values list. B. returns sum of the numbers on the values list. C. returns 0 D. returns the last number on the values list
Given the following code, how would you make it thread-safe? // basic node structuretypedef struct __node_t { int key; struct __node_t *next;} node_t; // basic list structure (one used per list)typedef struct __list_t { node_t *head; } list_t; void List_Init(list_t *L) { L->head = NULL; } int List_Insert(list_t *L, int key) { node_t *new = malloc(sizeof(node_t)); if (new == NULL) { perror("malloc"); return -1; // fail } new->key = key; new->next = L->head; L->head = new; return 0; // success } int List_Lookup(list_t *L, int key) { node_t *curr = L->head; while (curr) { if (curr->key == key) { return 0; // success } curr = curr->next; } } Group of answer choices A. list_t is already thread-safe and does not need any locks in any of its operations. B. Add a lock to the list_t struct, initialize the lock in the List_Init, and then any operation that involves a…