If we implement a queue using an array where we treat the array as if its two ends are "tap together", we call that a linear array. O True

using arrays or Arraylist in Java language Write the method filterBySize().* * Given an ArrayList of String, return a new list where only * strings of the given length are retained.* * Examples:* filterBySize(["a", "bb", "b", "ccc"], 1) returns ["a", "b"]* filterBySize(["a", "bb", "b", "ccc"], 3) returns ["ccc"]* filterBySize(["a", "bb", "b", "ccc"], 4) returns []* * @param list the list of Strings to process.* @param n the size of words to retain.* @return a new list of words with the indicated size retained.

Heapsort has heapified an array to: 76 62 40 32 30 and is about to start the second for loop. What is the array after each loop iteration? i= 4: Ex: 86, 75, 30 i = 3: i = 2: i= 1:

Heapsort has heapified an array to: 63 50 37 26 89 and is about to start the second for loop. What is the array after each loop iteration? i = 4: Ex: 86, 75, 30 i = 3: i = 2: i = 1:

Searches – Directed Lab Work1. When an object does not occur in an array, a sequential search for it must examine the entirearray. If the array is sorted, you can improve the search by using the approach described inExercise 2. A jump search is an attempt to reduce the number of comparisons even further.Instead of examining the n objects in the array a sequentially, you look at the elements a[j],a[2j], a[3j], and so on, for some positive j < n. If the target t is less than one of these objects,you need to search only the portion of the array between the current object and the previousobject. For example, if t is less than a[3j] but is greater than a[2j], you search the elementsa[2j + 1], a[2j + 2], . . ., a[3j - 1] by using the method in Exercise 2 on the textbook’s page544. The implementation should take care of the case when t > a[k × j], but (k + 1) × j > n.Devise an algorithm for performing a jump search.Then, using⌈√n⌉as the value of j, implement the jump search. Add more…

In python. Write a LinkedList class that has recursive implementations of the add and remove methods. It should also have recursive implementations of the contains, insert, and reverse methods. The reverse method should not change the data value each node holds - it must rearrange the order of the nodes in the linked list (by changing the next value each node holds). It should have a recursive method named to_plain_list that takes no parameters (unless they have default arguments) and returns a regular Python list that has the same values (from the data attribute of the Node objects), in the same order, as the current state of the linked list. The head data member of the LinkedList class must be private and have a get method defined (named get_head). It should return the first Node in the list (not the value inside it). As in the iterative LinkedList in the exploration, the data members of the Node class don't have to be private. The reason for that is because Node is a trivial class…

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

Heapsort has heapified an array to: 96 71 57 36 25 and is about to start the second for loop. What is the array after each loop iteration? i= 4: Ex: 86, 75, 30 i = 3: i = 2: i = 1:

Using Java. Import ArrayList

For the non-recursive towers problem, we used an array of vectors to represent the towers: vector T[3]. To move the top of tower from to the top of tower to. we would write: T[to],push_front(T[from].back()) T[to].push_back(T[from].pop_back()) T[to).push_back(T[from].back()) T[tol.push_front(T[from].pop_back()) O None of the above