Unit 7 and 8 comp
Consider the following method. public static void sort(String[] arr) { for (int pass = arr.length - 1; pass >= 1; pass--) { String large = arr[0]; int index = 0; for (int k = 0; k <= pass; k++) { if ((arr[k].compareTo(large)) > 0) { large = arr[k]; index = k; } } arr[index] = arr[pass]; arr[pass] = large; } } Assume arr is the following array. "Ann""Mike""Walt""Lisa""Shari""Jose""Mary""Bill" What is the intermediate value of arr after two iterations of the outer for loop in the call sort(arr)? A) "Ann""Mike""Walt""Lisa""Shari""Jose""Mary""Bill" B) "Ann""Mike""Lisa""Shari""Jose""Mary""Bill""Walt" C) "Ann""Bill""Jose""Lisa""Mary""Mike""Shari""Walt" D) "Ann""Mike""Bill""Lisa""Mary""Jose""Shari""Walt" E) "Walt""Shari""Ann""Lisa""Mike""Jose""Mary""Bill"
"Ann""Mike""Lisa""Shari""Jose""Mary""Bill""Walt"
Which of the following could be used to replace /* missing code */ so that averageAgeInMajor will compile without error?
(B)if (theMajor.equals(k.getMajor())){sum += k.getAge();count++;}
Which of the following represents board after this code segment is executed?
(E) [answer has the most O's]
Assume that myList is an ArrayList that has been correctly constructed and populated with objects. Which of the following expressions produces a valid random index for myList? A (int) ( Math.random () * myList.size () ) - 1 B (int) ( Math.random () * myList.size () ) C (int) ( Math.random () * myList.size () ) + 1 D (int) ( Math.random () * (myList.size () + 1) ) E Math.random (myList.size () )
(int) ( Math.random () * myList.size () )
Consider the following code segment. int[][] arr = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {3, 2, 1}}; for (int j = 0; j < arr.length; j++) { for (int k = j; k < arr[0].length; k++) { System.out.print(arr[j][k] + " "); } System.out.println(); } What output is printed when the code segment is executed? A) 2 3 6 B) 1 2 3 4 5 7 C) 1 2 3 5 6 9 D) 1 4 7 5 8 9 E) 1 2 3 5 6 9 1
1 2 3 5 6 9
Consider the following code segment. int[][] points = {{11, 12, 13, 14, 15}, {21, 22, 23, 24, 25}, {31, 32, 33, 34, 35}, {41, 42, 43, 44, 45}}; for (int row = 0; row < points.length; row++) { for (int col = points[0].length - 1; col >= row; col--) { System.out.print(points[row][col] + " "); } System.out.println(); } What is printed when this code segment is executed? A 15 14 25 24 23 35 34 33 32 45 44 43 42 41 B 15 14 13 12 25 24 23 35 34 45 C 11 12 13 14 15 21 22 23 24 31 32 33 41 42 D 15 14 13 12 11 25 24 23 22 35 34 33 45 44 E 15 14 13 12 11 25 24 23 22 21 35 34 33 32 31 45 44 43 42 41
15 14 13 12 11 25 24 23 22 35 34 33 45 44
Consider the following code segment, where num is an integer variable. int[][] arr = {{11, 13, 14 ,15}, {12, 18, 17, 26}, {13, 21, 26, 29}, {14, 17, 22, 28}}; for (int j = 0; j < arr.length; j++) { for (int k = 0; k < arr[0].length; k++) { if (arr[j][k] == num) { System.out.print(j + k + arr[j][k] + " "); } } } What is printed when num has the value 14 ? A) 14 14 B) 16 17 C) 17 16 D) 18 19 E) 19 18
16 17
Consider the following data field and method. The method removeDups is intended to remove all adjacent duplicate numbers from myData, but does not work as intended. private ArrayList myData; public void removeDups () { int k = 1; while (k < myData.size()) { if (myData.get(k).equals(myData.get(k - 1))) { myData.remove(k); } k++; } } For example, if myData has the values 3 3 4 4 4 8 7 7 7, after calling removeDups, myData should have the values 3 4 8 7. Assume that myData has the following values. 2 7 5 5 5 5 6 6 3 3 3 Which of the following represents myData after the incorrect removeDups is executed? A) 2 7 5 6 3 B) 2 7 5 6 3 3 C) 2 7 5 5 6 3 3 D) 2 7 5 5 5 6 3 3 E) 2 7 5 5 5 5 6 6 3 3
2 7 5 5 6 3 3
Consider the following code segment. int[][] values = {{1, 2, 3}, {4, 5, 6}}; int x = 0; for (int j = 0; j < values.length; j++) { for (int k = 0; k < values[0].length; k++) { if (k == 0) { values[j][k] *= 2; } x += values[j][k]; } } What is the value of x after the code segment is executed? A) 7 B)17 C)21 D)26 E)27
26
In the code segment below, assume that the ArrayList object numbers has been properly declared and initialized to contain [0, 2, 4, 5]. for (int k = numbers.size() - 1; k >= 0; k--) { if (numbers.get(k) > k) { System.out.print(k + " "); } } What, if anything, is printed as a result of executing the code segment? A) 1 2 3 B) 2 4 5 C) 3 2 1 D) 5 4 2 E) Nothing will be printed because an IndexOutOfBoundsException will occur.
3 2 1
In the following code segment, assume that the ArrayList data has been initialized to contain the Integer values [4, 3, 4, 5, 3, 4]. int j = 0; while (j < data.size() - 1) { if (data.get(j) > data.get(j + 1)) { System.out.print(data.get(j + 1) + " "); } j++; } What, if anything, is printed as a result of executing the code segment? A) 3 3 B) 4 5 C) 4 5 4 D) Nothing is printed because the code segment does not compile. E) Nothing is printed because an IndexOutOfBoundsException occurs.
3 3
Consider the following correct implementation of the selection sort algorithm. public static void selectionSort(int[] elements) { for (int j = 0; j < elements.length - 1; j++) { int minIndex = j; for (int k = j + 1; k < elements.length; k++) { if (elements[k] < elements[minIndex]) { minIndex = k; // Line 11 } } if (j != minIndex) { int temp = elements[j]; elements[j] = elements[minIndex]; elements[minIndex] = temp; } } } The following declaration and method call appear in the same class as selectionSort. int[] vals = {5, 10, 2, 1, 12}; selectionSort(vals); How many times is the statement minIndex = k; in line 11 of the method executed as a result of the call to selectionSort ? A 0 B 1 C 2 D 3 E 4
4
Consider the following code segment. int[][] arr = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}}; int sum = 0; for (int[] x : arr) { for (int y = 0; y < x.length - 1; y++) { sum += x[y]; } } What is the value of sum as a result of executing the code segment? A) 36 B) 54 C) 63 D) 68 E) 78
54
Consider the following code segment. int[ ] oldArray= {1,2,3,4,5,6,7,8,9}; int [ ] [ ] newArray= new int [3][3]; int row=0; int col=0; for (int value : oldArray) { newArray[row][col]=value; row++; if ((row%3)==0) { col++; row=0; } } System.out.println(newArray[0][2]); What is printed as a result of executing the code segment? A) 3 B) 4 C) 5 D) 7 E) 8
7
Consider the following code segment. int[] oldArray = {1, 2, 3, 4, 5, 6, 7, 8, 9}; int[][] newArray = new int[3][3]; int row = 0; int col = 0; for (int index = 0; index < oldArray.length; index++) { newArray[row][col] = oldArray[index]; row++; if ((row % 3) == 0) { col++; row = 0; } } System.out.println(newArray[0][2]); What is printed as a result of executing the code segment? A) 3 B) 4 C) 5 D) 7 E) 8
7
int [ ] [ ] numbers= {{1,2,3}, {4,5,6}}; Which of the following code segments produces the output 123456?
A) for (int [ ] row : numbers) { for (int n : row) { System.out.print(n); ) )
Consider the following sort method. This method correctly sorts the elements of array data into increasing order. public static void sort (int[ ] data) { for (int j=0; j<data.length-1; j++) { int m=j; for (int k=j+1; k<data.length; k++) { if (data[k]<data[m]) { m=k; } } int temp=data[m]; data[m]=data[j]; data[j]=temp; } } Assume that sort is called with the array {1, 2, 3, 4, 5, 6}. How many times will the expression indicated by /* Compare values */ and the statement indicated by /* Assign to temp */ execute? A) Compare values / Assign to temp15 / 0 B) Compare values / Assign to temp 15 / 5 C) Compare values / Assign to temp 15 / 6 D) Compare values / Assign to temp 21 / 5 E) Compare values / Assign to temp 21 / 6
Compare values / Assign to temp 15 / 5
Consider the following two data structures for storing several million words. I. An array of words, not in any particular order II. An array of words, sorted in alphabetical order Which of the following statements most accurately describes the time needed for operations on these data structures? A Inserting a word is faster in II than in I. B Finding a given word is faster in I than in II. C Finding a given word is faster in II than in I. D Finding the longest word is faster in II than in I. E Finding the first word in alphabetical order is faster in I than in II.
Finding a given word is faster in II than in I.
Consider the following code segment. String[][] arr = {{"Hello,", "Hi,", "Hey,"}, {"it's", "it is", "it really is"}, {"nice", "great", "a pleasure"}, {"to", "to get to", "to finally"}, {"meet", "see", "catch up with"}, {"you", "you again", "you all"}}; for (int j = 0; j < arr.length; j++) { for (int k = 0; k < arr[0].length; k++) { if (k == 1) { System.out.print(arr[j][k] + " "); } } } What, if anything, is printed when the code segment is executed? A) Nothing is printed due to an ArrayIndexOutOfBoundsException. B) Hello, it's nice to meet you C) Hey, it really is a pleasure to finally catch up with you all D) Hi, it is great to get to see you again E) it's it is it really is
Hi, it is great to get to see you again
Consider the following class definition. public class Value { private int num; public int getNum() { return num; } // There may be instance variables, constructors, and methods not shown. } The following method appears in a class other than Value. It is intended to sum all the num instance variables of the Value objects in its ArrayList parameter. /** Precondition: valueList is not null */ public static int getTotal(ArrayList<Value> valueList) { int total = 0; /* missing code */ return total; } Which of the following code segments can replace /* missing code */ so the getTotal method works as intended? for (int x = 0; x < valueList.size(); x++){ total += valueList.get(x).getNum();} for (Value v : valueList){ total += v.getNum();} for (Value v : valueList){ total += getNum(v);} A I only B II only C III only D I and II E I and III
I and II
Consider the following declaration of the class NumSequence, which has a constructor that is intended to initialize the instance variable seq to an ArrayList of numberOfValues random floating-point values in the range [0.0, 1.0). public class NumSequence { private ArrayList<Double> seq; // precondition: numberOfValues > 0 // postcondition: seq has been initialized to an ArrayList of // length numberOfValues; each element of seq // contains a random Double in the range [0.0, 1.0) public NumSequence(int numberOfValues) { /* missing code */ } } Which of the following code segments could be used to replace /* missing code */ so that the constructor will work as intended? I. ArrayList<Double> seq = new ArrayList<Double>(); for (int k = 0; k < numberOfValues; k++) seq.add(new Double(Math.random())); II. seq = new ArrayList<Double>(); for (int k = 0; k < numberOfValues; k++) seq.add(new Double(Math.random())); III. ArrayList<Double> temp = new ArrayList<Double>(); for (int k = 0; k < numberOfValues; k++) temp.add(new Double(Math.random())); seq = temp; A II only B III only C I and II D I and III E II and III
I and III
Consider the following Util class, which contains two methods. The completed sum1D method returns the sum of all the elements of the 1-dimensional array a. The incomplete sum2D method is intended to return the sum of all the elements of the 2-dimensional array m. Assume that sum1D works correctly. Which of the following can replace / * missing code * / so that the sum2D method works correctly? A I only B II only C I and II only D II and III only E I, II, and III
I, II, and III
Consider the following method. /** Removes all occurrences of nameToRemove from nameList. * @param nameList a list of names * @param nameToRemove a name to be removed from nameList */ public void removeName(List<String> nameList, String nameToRemove) { /* missing implementation */ } Which of the following can be used to replace /* missing implementation */ so that removeName will work as intended? I. for (String name : nameList) { if (name.equals(nameToRemove)) name.remove(); } II. for (int k = 0; k < nameList.size(); k++) { if (nameList.get(k).equals(nameToRemove)) nameList.remove(k); } III. for (int k = nameList.size() - 1; k >= 0; k--) { if (nameList.get(k).equals(nameToRemove)) nameList.remove(k); } A) I only B) II only C) III only D) II and III only E) I, II, and III
III only
Consider the static method selectSort shown below. Method selectSort is intended to sort an array into increasing order; however, it does not always work as intended. // precondition: numbers.length > 0 // postcondition: numbers is sorted in increasing order public static void selectSort(int[] numbers) { int temp; Line 1: for (int j = 0; j < numbers.length - 1; j++) { Line 2: int pos = 0; Line 3: for (int k = j + 1; k < numbers.length; k++) { Line 4: if (numbers[k] < numbers[pos]) { Line 5: pos = k; } } temp = numbers[j]; numbers[j] = numbers[pos]; numbers[pos] = temp; } } Which of the following changes should be made so that selectSort will work as intended? A) Line 1 should be changed to for (int j = 0; j < numbers.length - 2; j++) B) Line 2 should be changed to int pos = j; C) Line 3 should be changed to for (int k = 0; k < numbers.length; k++) D) Line 4 should be changed to if (numbers[k] > numbers[pos]) E) Line 5 should be changed to k = pos;
Line 2 should be changed to int pos = j;
Consider the following data field and method. private int[][] mat; public int mystery(int r, int c) { if (r != 0 || c != 0) { return (mat[r][c] + mystery(r - 1, c - 1)); } else { return mat[r][c]; } } Assume that mat is the 2-D array shown below. 0 1 2 3 0 0 1 2 3 1 4 5 6 7 2 8 9 10 11 3 12 13 14 15 What value is returned as a result of the call mystery(2, 3)? A) 1 B) 11 C) 17 D) 18 E) No value is returned because mystery throws an ArrayIndexOutOfBoundsException.
No value is returned because mystery throws an ArrayIndexOutOfBoundsException.
Assume that a two-dimensional (2D) array arr of String objects with 3 rows and 4 columns has been properly declared and initialized. Which of the following can be used to print the elements in the four corner elements of arr ? A) System.out.print(arr[0, 0] + arr[0, 3] + arr[2, 0] + arr[2, 3]); B) System.out.print(arr[1, 1] + arr[1, 4] + arr[3, 1] + arr[3, 4]); C) System.out.print(arr[0][0] + arr[0][2] + arr[3][0] + arr[3][2]); D) System.out.print(arr[0][0] + arr[0][3] + arr[2][0] + arr[2][3]); E) System.out.print(arr[1][1] + arr[1][4] + arr[3][1] + arr[3][4]);
System.out.print(arr[0][0] + arr[0][3] + arr[2][0] + arr[2][3]);
Consider the following method, which is intended to return a list containing the elements of the parameter myList with all even elements removed. public static ArrayList<Integer> removeEvens(ArrayList<Integer> myList) { for (int i = 0; i < myList.size(); i++) { if (myList.get(i) % 2 == 0) { myList.remove(i); } } return myList; } Which of the following best explains why the code segment does not work as intended? A The code segment causes an IndexOutOfBoundsException for all lists because of an incorrect Boolean expression in the for loop. B The code segment causes an IndexOutOfBoundsException for lists with at least one even element because the indexes of all subsequent elements change by one when a list element is removed. C The code segment returns a list with fewer elements than intended because it fails to consider the last element of myList. D The code segment removes the wrong elements of myList because the condition in the if statement to test whether an element is even is incorrect. E The code segment skips some elements of myList because the indexes of all subsequent elements change by one when a list element is removed.
The code segment skips some elements of myList because the indexes of all subsequent elements change by one when a list element is removed.
The following method is intended to remove all elements of an ArrayList of integers that are divisible by key and add the removed elements to a new ArrayList, which the method returns. public static ArrayList<Integer> match(ArrayList<Integer> numList, int key) { ArrayList<Integer> returnList = new ArrayList<Integer>(); int i = 0; while (i < numList.size()) { int num = numList.get(i); if (num % key == 0) { numList.remove(i); returnList.add(num); } i++; } return returnList; } As an example, if the method is called with an ArrayList containing the values [5, 2, 10, 20, 16] and the parameter key has the value 5, then numList should contain [2, 16] at the end of the method and an ArrayList containing [5, 10, 20] should be returned. Which of the following best explains why the method does not always work as intended? A) The method attempts to add an element to returnList after that element has already been removed from numList. B) The method causes a NullPointerException to be thrown when no matches are found. C) The method causes an IndexOutOfBoundsException to be thrown. D) The method fails to correctly determine whether an element of numList is divisible by key. E) The method skips some elements of numList during the traversal.
The method skips some elements of numList during the traversal.
Consider the following data field and method. The method removeDups is intended to remove all adjacent duplicate numbers from myData, but does not work as intended. private ArrayList myData; public void removeDups () { int k = 1; while (k < myData.size()) { if (myData.get(k).equals(myData.get(k - 1))) { myData.remove(k); } k++; } } For example, if myData has the values 3 3 4 4 4 8 7 7 7, after calling removeDups, myData should have the values 3 4 8 7. Which of the following best describes how to fix the error so that removeDups works as intended? A) k should be initialized to 0 at the beginning of the method. B) The while condition should be (k < myData.size() - 1). C) The if test should be (myData.get(k).equals(myData.get(k + 1))). D) The body of the if statement should be: myData.remove(k - 1); E) There should be an else before the statement k++;
There should be an else before the statement k++;
Consider the following instance variable and method. Assume that animals has been instantiated and initialized with the following contents. What will the contents of animals be as a result of calling manipulate? A ["baboon", "zebra", "bass", "cat", "bear", "koala"] B ["bear", "zebra", "bass", "cat", "koala", "baboon"] C ["baboon", "bear", "zebra", "bass", "cat", "koala"] D ["bear", "baboon", "zebra", "bass", "cat", "koala"] E ["zebra", "cat", "koala", "baboon", "bass", "bear"]
["bear", "zebra", "bass", "cat", "koala", "baboon"]
Consider the following code segment. ArrayList<String> numbers = new ArrayList<String>(); numbers.add("one"); numbers.add("two"); numbers.add(0, "three"); numbers.set(2, "four"); numbers.add("five"); numbers.remove(1); Which of the following represents the contents of numbers after the code segment has been executed? A ["one", "four", "five"] B ["three", "two", "five"] C ["three", "four", "two"] D ["three", "four", "five"]
["three", "four", "five"]
public static void mystery(List<Integer> nums) { for (int k=0; k< nums.size(); k++) { if (nums.get(k).intValue()==0 { nums.remove(k); } } } Assume that a List<Interger> values initially contains the following Integer values. [ 0,0,4,2,5,0,3,0] What will values contain as a result of executing mystery(values)? A [0, 0, 4, 2, 5, 0, 3, 0] B [4, 2, 5, 3] C [0, 0, 0, 0, 4, 2, 5, 3] D [0, 4, 2, 5, 3] E The code throws an ArrayIndexOutOfBoundsException exception.
[0, 4, 2, 5, 3]
Consider the following code segment. List <String> animals= new ArrayList<String>(); animals.add("dog"); animals.add("cat"); animals.add("snake"); animals.set(2, "lizard"); animals.add(1, "fish"); animals.remove(3); System.out.println(animals); What is printed as a result of executing the code segment? A [dog, fish, cat] B [dog, fish, lizard] C [dog, lizard, fish] D [fish, dog, cat] E The code throws an ArrayIndexOutOfBoundsException exception.
[dog, fish, cat]
Consider the following method. public boolean checkIndexes(double[][] data, int row, int col) { int numRows = data.length; if (row < numRows) { int numCols = data[0].length; return col < numCols; } else { return false; } } Consider the following variable declaration and initialization, which appears in a method in the same class as checkIndexes. double[][] table = new double[5][6]; Which of the following method calls returns a value of true ? A) checkIndexes(table, 4, 5) B) checkIndexes(table, 4, 6) C) checkIndexes(table, 5, 4) D) checkIndexes(table, 5, 6) E) checkIndexes(table, 6, 5)
checkIndexes(table, 4, 5)
Consider the following method, which is intended to print the values in its two-dimensional integer array parameter in row-major order. public static void rowMajor(int[][] arr) { /* missing code */ } As an example, consider the following code segment. int[][] theArray = {{1, 2}, {3, 4}, {5, 6}, {7, 8}}; rowMajor(theArray); When executed, the code segment should produce the following output. 1 2 3 4 5 6 7 8 Which of the following code segments can replace /* missing code */ so that the rowMajor method works as intended? A) for (int j : arr){ for (int k : j) { System.out.print(j + " "); }} B) for (int j : arr){ for (int k : j) { System.out.print(k + " "); }} C) for (int[] j : arr){ for (int k : j) { System.out.print(j + " "); }} D) for (int[] j : arr){ for (int k : j) { System.out.print(k + " "); }} E) for (int[] j : arr){ for (int k : j) { System.out.print(arr[k] + " "); }}
for (int[] j : arr) { for (int k : j) { System.out.print(k + " "); } }
Consider the following code segment, where nums is a two-dimensional (2D) array of integers. The code segment is intended to print "test1234". System.out.print("test" + nums[0][0] + nums[1][0] + nums[1][1] + nums[0][1]); Which of the following code segments properly declares and initializes nums so that the code segment works as intended? A int[][] nums = {{1, 2}, {3, 4}}; B int[][] nums = {{1, 2}, {4, 3}}; C int[][] nums = {{1, 3}, {2, 4}}; D int[][] nums = {{1, 4}, {2, 3}}; E int[][] nums = {{1, 4}, {3, 2}};
int[][] nums = {{1, 4}, {2, 3}};
The following incomplete method is intended to sort its array parameter arr in increasing order. // postcondition: arr is sorted in increasing order public static void sortArray(int[] arr) { int j, k; for (j = arr.length - 1; j > 0; j--) { int pos = j; for ( /* missing code */ ) { if (arr[k] > arr[pos]) { pos = k; } } swap(arr, j, pos); } } Assume that swap(arr, j, pos) exchanges the values of arr[j] and arr[pos]. Which of the following could be used to replace /* missing code */ so that executing the code segment sorts the values in array arr? A) k = j - 1; k > 0; k-- B) k = j - 1; k >= 0; k-- C) k = 1; k < arr.length; k++ D) k = 1; k > arr.length; k++ E) k = 0; k <= arr.length; k++
k = j - 1; k >= 0; k--
Consider the following code segment, where letters is a two-dimensional (2D) array that contains possible letters. The code segment is intended to print "DIG". String[][] letters = {{"A", "B", "C"}, {"D", "E", "F"}, {"G", "H", "I"}}; System.out.println( /* missing code */ ); Which of the following could replace /* missing code */ so that the code segment works as intended? A) letters[2][1] + letters[3][3] + letters[3][1] B) letters[2][0] + letters[2][2] + letters[1][0] C) letters[1][2] + letters[3][3] + letters[1][3] D) letters[1][0] + letters[2][2] + letters[2][0] E) letters[0][1] + letters[2][2] + letters[0][2]
letters[1][0] + letters[2][2] + letters[2][0]
Consider the following interface and class declarations. Which of the following can be used to replace /* expression */ so that getTotalMileage returns the total of the miles traveled for all vehicles in the fleet? A) getMileage (v) B) myVehicles [v] .getMileage () C) Vehicle.get (v) .getMileage () D) myVehicles.get (v) .getMileage () E) v.getMileage ()
v.getMileage ()
Consider the following sort method. This method correctly sorts the elements of array data into increasing order. Assume that sort is called with the array {6, 3, 2, 5, 4, 1}. What will the value of data be after three passes of the outer loop (i.e., when j = 2 at the point indicated by / * End of outer loop * /) ? A) {1, 2, 3, 4, 5, 6} B) {1, 2, 3, 5, 4, 6} C) {1, 2, 3, 6, 5, 4} D) {1, 3, 2, 4, 5, 6} E) {1, 3, 2, 5, 4, 6}
{1, 2, 3, 5, 4, 6}
Consider the following method. public static int [ ] operation (int[ ][ ] matrix, int r, int c) { int [ ] result= new int [matrix.length]; for (int j=0; j< matrix.length; j++) { result[j]=matrix[r][j]*matrix[j][c]; } return result; } The following code segment appears in another method in the same class. int[ ][ ] mat= { {3,2,1,4}, {1,2,3,4}, {2,2,1,2},{1,1,1,1}}; int [ ] arr=operation(mat,1,2); Which of the following represents the contents of arr as a result of executing the code segment? A {6, 4, 2, 4} B {1, 6, 3, 4} C {4, 3, 6, 1} D {4, 4, 2, 2} E {2, 2, 4, 4}
{1,6,3,4}
