all questions are in the pics, thanks! 42. Consider the two methods below?public static void sort (ArrayList list){for (int p = 0; p < list.size(); p++){int smallest = p;for (int q = p+1; q < list.size(); q++){if (list.get(q) < list.get(smallest)){smallest = q;}}swap(list,p,smallest);}}private static void swap (ArrayList list, int x, int y){int temp = list.get(x);list.set(x,list.get(y));list.set(y,temp);42. Which of the following sorts is implemented above?Bubble SortSelection SortInsertion SortMerge SortNone of the above 43. Consider the code segment and sort method below.ArrayList list = new ArrayList();for (int k = 1; k <= 20; k++){}sort(list);for (int item: list)int rnd = (int) (Math.random() * 90 + 10);list.add(rnd);}System.out.println();public static void sort (ArrayList list){System.out.print(item + " ");}for (int p = 0; p < list.size(); p++){}int smallest = p;for (int q = p+1; q < list.size(); q++)if (list.get(q) < list.get(smallest))smallest = q;swap(list,p,smallest);private static void swap (ArrayList list, int x, int y){int temp = list.get(x);list.set(x,list.get(y));list.set(y,temp);43. What can be printed when the program is executed?11 18 22 22 31 33 41 41 48 57 60 65 72 75 78 81 90 90 92 9789 89 88 86 86 81 79 69 64 63 57 55 51 51 45 37 33 18 17 15O 7 11 26 28 29 31 41 43 44 47 50 51 63 64 67 74 89 91 93 9793 83 70 67 59 57 52 51 40 34 30 27 21 18 18 16 14 11 10 10Both (B) and (D)

42. Consider the two methods below? public static void sort (ArrayList list) { for (int p = 0; p < list.size(); p++) { } int smallest = p; for (int q = p+1; q list, int x, int y) { int temp = list.get(x); list.set(x,list.get(y)); list.set(y,temp); 42. Which of the following sorts is implemented above? Bubble Sort Selection Sort Insertion Sort Merge Sort None of the above

42. Consider the two methods below? public static void sort (ArrayList list) { for (int p = 0; p < list.size(); p++) { } int smallest = p; for (int q = p+1; q list, int x, int y) { int temp = list.get(x); list.set(x,list.get(y)); list.set(y,temp); 42. Which of the following sorts is implemented above? Bubble Sort Selection Sort Insertion Sort Merge Sort None of the above

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

class Solution(object): def longestCommonPrefix(self, strs): result ="" for i in strs[0]: for j in strs[1]: for k in strs[2]: if i == j and i == k: result+=i if len(result) >0: return result else: return result IndexError: list index out of range for j in strs[1]: Line 5 in longestCommonPrefix (Solution.py) ret = Solution().longestCommonPrefix(param_1) Line 31 in _driver (Solution.py) _driver() Line 41 in <module> (Solution.py) can someone explain why this is wrong?
Trace insertion sort for list ={18,57,8,89,7}
Find the index of the first negative numberIntegerListUtils.java import java.util.ArrayList; public class IntegerListUtils { /** * Finds the index of the first negative number in the list. * * @param numbers a list of integers * @return the index of the first negative number, or -1 if no negative number found */ public static int findIndexOfFirstNegative(ArrayList<Integer> numbers) { // complete this method }}
void funi (int iist , int s) { int sum=0; for (int i = 0; i
int list[3]; for (int i = 0; i < 3; i++) { list[i] = 2 * i + 6; if (i % 2 == 0) list[i] = list[i] - 3; } for (int i = 0; i < 3; i++) cout<
data structure-JAVA
public class ShoppingListDriver{ public static void main(String[] args){  ShoppingList sl=new ShoppingList(3);sl.insert(null);sl.insert(new Item("Bread", "Carb Food", 2, 2.99));sl.insert(new Item("Seafood","Sea Food", -1, 10.99));sl.insert(new Item("Rice", "Carb Food",2, 19.99));sl.insert(new Item("Salad Dressings","Dessing", 2, 19.99));sl.insert(new Item("Eggs", "Protein",2, 3.99));sl.insert(new Item("Cheese","Protein", 2, 1.59));sl.insert(new Item("Eggs", "Protein",3, 3.99));sl.printNames();sl.print();  System.out.println("After removing Eggs:");sl.remove(new Item("Eggs","Protein",0,0));sl.printNames();sl.print();  }}
public static int[] goodResize(int[] list, int newSize)                         {           assert list != null && newSize >= 0 : "failed precondition";                                     int[] result = new int[newSize];                                     int limit = Math.min(list.length, newSize);                                     for(int i = 0; i < limit; i++)                                     {           result[i] = list[i];                                     }                                     return result;                         }             **Note: Software testing & quality assurance Question: Create a control flow graph based on the coding above and find all these paths: Statement coverage Branch coverage Predicate coverage
public static int[] goodResize(int[] list, int newSize)                         {           assert list != null && newSize >= 0 : "failed precondition";                                     int[] result = new int[newSize];                                     int limit = Math.min(list.length, newSize);                                     for(int i = 0; i < limit; i++)                                     {           result[i] = list[i];                                     }                                     return result;                         }             **Note: Software testing & quality assurance Question: Create a control flow graph (CFG) based on the coding above and find all these paths Statement coverage Branch coverage Predicate coverage
Question 37 public static void main(String[] args) { Dog[] dogs = { new Dog(), new Dog()}; for(int i = 0; i >>"+decision()); } class Counter { private static int count; public static void inc() { count++;} public static int getCount() {return count;} } class Dog extends Counter{ public Dog(){} public void wo(){inc();} } class Cat extends Counter{ public Cat(){} public void me(){inc();} } The Correct answer: Nothing is output O 2 woofs and 5 mews O 2 woofs and 3 mews O 5 woofs and 5 mews O
PROBLEM STATEMENT: In this problem you will need to insert 5 at the frontof the provided ArrayList and return the list. import java.util.ArrayList;public class InsertElementArrayList{public static ArrayList<Integer> solution(ArrayList<Integer> list){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>(); Can you help me with this question The Language is Java
java program : Assume that the following method is added to the class KWLinkedList. What is the functionality of the following method? public E function() { Node<E> temp = tail; tail.prev.next = null; tail = temp.prev; size--; return temp.data; } Return the second last element of the list but do not remove it. Return the second last element of the list and remove it from the list. Return the element at the tail of the list and remove it from the list. Return the element at the tail of the list but do not remove it.