PLEASE ANSWER THIS MCQ WITH OUTPUT Question 8What will be printed if the following Java code is executed?public static int doesSomething( int[] list, int val)int value - e;for( int i- é; i< list.length; i ++)if (list[ij -= val)value = value + 2;return value;public static void main(String[] args) {int[] a - (12,8,3,2,4,2,0,3,1,3,2,1,0,1);System.out.print(doesSomething(a,2));

Java Code: public class Main{ public static int doesSomething(int[] list, int val) {…

What will be printed if the following java code is executed? public static int doesSomething( int[] list, int val int value -e; for int i- 0; t< list.length; t +) if (List[i] -- val) value - value 2; return value; public stattc void main(String(] args) { int[] a- (12,8,3,2,4,2,0,3,1,3,2,1,0,1); System.out. print(doesSomething(a,2)); O 3 O 4 O 6

What will be printed if the following java code is executed? public static int doesSomething( int[] list, int val int value -e; for int i- 0; t< list.length; t +) if (List[i] -- val) value - value 2; return value; public stattc void main(String(] args) { int[] a- (12,8,3,2,4,2,0,3,1,3,2,1,0,1); System.out. print(doesSomething(a,2)); O 3 O 4 O 6

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

main.cpp:4:17: error: 'string' has not been declared 4 | void KMPSearch(string pat, string txt) main.cpp:4:29: error: string' has not been declared 4 | void KMPSearch(string pat, string txt) Aununun main.cpp:31:25: error: string' has not been declared 31 | void computelPSArray(string pat, int M, int[] lps) main.cpp:31:50: error: expected or . before lps' 31 | void computeLlPSArray(string pat, int M, int[] lps) main.cpp:55:8: error: expected :' before 'static' 55 | public static void Main() main.cpp:61:2: error: expected ;' after class definition 61 | } | main.cpp: In member function 'void GFG::KMPSearch(int, int)': main.cpp:6:15: error: request for member Length' in 'pat', which is of non-class type 'int' 6 | int M = pat.Length; main.cpp:7:15: error: request for member Length' in txt’, which is of non-class type 'int' int N = txt.Length; main.cpp:8:6: warning: structured bindings only available with -std3c++17' or (-std=gnu++17' 8 | int[] lps new int[M];
In Java list all the values of the array after the function is called A. static void Fun(int[][]list){ int temp=list[1][2]; list[1][2]=list[0][2]; list[0][2]=temp; } public static void main(String[] args) { int [][]arr={{10,20,30},{100,200,300}}; Fun(arr); } 10,20,30,300 B. static void Fun(int[]list) { list[3]=5;} public static void main(String[] args) { int []arr={5,6,7,9}; Fun(arr); } C. static void Fun(int[][]list){ list[1][0]=0;} public static void main(String[] args) { int [][]arr={{-2,-3,-4},{5,6,7,9}}; Fun(arr); }
public static void main(String[] args) { int[] funky = {1, -5, 3, -5, 6, 6, 6, 7, -5};int expectedFunkyRange = 5; // |6 - 1| = 5System.out.println("Expected funkyRange of " + Arrays.toString(funky) + " to be " + expectedFunkyRange + " and got " + funkyRange(funky));int[] funkyTwo = {6, 6, 4, 4, 4, 2, 2, 8, 4, 1, 1};int expectedFunkyRangeTwo = 4; // |4 - 8| = 4System.out.println("Expected funkyRange of " + Arrays.toString(funkyTwo) + " to be " + expectedFunkyRangeTwo + " and got " + funkyRange(funkyTwo)); Write a static method: public static int WeirdRange(int[] a) that that calculates the difference between the mode and "anti-mode" of an array of integers. This difference should be a positive number (you can use Math.abs to calculate an absolute value). If the array is empty or null, return -1. If the array has only one thing in it, return 0 (since the mode and anti-mode are the same). Definitions: The mode of an array is the element that occurs the most frequently.…
;import java.util.Scanner } public class Task1 ;static Scanner cin=new Scanner(System.in) ;int n } ;System.out.printlIn("Enter n : ") :On=cin.nextInt { ;int list]=new int[n] }0void readData }for(int i=0;i
1 public static int sum(int x, int y){ 2 int z = x +y; 3 return z; 4 } 5 public static void main(String[] args){ 6 … 7 sum(a+2, b); 8 … 9 } write the signature of the method sum: sum(int,int) *Method name/parameter list list local variables of sum: x, y, and y are local variables of the function. list the parameters of sum: int x, int y write the line number where a call to sum occurs 7 list the arguments for the above call list the return type of sum here ______________
public static void bubblesort(int[] list) { assert list != null : "failed precondition"; int temp; boolean changed = true; for(int i = 0; i < list.length && changed; i++) { changed = false; for(int j = 0; j < list.length - i - 1; j++) { assert (j > 0) && (j + 1 < list.length) : "loop counter j " + j + "is out of bounds."; if(list[j] > list[j+1]) { changed = true; temp =…
public static void bubblesort(int[] list) {assert list != null : "failed precondition"; int temp; boolean changed = true; for(int i = 0; i < list.length && changed; i++) { changed = false; for(int j = 0; j < list.length - i - 1; j++) { assert (j > 0) && (j + 1 < list.length) : "loop counter j " + j + "is out of bounds.";if(list[j] > list[j+1]) { changed = true; temp = list[j + 1]; list[j + 1] = list[j]; list[j] = temp;} } } assert isAscending( list ); } Question (Data Flow Graph & Testing): draw DFG from the code above find the all-def/c/p use paths. Generate test cases to test this function using JUnit! (to test all-def/c/p use path)
7. (* =: 'a In this problem, you will determine what the following method does. public static void rra(int[] list, int start, int end) { if (start >= end) { return; } int tmp = list[start]; list [start] = list[end] = tmp; list[end]; // recursion! rra(list, start+1, end-1); } Suppose list = [0, 2, 4, 6, 8, 10, 12, 14, 16]. (a) ) W= ta . What happens to list when rra(list, 0, 4) is called? Show memory diagrams and/or stack frames to explain what the recursive calls are. (b) (в) с oj What happens to list when rra(list, 0, list.length - 1) is called? st Show memory diagrams and/or stack frames to explain what the recursive calls are.
public class ReplaceEvenWithZero { public static void main(String[] args) { int[]a = new int[]{14, 2, 19, 3, 15, 22, 18, 7, 44, 39, 51, 78} ; // Print array a for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); // Replace the even elements. replaceEven(a); // Print array a again to see new elements. for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); } /** Replace the even elements in the given array with 0 @param arr the array to use for the replacements */ public static void replaceEven(int[] arr) { //-----------Start below here. To do: approximate lines of code = 2 // Write a for loop to go through each element, determine if it is even //If so, replace with 0. Hint: use the modulus operator % to determine if an…
Consider the following function: public void bSearch(int[] A, int value, int start, int end) { if (end value) { return bSearch(A, value, start, mid); } else if (value > A[mid]) { return bSearch(A, value, mid+1, end); } else { return mid; } } The mutation program P' changes the part as shown below. } else if (value > A[mid]) { return bSearch(A, value, mid+2, end); } else { return mid; } A test input is given t1: {A = [2, 3, 5, 7, 10, 11], value = 6, start=0, end=5}. Which statement below best describes the mutant with regards to the test input? O a. t1 resolves mutant P O b. The mutant P' with regards to test input t1 is live.
void func(vector<string>& names){ sort(names.begin(), names.end()); //(a) for(int i = names.size() - 1; i > 0; --i){. //(b) if(names[i] == names[i - 1]){ names[i] = move(names.back()); names.pop_back(); } } } What are the reasons or consequences for the programmer’s choice to loop backwards in the line marked (b), and under what circumstances would the algorithm behave differently if that line were replaced with: for (int i = 1; i < names.size(); ++i) ? What would change?
In Java what is stored in the array list after the following Java code executes? list[0] = 5; for (int i = 1; i < 6; i++) { list[i] = i * i + 5; if ( i > 2) list[i] = 2 * list[i] – list[i– 1]; }