Question

True for false

1. An arraylist is a statically allocated data structure (true/false)
2. Program efficiency is best calculated by counting the execution times of programs(true/false)
3. There are algorithms that are cheaper, hence faster than O(N²) when sorting a highly unsorted list(true/false)
4. Java handles cleanup of unreferenced objects in memory automatically (true/false)

Answer 1

1. An arraylist is a statically allocated data structure (false) { because ArrayList can resize itself to grow when required means ArrayList is dynamic in nature.}
2. Program efficiency is best calculated by counting the execution times of programs  (true) {A good program is correct, but a great program is both correct and efficient. The most efficient program is one that takes the least amount of execution time and memory usage possible while still yielding a correct answer.}
3. There are algorithms that are cheaper, hence faster than O(N²) when sorting a highly unsorted list (true) { merge sort work faster O(nlogn) when sorting a highly unsorted list ( worst case).}
4. Java handles cleanup of unreferenced objects in memory automatically (true) { yes java use garbage collector to remove the unreferenced objects from heap memory.} do like if it is helpful.