Write a Java program using Hashtable to maintain a list of your friends (input the friends' names from user). Provide a menu to 1.add a friend, 2.remove, 3.search, 4.edit, 5.show list 6.exit. (this problem is like Lab-07/08: Exercise-2 but using Hashtable)For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).в IU SParagraphA VIArial14px...PO WORDS POWERED BY TINY

Answered: Image /qna-images/answer/19bbdf63-8967-4f03-9ee5-6db4574a68b5.jpg

Write a Java program using Hashtable to maintain a list of your friends (input the friends' names f show list 6.exit. (this problem is like Lab-07/08: Exercise-2 but using Hashtable) For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). BIUS Paragraph Arial 14px

Write a Java program using Hashtable to maintain a list of your friends (input the friends' names f show list 6.exit. (this problem is like Lab-07/08: Exercise-2 but using Hashtable) For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). BIUS Paragraph Arial 14px

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 a Java program that asks the user to enter items until the user chooses to stop, stores them into links (nodes), and chains the links together into a linked list. You will need to make the following changes: Your linked list should store information about Customers' Transactions that contain three fields: customer name (string), customer number (int), and transaction description (string). Instead of putting all of your code inside the main source code file, you should create the following functions: o addToStart(Item x) o addToEnd(Itemn x) o insertAt(Item x, int n) o remove(int customer number) o reverse() o printList() • Instead of simply asking the user if they want to add a new link, your main program should offer the user a menu of options: o Add a new link to the end o Add a new link to the beginning o Insert an element at index n into the list. 0 Remove a link from the list o Reverse the list o print out the entire list o Quit the program
Write a Java program that asks the user to enter items until the user chooses to stop, stores them into links (nodes), and chains the links together into a linked list. You will need to make the following changes: • Your linked list should store information about Customers' Transactions that contain three fields: customer name (string), customer number (int), and transaction description (string). • Instead of putting all of your code inside the main source code file, you should create the following functions: o addToStart(Item x) o addToEnd(Item x) o insertAt(Item x, int n) o remove(int customer_number) o reverse() o printList()
Write a program in the Java language that includes: 1. A class for books, taking into account the encapsulation and getter, setter. 2. Entering books by the user using Scanner 3. LinkedList class for: (Adding a new book - Inserting a book- Searching for a book using the ISBN Number - Viewing all books,delete book). 4. Serial number increases automatically with each book that is entered. 5. Printing the names of books is as follows: Serial - ISBN - Name - PubYear - Price - Notes. 6-Design a main menu that includes: • Add Book • Insert Book • Delete Book • Search . Display . Exit
Develop a simple program in Java to maintain a list of homework assignments. When an assignment is assigned, add it to the list, and when it is completed, remove it. You should keep track of the due date. Your program should 1. Add a new assignment. 2. Remove an assignment. 3. Provide a list of the assignments in the order they were assigned. 4. Find the assignment(s) with the earliest due date.
Consider the BadReaderWriter.java program attached with this. The program has three threads, namely, one reader thread and two writer threads, and they all access the same list of numbers. The reader thread reads the list and prints it to the terminal. The writer threads append numbers to the list. At any point in time, if either of the writer threads finds that the list contains n elements, then it appends the number n + 1 to the list. Run this program, examine the output, and identify the problems.Fix these problems by implementing the acquireLock() and releaseLock() methods in the code.
in JAVA write an ADT for a library management system which stores the title (string), author (string), ISBN (string), list price (positive integers), edition (numbers), and publisher (string). Then implement the method swap but remove the assumption that the ith and jth items in the list exist. Throw an exception ListindexoutOfBoundsException ifiorj isoutofrange
Write a program to produce the first 100 Fibonacci numbers. A Fibonacci number is one that is the product of the prior two generated numbers. The sequence is seeded with the values of 0 and 1, so that the sequence starts off as 0 1 1 2 3 ... Fibonacci numbers are used in computing hash table locations for file management systems.
Consider the BadReaderWriter.java program attached with this homework. The program has three threads, namely, one reader thread and two writer threads, and they all access the same list of numbers. The reader thread reads the list and prints it to the terminal. The writer threads append numbers to the list. At any point in time, if either of the writer threads finds that the list contains n elements, then it appends the number n + 1 to the list.Run this program, examine the output, and identify the problems.Fix these problems by implementing the acquireLock() and releaseLock() methods in the code.
Write a program that reads a list of integers from input and identifies the mode (the value that appears most often). The input is a sequence of integers that ends with -1. Total number of integers in the list is unknown. Output the mode and end with a newline. Assume that the list is not empty and only one mode exists. Ex: If the input is: 5 9 2 -3 -5 -3 2 1 4 5 5 -1 the output is: 5 import java.util.Scanner; import java.util.ArrayList; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); /* Type your code here. */ }}
Implement a resize function for a hash table. Resizing is the process of increasing a hash table's size when too many items have been added, reducing the hash table's effectiveness. To resize the hash table, increase the size of the table by some small factor (not less than 2x), remove everything from the old table, and insert it into the new larger table. Make sure to free up memory that is no longer used after resizing. Use the following heuristics to resize the table: • When the load factor exceeds .5. If no entry is found within the probe distance. Note, you may need to change insert as well to have a fully working solution.
This is Java Move the Nth element to the back of the Queue. Write the Java program that reads 5 integers in from the keyboard (user input) and loads the integers into a Queue. Add a method ‘moveNth(queue, locationToMove );’ that accepts a queue and an integer, as the two parameters. Your ‘moveNth’ method will find the ‘locationToMove’ and “move that value to the end of the Queue.” For example: Method Call – moveNth(queue, 3); Queue before Call: 1 2 3 4 5 Queue after call: 1 2 4 5 3 Your code can only use the queue data structure (and if wanted, an integer variable to store each integer read from the user’s input). Sample method calls in main() loadQueue(queue); displayQueue(queue); moveNth(queue, 4); // your code should work for any locationToMove displayQueue(queue); This is java. Thanks.
in java please.Create a method from the implementation perspective. Create a method where it takes in a linked chain of values and adds them in order to the front. method header:public void addToFront(ANode<T> first)