int[] array = { 2, 6, 4, 12, 7, 8, 9, 13, 2 }; var orderedFilteredArray = from element in array where element < 7 orderby element select element; PrintArray(orderedFilteredArray, "All values less than 7 and sorted:"); TASK 1. Re-write this code using Lambda. Submit your source code and the output. TASK 2. Create an array2 that consists of your KEAN ID digits. Write a code using Lambda function to display only even numbers from array2. Submit your source code and the output

Hello! I need some help with my Java homework. Please use Eclipse Please add comments to the to program so I can understand what the code is doing and learn Create a new Eclipse project named so as to include your name (eg smith15 or jones15). In this project, create a new package with the same name as the project. In this package, write a solution to the exercise noted below. Implement the following method that returns the maximum element in an array: public static <E extends Comparable<E>> E max(E[] list) Write a test program that generates 10 random integers, invokes this method to find the max, and then displays the random integers sorted smallest to largest and then prints the value returned from the method.  Max sure the the last sorted and returned value as the same!

Write a loop that counts how many elements in an array are equal to zero. arrays.cpp 1 #include // sizet 2 int countZeros (const int values[], size_t size) { int count = 0; 3 4 for (int i; i using namespace std; 3 2 4 int countZeros(const int values[], size_t size); 5 int main() { int a[] = {1, 2, 0, 3}; cout <« countZeros (a, 4) <« endl; cout « "Expected: 1" « endl; 6 7 8 9 10 11 int b[] = {0, 2, 0, 3}; cout <« countZeros (b, 4) <« endl; cout « "Expected: 2" « endl; 12 13 14 15 int cl] -{1, 0, θ, 0, 0 ; cout <« countZeros (c, 5) <« endl; cout « "Expected: 4" « endl; 16 17 18 19 } CodeCheck Reset Testers Running Tester.cpp pass fail fail 1 Expected: 1 Expected: 2 Expected: 4 Score 1/3

For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }

Given the below 2 arrays: int​ arr1​[]​ ​=​ ​{​ 9,8,7,6,5,4,3,2,1,0 ​}; int​ arr2​[]​ ​=​ ​{​ ​99, 89, 79, 69, 59​ ​}; Write a program to replace 79 in arr2 with 4 from arr1. Print the final arr2 using Arrays.toString() method. Hint​: Use ​System​.​arraycopy() methodNote​: For all these programs, please submit the program’s .java file and screenshot of output.

Can someone please explain whats going on in this code Can comments be added please?   class twoDarray(list):           def __init__(self, array):        try:            if(not isinstance(array[0],list)):                raise TypeError             x = len(array[0])             for i in array:                if len(i)!=x:                    raise KeyError        except TypeError:            print("error Not a 2d array.")            return        except KeyError:            print("error Lists are not of equal size.")            return                 self.array = array             def __str__(self):        return '[' + "\n ".join([str(arr) for arr in self.array]) + ']'        def shape(self):        return (len(self.array), len(self.array[0]))

My issue: I don't know where add the statement to print the numbers[i] array. I don't know what loop to use to show how each element was sorted invididually until it reaches the correct descending order as shown in the images  I don't know how to line up number of lines as shown in the images.  Code:  import java.util.Scanner; public class DescendingOrder {// TODO: Write a void method selectionSortDescendTrace() that takes // an integer array and the number of elements in the array as arguments, // and sorts the array into descending order.public static void selectionSortDescendTrace(int [] numbers, int numElements) {//my code starts hereint i;int j;int elementIndex;int temp; for (i=0; i < numElements-1; ++i) {elementIndex=i;for (j=i+1; j < numElements; ++j) {if (numbers[j] > numbers[elementIndex]) {elementIndex=j;}}temp=numbers[i];numbers[i]=numbers[elementIndex];numbers[elementIndex]=temp;}for(int ti=0;ti<10;ti++){System.out.print(numbers[ti]+" ");}}//my code ends…

text file 80 1 2 3 100 100 100 1001 0 2 100 3 4 100 1002 2 0 4 4 100 5 1003 100 4 0 100 100 4 100100 3 4 100 0 3 3 3100 4 100 100 3 0 100 1100 100 5 4 3 100 0 2100 100 100 100 3 1 2 0 My code below. I am getting an error when trying to create my adjacency matrix. i dont know what i am doing wrong def readMatrix(inputfilename):    ''' Returns a two-dimentional array created from the data in the given file.            Pre:  'inputfilename' is the name of a text file whose first row contains the            number of vertices in a graph and whose subsequent rows contain the rows of            the adjacency matrix of the graph. '''        # Open the file    f = open(inputfilename, 'r')     # Read the number of vertices from the first line of the file    n = int(f.readline().strip())     # Read the rest of the file stripping off the newline characters and splitting it into    # a list of intger values    rest = f.read().strip().split()         # Create the adjacency matrix    adjMat = []…

Write a loop that sets newScores to oldScores shifted once left, with element 0 copied to the end. Ex: If oldScores = {10, 20, 30, 40}, then newScores = {20, 30, 40, 10}.Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int oldScores[4]). Also note: If the submitted code tries to access an invalid array element, such as newScores[9] for a 4-element array, the test may generate strange results. Or the test may crash and report "Program end never reached", in which case the system doesn't print the test case that caused the reported message. #include <iostream>using namespace std; int main() {   const int SCORES_SIZE = 4;   int oldScores[SCORES_SIZE];   int newScores[SCORES_SIZE];   int i;    for (i = 0; i < SCORES_SIZE; ++i) {      cin >> oldScores[i];   }    /* Your solution goes here  */    for (i = 0; i < SCORES_SIZE; ++i) {      cout << newScores[i] << " ";   }   cout…

Determine if the following statement are true or false screen shot shows the text's SortedArrayCollection and ArrayCollection When comparing two objects using the == operator, what is actually compared is the references to the objects. When comparing two objects using the equals method inherited from the Object class, what is actually compared is the references to the objects. The text's sorted array-based collection implementation stores elements in the lowest possible indices of the array. The text's array-based collection implementation stores elements in the lowest possible indices of the array.