Answered step by step
Verified Expert Solution
Question
1 Approved Answer
First, I'm sorry that the image is blurred. I need help for fix my code, right hand side is the assignment description, left hand side
First, I'm sorry that the image is blurred. I need help for fix my code, right hand side is the assignment description, left hand side is the code I wrote that contain errors I think, can anyone help me to fix or re-write the code? Thanks!
92e esuppresswarmingst unchecked 53 verride 94 public bootean equals (Object obj) if (1 (obj instanceof List)) 95 return false: else t ss List Ex other List e (ListeEx) obi: if (other List .size 1m size return false; 108 101 TODO: Add your code ere Entry E trav head 103 fortint i 0: i size: i )f E elem a othertist, get (i ,equals (elen)) 105 286 return false l trav trav getNext 189 return true; equatst obiect obii This method has code checking that is an instance of aeutlyunkadust, and then either retums false or performs the typecast You will now need to perform a list traversal and check that the element in each Entry is equal to the element at the identical index in otherList. The algorithm you must implement (in the area labeled ADo cooE HERE) is: Set trav to the first Entry in the linked list For i 0 to site Set elem equal to the elennnt at ander 1 in athert att if rav s element and eren are equal elenmts return false End if Set trav equal to the next Entry in the list End For return true You SHOULD either use the class of test cases, boubtyunkedListtests, in Activity 5.1 ar to check your code. Remember that Web-CAT uses the last part l of submission as your grade. Be certain to submit your code once you finish so this this assignment. Each method in part l is worth 40%of the activity grade, Morth a total of 80% of the overall scoreStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started