Implement solution for remove(int id)removes the Student associated with this id; if the id is not found in the table or on the waitlist, then it should return null; otherwise, it should return the Student associated with the id. If the student that is removed was registered, then this student should be replaced by the student who is first in the waitlist queue. If the student who is removed was on the waitlist, then they should just be removed from the waitlist. You should go directly to slot id % m rather than iterating through all the slots. public class Course { public String code; public int capacity; public SLinkedList<Student>[] studentTable; public int size; public SLinkedList<Student> waitlist; public Course(String code) { this.code = code; this.studentTable = new SLinkedList[10]; this.size = 0; this.waitlist = new SLinkedList<Student>(); this.capacity = 10; } public Course(String code, int capacity) { this.code = code; this.studentTable = new SLinkedList[capacity]; this.size = 0; this.waitlist = new SLinkedList<>(); this.capacity = capacity; }public int getCourseSize() { // insert your solution here and modify the return statement return -1; } 1 public class Course {public String code;public int capacity;public SLinkedList [] studentTable;public int size;public SLinkedList waitlist;456.78public Course(String code) {this.code = code;this.studentTable = new SLinkedList[10];this.size = 0;this.waitlist = new SLinkedList();this.capacity}1011121314= 10;1516public Course(String code, int capacity) {this.code = code;this.studentTable = new SLinkedList[capacity];this.size = 0;this.waitlist = new SLinkedList<>();this.capacity = capacity;}17e18192021222324O 250虽26® 27O 2829public void changeArrayLength(int m) {public SLinkedList[] newStudentTable;for (int i = 0; i < m; i++) {newStudentTable[i] = new SLinkedList;}30O 31for (int i = 0; i < studentTable. length; i++) {for (int j = 0; j < studentTable[i].size(); j++) {int tempIndex = studentTable[i].get(j). getId() % m;newStudentTable[tempIndex].add (studentTable[i].get(j));}}32A 33x 3435363738studentTable = newStudentTable; Student.javaoublic class Student {public int id;public String name;public SLinkedList courseCodes;public final int COURSE_CAP3;%3Dpublic Student(int id, String name) {this.id = id;this.name = name;this.courseCodes = new SLinkedList();}public boolean isRegistered0rWaitlisted (String course) {return this.courseCodes.getIndex0f(course) > -1;}public void addCourse(String course) {this.courseCodes.addLast(course);}public void dropCourse(String course) {this.courseCodes.remove(course);}public String toString(){return "#" + this.id +: " + this.name;}

Find an implementatuon below with a few changes in the changeArrayLength Table.

Implement solution for remove(int id) removes the Student associated with this id; if the id is not found in the table or on the waitlist, then it should return null; otherwise, it should return the Student associated with the id. If the student that is removed was registered, then this student should be replaced by the student who is first in the waitlist queue. If the student who is removed was on the waitlist, then they should just be removed from the waitlist. You should go directly to slot id % m rather than iterating through all the slots. public class Course { public String code; public int capacity; public SLinkedList[] studentTable; public int size; public SLinkedList waitlist; public Course(String code) { this.code = code; this.studentTable = new SLinkedList[10]; this.size = 0; this.waitlist = new SLinkedList(); this.capacity = 10; } public Course(String code, int capacity) { this.code = code; this.studentTable = new SLinkedList[capacity]; this.size = 0; this.waitlist = new SLinkedList<>(); this.capacity = capacity; } public int getCourseSize() { // insert your solution here and modify the return statement return -1; }

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Implement solution for remove(int id)

removes the Student associated with this id; if the id is not found in the table or on the waitlist, then it should return null; otherwise, it should return the Student associated with the id. If the student that is removed was registered, then this student should be replaced by the student who is first in the waitlist queue. If the student who is removed was on the waitlist, then they should just be removed from the waitlist. You should go directly to slot id % m rather than iterating through all the slots.

public class Course {

public String code;

public int capacity;

public SLinkedList<Student>[] studentTable;

public int size;

public SLinkedList<Student> waitlist;

public Course(String code) {

this.code = code;

this.studentTable = new SLinkedList[10];

this.size = 0;

this.waitlist = new SLinkedList<Student>();

this.capacity = 10;