Write a Java program that uses a TreeMap for a phone directory that holds a list of names with a phone number for each name. Note the following: Both key and value in the TreeMap are of type String. The key represents a name and the value represents the associated phone number. Constructor should create an initially empty directory. Write a method to find the number associated with a given name. Write a method to associate a given name with a given phone number. If the name already exists in the phone directory, then the new number replaces the old one. Otherwise, a new name/number pair is added. The name and number should both be non-null. An IllegalArgumentException is thrown if this is not the case. Write a method to display the contents of the phone directory. Write a test class with a main method to test the phone directory class.

Write a Java program that uses a TreeMap for a phone directory that holds a list of names with a phone number for each name. Note the following: Both key and value in the TreeMap are of type String. The key represents a name and the value represents the associated phone number. Constructor should create an initially empty directory. Write a method to find the number associated with a given name. Write a method to associate a given name with a given phone number. If the name already exists in the phone directory, then the new number replaces the old one. Otherwise, a new name/number pair is added. The name and number should both be non-null. An IllegalArgumentException is thrown if this is not the case. Write a method to display the contents of the phone directory. Write a test class with a main method to test the phone directory class.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

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
Write a Java public static general method that doesn't belong to the Queue class(assuming the Queue type is Book and Book has a clone method, Book also has a method called getGenre() which returns the genre of the book): Queue findOneGenreBooks(Queue Q, String genreType) that searches in the first parameter Q for all books that has the same genre type as defined by the second parameter genreType, return all of the books that have the specified genre type as a Queue. (For example, you may want to find all cartoon books and return them as a Queue). Please note: You are only allowed to use the Queue class which has constructors, enqueue, dequeue, front, isEmpty, size, toString, and clone methods.
Write a java program that will solve the problem: For a given ListADT that contains Items with numerical key value (integer), reorder it into two partitions of equal size such as the difference between the sum of those integers in the first partition and the second partition would be minimal. The program should have a class code separate from the main code. 1. Use a separate file to store the graph data. The name of the file should be "yourname_floyd.dat". 2. Use a few (3- 4) different graphs to compare actual performance (execution time).
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) Delete any person details by a given phone number. Update telephone number by providing person first name. Display all details of persons from a phone directory. Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory)
Add a method to the Parking Office to return the collection of permit ids for a specific customer (getPermitIds(Customer)) I have already coded the permit id class, but I attached the class diagram for you to see. Current Java Code: package parkingsystem4;import java.util.LinkedList;import java.util.List; public class ParkingOffice { String name; String address; List<Car> cars = new LinkedList<Car>(); List<Customer> customers = new LinkedList<Customer>(); List<ParkingLot> lots = new LinkedList<ParkingLot>(); List<ParkingCharge> charges = new LinkedList<ParkingCharge>(); // Default constructor ParkingOffice(){ } // Parameterized constructor ParkingOffice(String name, String address, List<Car> parkedCars, List<ParkingLot> lots, List<ParkingCharge> charges){ this.name = name; this.address = address; this.cars = parkedCars; this.lots = lots;…
Write a BlueJ project consisting in a class named Lecture whose goal is to store a list of the student names (of type String) attending it. In addition to declaring and initializing the necessary fields, the class has to implement: • A method boolean addStudent(String name) that adds a name to the (internal) list and returns an appropriate value (see Hint): the returned boolean value must be the same returned by the method add of the “internal list”. • A method int getHomonymNumber(String name) that returns the number of students that have the indicated name. • A method void printCSList() that prints the list of student names, in one single line and separated by a comma. For example: Goofy, Donald, Mickey Notice that you may not print a comma after the last name! • A method boolean swap(int index1, int index2) that swaps 2 students names in the list and returns true if the operation is successful. • A method void testIt() that adds at least 4 students (at least two with the same name),…
Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: 1) Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) 2) Delete any person details by a given phone number. 3) Update telephone number by providing person first name. 4) Display all details of persons from a phone directory. 5) Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) 6) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory) Project Outputs The output has to display a menu of choices. Then the user can select which operation want to perform.…
Write a java program that will solve the problem: For a given ListADT that contains Items with numerical key value (integer), reorder it into two partitions of equal size such as the difference between the sum of those integers in the first partition and the second partition would be minimal.
Write a recursive instance method named findBad that takes no parameters and returns a reference to a Link. The result of calling findBad is a reference to the first link that has a value greater than the next link's value. If no such link exists return null. For example, for {5→6→7→3→2} it would return a reference to the third link ("7").
This is a java question Trace through the state of the queue q in the following code fragment in the main method. You need to show the queue with its values for credit. Queue <Integer> q = new ArrayDeque<Integer>( );q.add(14);q.add(-47);q.offer(75);q.poll( );Integer v = q.peek( );q.add( v - 32);q.remove( );q.add(q.poll( ));System.out.println ("q has " + q);System.out.println ("v has " + v); Final Result for q: v:
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