Question 3 Consider the following code: public static boolean[] [] whichOdd (int[][] arr) { boolean[] [] result = new boolean [arr.length] for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr[i].length; j++) { result[i][j] = arr[i][j] % 2 != 0; } [ ] } [ Suppose you have written this solution to a problem that asks you to write a method that accepts a 2D array of integers (guaranteed to be rectangular) and returns a 2D array of boolean s where each element is true if its corresponding element in the parameter 2D array is odd, and false otherwise. You've already tried it with the problem's example which uses 2D array: ] return result; [1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16] and after it's passed to your method, it correctly contains: [true, false, true, false], [true, false, true, false], [true, false, true, false], [true, false, true, false] [ ] } Select an option below that makes a good test candidate to test a different case that shows the presence of a bug. [ ] [ ] [ ] [34, 1], [93, 11], [8, 23] [arr[0].length]; [9] [] ✓SUBMITTED [0, 0, 0], [1, 1, 1], [2, 2, 2]

Question 3 Consider the following code: public static boolean[] [] whichOdd (int[][] arr) { boolean[] [] result = new boolean [arr.length] for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr[i].length; j++) { result[i][j] = arr[i][j] % 2 != 0; } [ ] } [ Suppose you have written this solution to a problem that asks you to write a method that accepts a 2D array of integers (guaranteed to be rectangular) and returns a 2D array of boolean s where each element is true if its corresponding element in the parameter 2D array is odd, and false otherwise. You've already tried it with the problem's example which uses 2D array: ] return result; [1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16] and after it's passed to your method, it correctly contains: [true, false, true, false], [true, false, true, false], [true, false, true, false], [true, false, true, false] [ ] } Select an option below that makes a good test candidate to test a different case that shows the presence of a bug. [ ] [ ] [ ] [34, 1], [93, 11], [8, 23] [arr[0].length]; [9] [] ✓SUBMITTED [0, 0, 0], [1, 1, 1], [2, 2, 2]

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

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 ______________
x <- bubblesort(sample(1:6, size=5, replace=T)) if (x[1]==x[5]){ hand <-"Yahtzee" } else if (x[1]==x[4] ] x[2]==x[5]) { hand <- "4ofKind" } } else { hand <-"Chance" } The above code lays this out for Yahtzee and 4 of a kind. Find statements that work for the rest and put this into a function called get hand , which returns what type of hand was rolled from a sorted roll of five dice. Make sets of rolls and test them to make sure they work. Note that above we use an else if, which allows us to test multiple conditions in an if-else statement.
mergeAndRemove(int[], int[]) This is a public static function that takes a int[] and int[] for the parameters and returns an int[]. Given two arrays of integers. Your job is to combine them into a single array and remove any duplicates, finally return the merged array.
public class ArraySection { static void arraySection(int a[], int b[]) { int k = 0; int [] c = new int[a.length]; for(int i = 0; i < a.length; i++) { for(int j = 0; j < b.length; j++) if(a[i] == b[j]) c[k++] = a[i]; } for(int i = 0; i < k; i++) System.out.println(c[i]); System.out.println(); } public static void main(String[] args) { int a[] = { 1, 2, 3, 4, 5 }; int b[] = { 0, 2, 4,5 }; arraySection(a,b); }} Calculate the algorithm step number and algorithm time complexity of the above program?
CodeW For fun X C Solved https://codeworkou... 臺亂 CodeWorkout X272: Recursion Programming Exercise: Is Reverse For function isReverse, write the two missing base case conditions. Given two strings, this function returns true if the two strings are identical, but are in reverse order. Otherwise it returns false. For example, if the inputs are "tac" and "cat", then the function should return true. Examples: isReverse("tac", "cat") -> true Your Answer: 1 public boolean isReverse(String s1, String s2) { 2. if > 3. 4. else if > return true; return false; 5. 6. else { String s1first = String s2last return s1first.equals (s2last) && 51. substring(0, 1); s2, substring(s2.length() 1); 7. 8. 6. isReverse(s1.substring(1), s2.substring(0, s2.length() 1)); { 12} 1:11AM 50°F Clear 12/4/2021
public static void reverse(ArrayList<Integer> alist){}public static ArrayList<Integer> reverseList(ArrayList<Integer> alist){} How to use these two headers method and a main method to create the output of [1,2,3] [3,2,1]
public class arrayOutput ( public static void main (String [] args) { final int NUM ELEMENTS = 3; int[] userVals = new int [NUM_ELEMENTS]; int i; } Type the program's output userVals [0] = 2; userVals [1] = 6; userVals [2] = 8; for (i = userVals.length - 1; i >= 0; −−1) { System.out.println(userVals [1]); } C.C. ? ? ??
JAVA Language: Transpose Rotate. Question: Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string) import java.util.*; public class TestTranspose { public static void main(String[] args) { String plain = "this is the secret message"; // Here's the message Transpose transpose = new Transpose(); String secret = transpose.encrypt(plain); System.out.println("\n ********* Transpose Cipher Encryption *********"); System.out.println("PlainText: " + plain); // Display the results System.out.println("Encrypted: " + secret); System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt } } abstract class Cipher { public String encrypt(String s) { StringBuffer result = new…
Write an outline and logic for the following code: EMPTY = '-' BLACK = ‘X’ WHITE = ‘O’ BOARD_SIZE = 8 DIRECTIONS = [(0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1)] def initialize_board(): board = [[EMPTY for _ in range(BOARD_SIZE)] for _ in range(BOARD_SIZE)] board[3][3] = WHITE board[3][4] = BLACK board[4][3] = BLACK board[4][4] = WHITE return board def print_board(board): print(" 1 2 3 4 5 6 7 8") for i in range(BOARD_SIZE): print(f"{i + 1} ", end="") for j in range(BOARD_SIZE): print(f" {board[i][j]}", end="") print() def is_valid_move(board, row, col, player): if board[row][col] != EMPTY: return False for direction in DIRECTIONS: dr, dc = direction r, c = row + dr, col + dc while 0 <= r < BOARD_SIZE and 0 <= c < BOARD_SIZE: if board[r][c] == EMPTY: break if board[r][c] == player:…
int getMax(int arr[], int n) { intmx=arr[0]; for (inti=1; i<n; i++) if (arr[i] >mx) mx=arr[i]; returnmx; } Can u give me the code for this one as well....this is the first function and countsort is the second
1. Trace the execution of the following: {0, 1, 2, 3, 4, 5, 6, 7}; int[] anArray for (int i = 3; i 3; i--) 1]; What are the contents of anArray after the execution of each loop?
1. Consider the following program, taking note of blanks 1 - 4. class Probleml { private int maxSize; private char [] stackArray; private int top; public Probleml (int max) { maxSize = max; stackArray top = -1; } public void push (char j) // put item on top of stack { blankl} = new char [maxSize]; public char pop() // take item from top of stack { blank2 } public char peek () // peek at top of stack {blank3 } public boolean isEmpty() // true if stack is empty blank4} } // end class Probleml Write the correct Java statement to fill the blank indicated as blank 1, blank 2, blank 3 and blank 4 in the program. a) blank 1 b) blank 2 c) blank 3 d) blank 4