========== A06 Report ========== Name: A-Number: REMEMBER to turn off any cpu-hogging programs before you run ListComparisons. REMEMBER that the program may take several seconds to finish its tests. ------ Part I ------ Insert the output of the original program between the lines below: ------------------------------------------------------------------------ ------------------------------------------------------------------------ If the elapsed time reported at the bottom of the program output is more than ten seconds, then revise the constants according to the assignment description, and put the output from the revised program between the lines below: ------------------------------------------------------------------------ ------------------------------------------------------------------------ ----- Q1: Are all the columns in the tables monotone increasing? (That is, is every number in the table larger than the number just above it?) (Yes./No.) ----- Q2: Suppose one of the numbers in the table was smaller than the number above it. What might explain that? (insert text here) ------- Part II ------- Insert the output of the revised program between the lines below: ------------------------------------------------------------------------ ------------------------------------------------------------------------ ----- Q3: For each column of times, say whether it is mostly or entirely increasing or decreasing. Build/Empty ArrayList: (mostly/entirely) (increasing/decreasing) Build/Empty LinkedList: (mostly/entirely) (increasing/decreasing) Random Access ArrayList: (mostly/entirely) (increasing/decreasing) Random Access LinkedList: (mostly/entirely) (increasing/decreasing) ----- Q4: For each of the two tasks, say which kind of List is faster. Build/Empty: ______List is (mostly/always) faster. Random Access: ______List is (mostly/always) faster. ----- Q5: Which (if any) lengths are the other way around? Build/Empty: The ______List is faster on (no) length(s) (...). Random Access: The ______List is faster on (no) length(s) (...). ----- Q6: Which ratio is increasing for each task as the length increases? Build/Empty: The (A/L or L/A) ratio is (mostly) increasing. Random Access: The (A/L or L/A) ratio is (mostly) increasing. ----- Q7: As the lists get longer, does it become more or less important to choose the "faster" version of the list? (More/Less) important. ----- Q8: If you press the enter key three times quickly at the first pause, what is the "total time" reported by NetBeans (or your IDE) for the program run? It says the total time is ____ seconds. ----- Q9: About how long would your program run if you changed the number of tests to be 100 times as large (e.g. from 10 to 1,000 or 100 to 10,000)? It would take about ___ minutes and ___ seconds.