" The ArrayList is no better than an array since it can only store homogeneous data – that is all the data needs to be the same type." Confirm or refute! Back up your position with code!

4. Now examine the ArrayList methods in the above table, a) Which method retrieves elements from the ArrayList? b) Which method replaces the value of an element that already exists in the ArrayList? c) Which two methods initializes the value of an element? d) How do the two methods in (c) differ? Which method(s) would be appropriate in the above Java program (after we convert it to work with ArrayLists)?

How do you do this? JAVA

You are given an array-like data structure Listy which lacks a size method. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers, find the index at which an element x occurs. If x occurs multiple times, you may return any index. Write code with explanation

Question 1 Which of the following is NOT true about ArrayLists? ArrayLists can only hold Objects, not primitive types. ArrayLists have built in methods that you can call on them for quick add, delete, search, etc. ArrayLists can hold more elements than an Array. ArrayLists have a flexible size which you do not have to define at declaration.

Q1. Implement a SnapshotArray that supports the following interface: SnapshotArray(int length) initializes an array-like data structure with the given length. Initially, each element equals 0. void set(index, val) sets the element at the given index to be equal to val. int snap() takes a snapshot of the array and returns the snap_id: the total number of times we called snap() minus 1. int get(index, snap_id) returns the value at the given index, at the time we took the snapshot with the given snap_id Example 1: Input: ["SnapshotArray","set","snap","set","get"] [[3],[0,5],[],[0,6],[0,0]] Output: [null,null,0,null,5] Explanation: SnapshotArray snapshotArr = new SnapshotArray(3); // set the length to be 3 snapshotArr.set(0,5); // Set array[0] = 5 snapshotArr.snap(); // Take a snapshot, return snap_id = 0 snapshotArr.set(0,6); snapshotArr.get(0,0); // Get the value of array[0] with snap_id = 0, return 5..

Determine if the following statements is true or false. Screen shot shows the text's arraycollection and sortedarraycollection With the text's array-based collection implementation, the set of stored elements is scattered about the array. The text's sorted array-based collection implementation stores elements in the lowest possible indices of the array. When comparing two objects using the equals method inherited from the Object class, what is actually compared is the contents of the objects.

Design and implement a class called RandomArray, which has an integer array. The constructor receives the size of the array to be allocated, then populates the array with random numbers from the range 0 through the size of the array. Methods are required that return the minimum value, maximum value, average value, and a String representation of the array values. Document your design with a UML Class diagram. Create a separate driver class that prompts the user for the sample size, then instantiates a RandomArray object of that size and outputs its contents and the minimum, maximum, and average values.

An_array and a number kFind the max elements of each of its sub-arrays of length k. Keep indexes of good candidates in deque d.The indexes in d are from the current window, they're increasing,and their corresponding nums are decreasing.Then the first deque element is the index of the largest window value. For each index i: 1. Pop (from the end) indexes of smaller elements (they'll be useless).2. Append the current index.3. Pop (from the front) the index i - k, if it's still in the deque (it falls out of the window).4. If our window has reached size k, append the current window maximum to the output..