![Modify your assignment submission code to answer the following questions: 1. Create an interface StudentModel for the student model to store student data you wish to keep unchanged such as studentID and StudentEmail. Modify the existing Student class to implement StudentModel and convert it to an abstract class with the reportReport and deleteStudent as the abstract methods. 2. Consider the following two implementation options for student search for Array and ArrayList respectively. Implement a search without a for loop, you may use methods within the two data structures to optimize the code. public void searchStudent(String searchID) { int foundIndex = findStudentByID(searchID); if (foundIndex != -1) { System.out.println("Student found:"); System.out.println("Student ID: " + studentIDs[foundIndex]); System.out.println("Student Name: " + studentNames[foundIndex]); System.out.println("Student Email: " + studentEmails[foundIndex]); System.out.println("Student Course: " + studentCourses[foundIndex]); } else { System.out.println("Student with student ID " + searchID + " was not found."); } } private int findStudentByID(String searchID) { for (int i = 0; i < studentCount; i++) { if (studentIDs[i].equals(searchID)) { return i; } } return -1; }](https://gotit-pro.com/wp-content/uploads/2023/10/6391b22d-2a52-409f-a111-f25c8a39642d.png)
Description
Modify your assignment submission code to answer the following questions:
1. Create an interface StudentModel for the student model to store student data you wish to keep unchanged such as studentID and StudentEmail. Modify the existing Student class to implement StudentModel and convert it to an abstract class with the reportReport and deleteStudent as the abstract methods.
2. Consider the following two implementation options for student search for Array and ArrayList respectively. Implement a search without a for loop, you may use methods within the two data structures to optimize the code.
public void searchStudent(String searchID)
{
int foundIndex = findStudentByID(searchID);
if (foundIndex != -1)
{
System.out.println(“Student found:”);
System.out.println(“Student ID: ” + studentIDs[foundIndex]);
System.out.println(“Student Name: ” + studentNames[foundIndex]);
System.out.println(“Student Email: ” + studentEmails[foundIndex]);
System.out.println(“Student Course: ” + studentCourses[foundIndex]);
}
else
{
System.out.println(“Student with student ID ” + searchID + ” was not found.”);
}
}
private int findStudentByID(String searchID)
{
for (int i = 0; i < studentCount; i++)
{
if (studentIDs[i].equals(searchID))
{
return i;
}
}
return -1;
}
![6. Write a program to determine the maximum height to which a projectile will travel if atmospheric resistance is neglected, for different initial velocities. This problem demonstrates the use of repetition controlled by a terminating limit. Method: The mass of the projectile is m, the initial velocity is v0 m/sec, the last initial velocity is vft/sec. From equations of motion: w=mg, Fz=maz. Applying these equations for the projectile results in the following equations: mg=mac gives ac=g. Initial conditions: s0=0, v0=v. Final conditions: sf=h, vf=0. From Kinematics: vf2=v02+2ac(sfs0) 0=v2+2ac(h0) 2ach=v2 h=2acv2 Data: Real values of initial velocity at 50, 100, 150, and 200 ft/sec. The real value of gravitational acceleration is 32.2 ft/sec2. 7. Write a program to compute and print a table of torsion shear stresses for circular rods having various torsion loads at various offsets. This problem demonstrates the use of nested repetitions. Data: Diameter: 5 and 6 inches. Load: 1000 and 12,000 pounds. Offset: 10, 15, and 20 L. Method: Let D = diameter of the rod. P = torsion load in pounds. L = offset. The torsion shear stress is given by the formula Ts = D^3/(16PL). 8. Write a program that reads numbers from an array and graphs the information in the form of a bar chart or histogram. The number is printed first, and then a bar consisting of that many asterisks is printed beside the number. Note: The define size of the array is 10. Example: [Number]: ********** [Number]: * [Number]: ********* [Number]: ***** [Number]: ********** [Number]: **** [Number]: ** [Number]: ******* [Number]: ******** [Number]: *******](https://gotit-pro.com/wp-content/uploads/2023/10/6c588a25-0ba0-4cf2-9cb7-5cd4974446e7.png)
![Large Integers Part #1 Largelnteger Class An array can be used to store large integers, one digit at a time. For example, the integer 1234 could be stored in the array num by setting num[0] to 1, num[1] to 2, num[2] to 3, num[3] to 4. However, for this class implementation, you might find it more useful to store the digits backward; that is, place 4 in num[0], 3 in num[1], 2 in num[2], and 1 in num[3]. For the sake of simplicity, we will be storing and manipulating only with positive large integers. Implement a class named Largelnteger that stores a large integer as an array of its digits. Class must extend HasState class (provided). This is needed to make sure clone() method is written correctly. Class must have the following: - Fields - Constant arraySize must be set to 23 - Partially filled array of integers of length 23 - int digitCount keeps the number of digits in large integer, e.t. how many elements of the partially filled array are used to store the number - No-argument constructor that stores number 0 in the array. Sets digitCount to 1 - Constructor that takes a string as a parameter. The constructor parses the given string and converts it into Large Integer by storing digits in the partially filled array. - Create a new custom Exception class called LargelntegerNumberFormatException. The constructor throws exceptions of this type when - string is too long to be stored as a 23-digit number or - when string is empty or - when the string contains non-digits and thus cannot be converted into a number. - Constructor that takes a number of type long as a parameter and builds an object from it by storing digits in an array. - This constructor also throws a custom LargelntegerNumberFormatException when a parameter passed to the constructor is a negative number. - getDigitCount() accessor to the digit count variable. - toString() method that converts an array into a string of numbers in the correct order. Number 12345 is converted into a string "12345" - add(Largelnteger) method that returns the sum of this integer and the one passed as a parameter. The method adds two large integers by implementing the usual "paper and pencil" addition algorithm. This is when the backward storage arrangement of those numbers in arrays will pay off. Carry-over will be easier to do when the integer is stored backward. - Create another custom Exception class called LargelntegerOverflowException. If the resulting number is more than 23 digits long, the add() method throws a LargelntegerOverflowException type exception. - Implement clone() method. - Make your class implement Relatable interface. Code of the interface is provided. Implement all three methods of the Relatable interface. Part #2 Polymorphic Class This class exists only to house one static method called isSorted(). The method must take an array of objects of type Relatable and check if the array is sorted with the help of methods of Relatable interface. The method returns true if the array is sorted and false if it is not. The whole purpose of this exercise is to illustrate the concept of polymorphism. The purpose of this class is to house three static methods. 1. Method void writeLargelntegerArray(Largelnteger[], String) takes an array of Large Integers and a name of a file as parameters. The method writes the contents of the given array into the given binary file (in binary mode). The method throws IOExceptions. The IOExceptions may originate in the methods but must not be handled. Instead, they must be propagated to the calling code. - Make sure to add implements Serializable to the Largelnteger class header. Binary IO will fail to work without that. 2. Method Largelnteger[] readLargelntegerArray(String) method reads the contents of a binary file with the given name as an array of objects of type Largelnteger. Assume you do not know the amount of data in the file. Read data one Largelnteger object at a time and store the objects in ArrayList first. After the end of the file has been reached, convert the ArrayList into a regular array of objects that can be returned from the method. - Please study EOFDemo.java code example to learn how to use exceptions when checking for the end of the file while reading from a binary file. - This method also throws IOExceptions. The IOExceptions may originate in the methods but must not be handled. Instead, they must be propagated to the calling code. 3. Method Largelnteger addLargelntegersFromFile(String) takes a text file name as a parameter. It reads an arbitrary number of strings of text from the file, converting them into Largelntegers as it reads. The Large Integers are added one by one to the running total with the help of add() method. The sum of all the Large Integers stored in the file as strings is then returned from the method. - The structure of the file may be imperfect. Some strings may contain corrupted data and will fail to be converted into Largelnteger. This must not interrupt the process of reading from the file. The corrupted string must be skipped over, and the next string must be read and converted. Use a try/catch block to catch and ignore LargelntegerNumberFormatException. - The sum of all numbers stored in the file may become too big to be stored in a Large Integer. In that case, a LargeIntegerOverflowException exception will be thrown by the add() method. If this happens, catch the exception and return a null value from the method. - This method also throws IOExceptions. The IOExceptions may originate in the methods but must not be handled. Instead, they must be propagated to the calling code.](https://gotit-pro.com/wp-content/uploads/2023/10/a2443259-5cf9-45ff-9909-fdcfa036711f.png)
Chris Aikins –
Excellent job, my friend. Thank You!!
Noman Anwar –
I am glad I got assistance, I’m am very happy with the service.
Richard Morris –
Awesome work as usual!!
Paul Benson –
Work was finished long before due and tutor was considerate and engaging. Perfect!
Kimberly Yagovane –
Great job, very quick and informative! Done in an hours! Thank you for a job well done.