Description
4. Use the Java ByteArrayOutputStream and PrintStream classes to redirect the System.out output for unit testing of the student search method below.
private student student;
private String id, name, age, email, course;
public void setup() {
student = new Student(id, name, age, email, course);
}
public void testSaveStudent() {
// Your code here
}
private static void searchForStudent() {
System.out.println(“Enter the student ID to search:”);
int searchId = Integer.parseInt(scanner.nextLine());
boolean found = false;
for (Student student : students) {
if (student.getId() == searchId) {
found = true;
System.out.println(“Student found:”);
System.out.println(“ID: ” + student.getId());
System.out.println(“Name: ” + student.getName());
System.out.println(“Age: ” + student.getAge());
System.out.println(“Email: ” + student.getEmail());
System.out.println(“Course: ” + student.getCourse());
break;
}
}
if (!found) {
System.out.println(“Student not found.”);
}
}
![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)
![Emergency Response Planning You are responsible for planning emergency response routes for a city. The city is represented as a graph, with intersections as nodes and roads as edges. In the event of an emergency, you need to find the shortest path from a central emergency command center to various locations in the city to minimize response time. The city's road network is represented as an undirected weighted graph, where each road has a known travel time (weight) associated with it. Your task is to find the shortest paths from the central emergency command center (Node F) to all other intersections in the city. Your code should return a nested list of [Source, Target, Duration]. Example: [[F, C, 2]]](https://gotit-pro.com/wp-content/uploads/2023/10/c150e24f-eb6a-4e13-a47f-5bc50d4fda18.jpg)
David Updike –
I really love the quality of the assignments. They are great so far. Accurate.
Paul Benson –
Great job, very quick and informative! Done in an hours! Thank you for a job well done.
Carmen Hoggard –
Excellent, thank you! Got solution extremely fast, within minutes.