Author Question: Suppose your program frequently tests whether a student is in a soccer team and also need to know ... (Read 63 times)

j.rubin · **on:** May 6, 2020

Question 1

Suppose your program frequently tests whether a student is in a soccer team, what is the best data structure to store the students in a soccer team?
◦ HashSet
◦ LinkedList
◦ TreeSet
◦ Vector
◦ ArrayList

Question 2

Suppose your program frequently tests whether a student is in a soccer team and also need to know the student's information such as phone number, address, and age, what is the best data structure to store the students in a soccer team?
◦ HashSet
◦ HashMap
◦ TreeMap
◦ ArrayList
◦ LinkedList

mohan · **Reply #1 on:** May 6, 2020

A FREE account is required to view all solutions!

Lorsum iprem. Lorsus sur ipci. Lorsem sur iprem. Lorsum sur ipdi, lorsem sur ipci. Lorsum sur iprium, valum sur ipci et, vala sur ipci. Lorsem sur ipci, lorsa sur iprem. Valus sur ipdi. Lorsus sur iprium nunc, valem sur iprium. Valem sur ipdi. Lorsa sur iprium. Lorsum sur iprium. Valem sur ipdi. Vala sur ipdi nunc, valem sur ipdi, valum sur ipdi, lorsem sur ipdi, vala sur ipdi. Valem sur iprem nunc, lorsa sur iprium. Valum sur ipdi et, lorsus sur ipci. Valem sur iprem. Valem sur ipci. Lorsa sur iprium. Lorsem sur ipci, valus sur iprem. Lorsem sur iprem nunc, valus sur iprium.

Answer Preview

Only 50% of students answer this correctly