Develop a Java program for managing a list of courses stored in a file named "Courses.txt." The program should: Display all courses in the collection. Show courses introduced in the last three years (2022-2024). Calculate the average difficulty level of all courses. Generate a frequency distribution of course subjects. Store all courses from "Courses.txt" in a Java TreeMap. Output the unique instructors in the collection. Output the total number of entries in your TreeMap. Courses.txt: "Introduction to Java Programming", Computer Science, 2020, Intermediate, John Smith "Artificial Intelligence Basics", Computer Science, 2023, Advanced, Emily Rodriguez "Financial Accounting Fundamentals", Business, 2021, Beginner, David Johnson "Spanish Language Essentials", Linguistics, 2022, Intermediate, Maria Garcia "Environmental Science Fundamentals", Environmental Science, 2024, Beginner, Lisa Thompson "Digital Marketing Strategies", Marketing, 2023, Advanced, Michael Davis "Psychology 101", Psychology, 2022, Beginner, Susan White

Develop a Java program for managing a list of courses stored in a file named "Courses.txt." The program should: Display all courses in the collection. Show courses introduced in the last three years (2022-2024). Calculate the average difficulty level of all courses. Generate a frequency distribution of course subjects. Store all courses from "Courses.txt" in a Java TreeMap. Output the unique instructors in the collection. Output the total number of entries in your TreeMap. Courses.txt: "Introduction to Java Programming", Computer Science, 2020, Intermediate, John Smith "Artificial Intelligence Basics", Computer Science, 2023, Advanced, Emily Rodriguez "Financial Accounting Fundamentals", Business, 2021, Beginner, David Johnson "Spanish Language Essentials", Linguistics, 2022, Intermediate, Maria Garcia "Environmental Science Fundamentals", Environmental Science, 2024, Beginner, Lisa Thompson "Digital Marketing Strategies", Marketing, 2023, Advanced, Michael Davis "Psychology 101", Psychology, 2022, Beginner, Susan White

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

Create a Java program. You have a list of Student ID's followed by the course number(separated by aa space) that the student is enrolled in. The listing is in no particular order. For eg. is student 1 is in CS100 and CS200 while student 2 is in CS105 and MATH210 then the list may look like this: 1 CS100 2 MATH210 2 CS105 1 CS200 Write a program that reads data in this format from the console. If the ID is -1 then stop inputting data. Use the HashMap class to map from an Integer(Student ID) to an ArrayList of type String that holds each class that the student is enrolled in. The declaration should look like this: HashMap<Integer, ArrayList<String>> students = new HashMap<Integer, ArrayList<String>>(); After all data is input, iterate through the map and output the student ID and all classes stored in the vector for that student. The result should be a list of classes organized by student id.
Write a Java program to store the rainbow color names as strings in a TreeMap with keys starting from 1 to 7: 1 à “Purple” 2 à “Navy” 3 à “Blue”4 à “Green”5 à “Yellow” 6 à “Orange” 7 à “Red” Then, display all colors in which their keys are between 3 (inclusive) and 6 (inclusive). You should write your code in a single file named “Problem1.java”
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 creates and maintains a binary search tree (BST) whose nodes are student records. Each student record (BST node) contains the student's id (String), name (String) and GPA (float). Use the student id as a key for the BST. The program starts with an empty BST and offers the following menu options to the user repeatedly until the user selects the 'Q' option (quit). A: Add a new student record to the BST. Here the user is prompted to enter the new student’s id, name and GPA. The program should display an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the program displays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program should display an error message if the student id is not found in the BST. P:…
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 Java program that prompts a user for vehicle data and stores it in a linked list, and then sorts the list in ascending order based on miles-per-gallon and writes the sorted data to a text file, you can follow these steps: Create a class named Vehicle with private fields: make (String), model (String), and milesPerGallon (double). Include getters and setters for these fields. Implement the Comparable interface for Vehicle class and override the compareTo() method to compare vehicles based on their milesPerGallon. Create a main class (for example, VehicleDriver.java) to handle user input and perform the necessary operations. Inside the main method, create a BufferedReader object for user input. Prompt the user to enter the number of vehicle data they want to enter and store it in a variable (for example, nVehicles). Use a loop to iterate nVehicles times and prompt the user to enter make, model, and miles per gallon for each vehicle. Create Vehicle objects using the input data…
Write a Java program that incorporates a loop that prompts the user for student data. Student data are private fields in a student class including: String name String address double GPA Each student object is stored in a linked list. After the user completes the data entry, output the contents of the linked list in ascending sorted order by name to a regular text file that can be opened and viewed using a simple plain-text editor such as notepad. Validate numeric data for Grade Point Average (GPA).
Write a java program called ShoppingList.java, which prompts the user to enter a set of grocery items, and stores them in a list using the Java ArrayList Collection class. It then displays the list and asks the user to type in each item when they put it in their shopping cart and remove it from the list. It should work as follows: Welcome to My Shopping List. Please enter an item: Milk Enter another Item Y/N: Y Please enter an item: Bread Enter another Item Y/N: Y Please enter an item: Eggs Enter another Item Y/N: N Here is your Shopping List: Milk Bread Eggs Enter an item to remove from the list: Eggs Eggs has been removed Here is your Shopping List: Milk Bread Enter an item to remove from the list: Milk Milk has been removed Here is your Shopping List: Bread
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 creates and maintains a binary search tree (BST) whose nodes are studentrecords. Each student record (BST node) contains the student’s id (String), name (String) and GPA(float). Use the student id as a key for the BST. The program starts with an empty BST and offers thefollowing menu options to the user repeatedly until the user selects the ‘Q’ option (quit). A: Add a new student record to the BST.Here the user is prompted to enter the new student’s id, name and GPA. The program shoulddisplay an error message if the student id already exists in the BST. F: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the programdisplays the student id, name and GPA, otherwise the program displays an error message. D: Delete a student record. Here the user is prompted to enter the id of the student record to be deleted. The program shoulddisplay an error message if the student id is not found in the BST.
Write a Java program that creates and maintains a binary search tree (BST) whose nodes are studentrecords. Each student record (BST node) contains the student’s id (String), name (String) and GPA(float). Use the student id as a key for the BST. The program starts with an empty BST and offers thefollowing menu options to the user repeatedly until the user selects the ‘Q’ option (quit). A: Add a new student record to the BST.Here the user is prompted to enter the new student’s id, name and GPA. The program shoulddisplay an error message if the student id already exists in the BST. B: Find a student record. Here the user is prompted to enter the id of the student to be searched. If found the programdisplays the student id, name and GPA, otherwise the program displays an error message.
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