Question: This is java language and i need help on create a sublist method in the given codes. import java.io.Serializable; import java.util.*; public class MyLinkedList implements

This is java language and i need help on create a sublist method in the given codes. import java.io.Serializable; import java.util.*; public class MyLinkedList implements List, Serializable, Cloneable { /**  *  */  private static final long serialVersionUID = 1L; ListNode head; int size; //inner class for ListNode private class ListNode { private Object data; private ListNode next; private ListNode(Object d) { this.data = d; this.next = null; } private ListNode (Object d, ListNode next){ this.data = d; this.next = next; } private ListNode() { } } public MyLinkedList() { this.head = new ListNode(null); this.size = 0; } public void addFirst(Object data){ ListNode temp = new ListNode(data); temp.next = this.head.next; this.head.next = temp; this.size++; } public void addLast (Object data){ if(isEmpty()) addFirst(data); else { ListNode cur = this.head; while(cur.next != null){ cur = cur.next; } cur.next = new ListNode(data,null); this.size++; } } @Override public boolean equals(Object o){ if(o == null){ throw new NullPointerException("NULL parameter passed on call to equals(Object)"); } if(o == this){ return true; } if(o instanceof MyLinkedList){ MyLinkedList list = (MyLinkedList)o; if(this.size == 0 && list.size() == 0){ return true; } if(this.size == list.size()){ boolean ret = true; ListNode cur, cur2; cur = this.head.next; cur2 = list.head.next; for(; cur!= null && cur2!= null; cur = cur.next, cur2 = cur2.next){ if(cur.data.equals(cur2.data) != true){ ret = false; } }// end for return ret; }// end if(size == size) else{ return false; } }// end if(instanceof) return false; }// end equals() @Override public Iterator iterator() { return new MyLinkedListIterator(this.head); } /* @Override public int hashCode() { int value; return value; }*/ @Override public int size() { return this.size; } @Override public boolean isEmpty() { return size == 0; } @Override public boolean contains(Object o) { Iterator it = this.iterator(); while(it.hasNext()) { Object temp = it.next(); if(temp != null && o != null && temp.equals(o)) { return true; } else if(temp == null && o == null) { return true; } } return false; } @Override public Object[] toArray() { throw new UnsupportedOperationException(); } @Override public  Object[] toArray(Object[] a) { throw new UnsupportedOperationException(); } @Override public boolean remove(Object o) { for(ListNode prev = this.head, walk = this.head.next; walk != null; prev = walk,walk = walk.next){ if (walk.data.equals(o)) { //should override equals in your class Object prev.next = walk.next; this.size --; return true; } }//end for return false; } @Override public boolean containsAll(Collection c) { for(Object e : c) { if (!contains(e)) return false; } return true; } @Override public boolean addAll(Collection c) throws NullPointerException { if ( c == null ) { throw new NullPointerException("Collection passed in is null!"); } Iterator itr= c.iterator(); while(itr.hasNext()){ add(itr.next()); this.size ++; } return true; } @Override public boolean addAll(int index, Collection c) { // TODO Auto-generated method stub  if (c == null) { throw new NullPointerException(); } if (index < 0 || index > size) { throw new IndexOutOfBoundsException(); } ListNode cur = this.head; MyLinkedList temp = new MyLinkedList(); temp.addAll(c); ListNode curTemp = temp.head; ListNode curr = head; ListNode firstIndexTemp = temp.head; if(index == 0){ curTemp = curTemp.next; firstIndexTemp = firstIndexTemp.next; while( curTemp.next != null){ curTemp = curTemp.next; } curTemp.next = curr.next; curr.next = firstIndexTemp; } else{ for(int i = 0; i < index; i++){ curr = curr.next; } curTemp = curTemp.next; firstIndexTemp = firstIndexTemp.next; while( curTemp.next != null){ curTemp = curTemp.next; } curTemp.next = curr.next; curr.next = firstIndexTemp; } return true; } private ListNode findPrev(int index){ if (index == 0) return null; ListNode prev = head; for (int i = 1; i < index -1; i++){ prev = prev.next; } return prev; } @Override public boolean removeAll(Collection c) throws NullPointerException, UnsupportedOperationException{ // TODO Auto-generated method stub  // Do not need to implement optional exceptions // Check documentation Boolean changed = false; Iterator thisIt = this.iterator(); if(c == null){ throw new NullPointerException(); } while(thisIt.hasNext()) { if( c.contains(thisIt.next()) ) { try{ thisIt.remove(); this.size --; changed = true; }catch(UnsupportedOperationException ex) { throw new UnsupportedOperationException(); } } }//end of while return changed; } @Override public boolean retainAll(Collection c) { // TODO Auto-generated method stub  if (c==null) throw new NullPointerException(); if (this.head == null) return true; while(head.next != null){ head = head.next; } addAll(c); return true; } @Override public void clear() { // TODO Auto-generated method stub  head = null; size = 0; } @Override public Object get(int index) throws IndexOutOfBoundsException{ if(index < 0 || index >= size()) { throw new IndexOutOfBoundsException("Provided index is out of bounds! " + index); } ListNode walk = head; for(int cur = 0; cur < index; walk = walk.next, cur ++){ //empty loop body } return walk.data; } @Override public Object set(int index, Object element) { // TODO Auto-generated method stub  if (index < 0 || index >= this.size) throw new IndexOutOfBoundsException("Provided index is out of bounds! " + index); ListNode temp = new ListNode(element); ListNode cur = this.head.next; ListNode prev = this.head; if (index == 0){ prev.next = temp; temp.next = cur.next; } else{ for(int i = 0; i < index ; i++){ prev = prev.next; cur = cur.next; } prev.next = temp; temp.next = cur.next; } return null; } @Override public void add(int index, Object element) throws IndexOutOfBoundsException{ // TODO Auto-generated method stub  if( index < 0 || index >= this.size +1){ throw new IndexOutOfBoundsException("Provided invalid index integer! " + index); } ListNode temp = new ListNode(element); ListNode curr = head; if (index == 0){ temp.next = curr.next; curr.next = temp; } else{ for(int i = 0; i < index ; i++){ curr=curr.next; } temp.next = curr.next; curr.next = temp; } this.size++; } @Override public Object remove(int index) throws IndexOutOfBoundsException { if(index < 0 || index >= size()) { throw new IndexOutOfBoundsException("Provided index is out of bounds! " + index); } ListNode walk = head.next; ListNode prev = head; for(int cur = 0; cur < index; cur ++){ prev = walk; walk = walk.next; } this.size --; prev.next = walk.next; return walk.data; } @Override public int indexOf(Object o) { // TODO Auto-generated method stub   ListNode curr = head.next; for (int i = 0; i < size; i++){ if( o == null){ if(curr.data == null){ return i; } } else{ if(o.equals(curr.data)){ return i; } } curr = curr.next; } return -1; } @Override public int lastIndexOf(Object o) { // TODO Auto-generated method stub   ListNode curr = head.next; int lastindex = 0; for (int i = 0; i < size; i++){ if( o == null){ if(curr.data == null){ return i; } } else{ if(o.equals(curr.data)){ lastindex = i; } } curr = curr.next; } if(lastindex == 0) return -1; return lastindex; } @Override public ListIterator listIterator() { // TODO Auto-generated method stub  return null; } @Override public ListIterator listIterator(int index) { // TODO Auto-generated method stub  return null; } @Override public List subList(int fromIndex, int toIndex) { // TODO Auto-generated method stub  if(fromIndex < 0 || toIndex > this.size){ throw new IndexOutOfBoundsException("Provided invalid index! "); }/* else { MyLinkedList sublist = new MyLinkedList(); ListNode cur = this.head; Iterator it = this.iterator(); MyLinkedList temp = new MyLinkedList(); temp = for( int i = 0; i <= toIndex; i++){ if(i >= fromIndex && i <= toIndex){ sublist.add(it.next()); sublist.size++; it.hasNext(); }//end if }//end for loop Iterator subit = sublist.iterator(); while(subit.hasNext()){ System.out.println(subit.next()); } }//end else*/ return null; } @Override //this method is equivalent to addLast() public boolean add(Object e) { ListNode walk = head; for(;walk.next != null; walk = walk.next){ //empty loop body } //make new node ListNode anode = new ListNode(e); walk.next = anode; this.size ++; //increment size return true; } public class MyLinkedListIterator implements Iterator { private ListNode cur; private MyLinkedListIterator ( ListNode start ) { this.cur = start.next; //with dummy node } public boolean hasNext() { return cur != null; } public Object next() throws NoSuchElementException { if(hasNext()) { Object data = cur.data; cur = cur.next; return data; } throw new NoSuchElementException(); } public void remove() { throw new UnsupportedOperationException(); } }//end of Iterator @Override public String toString() { String result = "( "; for (ListNode node = this.head.next; node != null; node = node.next) { result += node.data + "-->"; } return result + ")"; } }                                             
                    

                    

                        

                            
Step by Step Solution

                                                            

                                    

                                                                            

                                                                     

                                                    

                        

                            
There are 3 Steps involved in it

                            

                                

                                    1 Expert Approved Answer
                                

                            

                        

                        

                            
                                Step: 1 Unlock 
                            
                                                        blur-text-image
                            

                                Question Has Been Solved by an Expert!
                                
Get step-by-step solutions from verified subject matter experts

                                
                            

                        


                        

                            
                                Step: 2 Unlock 
                            
                        

                        

                            
                                Step: 3 Unlock 
                            
                        

                                            

                                            

                                                            
Students Have Also Explored These Related Databases Questions!

                                

                                                                            

                                            
Q: 

                                            
                                                This help me build the 2 methods addAll(int index, Collection c) and the retainsAll( int index, Collection c) that being in the codes i provided below: import java.io.Serializable; import...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                Assignment 6 Creating Lists Currently in our Facebook application, the first option in the driver program lists the users in some arbitrary order. In this assignment you will split that into two...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                The assignment Assignment 7 Liking Things In this assignment you will add the ability to like things to your Facebook application. Specifically, there should now be two new menu options: one for a...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                LunchOrder The goal of this is to: Create an object which supports the Comparable, Serializable, and Cloneable interfaces. Be able to sort an ArrayList of objects implementing the Comparable...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                I have a PhoneBookDriver class that utilizes a GUI that accepts a name, address, and phone number. The code gathers these entries and uses them to create a Person object and appends the object to a...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                I am supposed to create a phonebook GUI within Java, where a user enters a name, address, and phone number and is added to an ordered list (via binary search tree) and displayed within the GUI. What...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                I need help with this data structures assignment ASAP. Below are the instructions for this assignment. This assignment is about graphs which is related to data structures....                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                Having some issues with this assignment. Any help would be great Listed below is the task needed to be done. This is related to graphs in data structures. Starter code is provided and only one of the...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                Credit for work Please help me fix this Java code bugs... The starter code you downloaded with this assignment is an incomplete graphical tool that lets you point and click to create and destroy...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                Need some help with this graphing assignment related to data structures in Computer Science. The starter code will be provided and instructions are given in the starter code and below....                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                David Company's checkbook balance on December 31, 2020 was P1,200,000. In addition, David Company supplied the following information as of December 31: Check drawn on David Co.'s account in payment...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                Which court(s) have jurisdiction as to each of these lawsuits-state or federal? Explain your reasoning with each. (a) Pat wants to sue his next-door neighbor, Dorothy, claiming that Dorothy promised...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                [ CO 1 ] a ) Draw the BST from the given list from left to right. [ 3 marks ] 2 2 , 4 5 , 2 3 , 1 1 , 3 6 , 2 8 , 5 2 , 8 1 , 6 3 , 7 2 , 9 7 , 1 0 , 1 5 - Your answer b ) Preorder traverse sequence...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                give rationale why mann whitney test best statistical test for this case : Do significant differences exist between husbands and wives regarding holiday depression? There is an ordinal measure of...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                2. What is an information system? How does it work? What are its management, organization, and technology components and why are complementary assets essential for ensuring that information systems...                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                1. How are information systems transforming business, and why are they so essential for running and managing a business today?                                            
                                        

                                                                            

                                            
Q: 

                                            
                                                7. Explain how culture can function as resistance to dominant value systems.