Display student class details “HashMap” and “ArrayList” Program Plan: Import required package. Define “StudentIDsListTest” class. Define main function. Create hashmap for student ID and course number. Create an object for scanner class. Declare required variables. Display prompt statement. Performs “do-while” loop. This loop will execute until “studID” is not equal to “-1”. Read student ID from user. If student ID is not equal to “-1”, then read course number from user. If the student ID is contains in “students” list, then Create array list named “class_List”. Add the course number to “class_List” using “add” method. Map the student ID to course number using “put” method. Otherwise, Create array list named “class_List”. If the course number is not in the class list, then add the given course number to “class_List” using “add” method. Display all the classes for each student using “for” loop. Create array list named “stud_List”. Display course number for corresponding student ID.

Question

Please no AI! Or if you do use AI, Check the work please! Thank you!

Answer 1

Question

Chapter 12, Problem 15PP

Program Plan Intro

Display student class details “HashMap” and “ArrayList”

Program Plan:

Import required package.

Define “StudentIDsListTest” class.

Define main function.

Create hashmap for student ID and course number.

Create an object for scanner class.

Declare required variables.

Display prompt statement.

Performs “do-while” loop. This loop will execute until “studID” is not equal to “-1”.

Read student ID from user.

If student ID is not equal to “-1”, then read course number from user.

If the student ID is contains in “students” list, then

Create array list named “class_List”.

Add the course number to “class_List” using “add” method.

Map the student ID to course number using “put” method.

Otherwise,

Create array list named “class_List”.

If the course number is not in the class list, then add the given course number to “class_List” using “add” method.

Display all the classes for each student using “for” loop.

Create array list named “stud_List”.

Display course number for corresponding student ID.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Please no AI! Or if you do use AI, Check the work please! Thank you!

(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…

(Dynamic Programming.) A group of friends is visiting a number of attractions located along a highway, starting at kilometre 0, placed at distances ɑ1 < A2 < ···