What description to Array and Linked List is mistake ?   a. Using Linked list, if there is a existed data will be removed, it needs only to move the links of data node and doesn't need to change the location of data saved.   b. Using Linked list, if there is a new data will be increased, it needs only to move the links of data node and doesn't need to change the location of data saved.   c. If the size of main memory is enough, there is no upper bound limitation to increase new data when Linked list is used.   d. For limited number of data, Array is allocated less memory size, because all sequential data are allocated into continuously space   e. Using Array, if there is a new data will be increased, it needs to move some existed data to new location to free the suitable location new data because the sequential order should be kept.   f. If the size of main memory is enough, there is no upper bound limitation to increase new data when Array is used.   g. The operations on Array is expensive.   h. For limited number of data, Linked List is allocated more memory size, because it needs extra space to save the address of next node.   a to h, which is the answer?

You have been given two integer arrays/list(ARR1 and ARR2) of size N and M, respectively You need to print their intersection; An intersection for this problem can be defined when both the arrays/lists contain a particular value or to put it in other words, when there is a common value that exists in both the arrays/lists The first line contains an Integer Y which denotes the number of test cases or queries to be run. Then the test cases follow. First line of each test case or query contains an integer 'N' representing the size of the first array/list. Second line contains 'N' single space separated integers representing the elements of the first the array/list. Third line contains an integer 'M' representing the size of the second array/list Fourth lino contains 'M' single space separated integers representing the elements of the second array/list Output format For each teot caco, print the intersection elements in a row, separated by a single space! Output for every test case will be…

Programming language: Processing from Java Question attached as photo Topic: Use of Patial- Full Arrays

What should the array will look like after the function Partition () has been called once in a Quicksort.   Input Array: (Hint: pivot should be the last element)   2 8 7 1 3 5 6 4

please help

In c++  Please show me the Test output *You may not use any STL containers in your implementations Need help with the following functions: -LinkedList(const LinkedList<T>& other_list) Constructs a container with a copy of each of the elements in another, in the same order. -LinkedList& operator=(const LinkedList& other_list) Replaces the contents of this list with a copy of each element in another, in the same order. -void resize(std::size_t n) resizes the list so that it contains n elements. -void resize(std::size_t n, const T &fill_values) resizes the list so that it contains n elements -void remove(const T &val) Removes from the container all the elements that compare equal to val - bool operator == (const LinkedList &another) Compares this list with another for equality - bool operator != (const LinkedList &another) Compares this list with another for equality   CODE #include <iostream> template <typename T> class LinkedList {    struct…

Help with writing a program a C program implements a bubble sort algorith on an array of integers, and use command line paramameters to populate an array with data. The program should follow below guidelines if possible: If there are no command-line arguments at all when the program is run, the program should print out instructions on its use (a "usage message"). There should be one common usage message (consider a method/function for printing the usage message) for any type of usage error. The program will accept an A or D as the second command line argument (after the program name). This letter will tell you whether the bubble sort should sort in ascending or descending fashion. Anything other than A or D in that position should display the usage message and terminate the program. The program will be able to accept up to 32 numbers (integers) on the command line. If there are more than 32 numbers on the command line, or no numbers at all, the program should print out the usage…

please answer

please help me to  answer

please answer