Which of the following statements are valid? A, int [] [] r = new int [2]; B. int [] x = new int []; OC, int [] [] y = ; new int [3] []; D, int [] [] z = {{1, 2}}; E. int [] [] m = {{1, 2}, {2, 3}}; %3D F, int [] [] n = {{1, 2}, {2, 3}, }; %3D

Which of the following statements are valid? A, int [] [] r = new int [2]; B. int [] x = new int []; OC, int [] [] y = ; new int [3] []; D, int [] [] z = {{1, 2}}; E. int [] [] m = {{1, 2}, {2, 3}}; %3D F, int [] [] n = {{1, 2}, {2, 3}, }; %3D

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

x = zeros(5,5)for i = 1:1:5for j = 1:1:5x(i,j) = i*j;endendWhich of the following best describes the variable i? 1. An array of length 5 2. A constant value in the equation i*j 3. A counting variable that indexes columns 4. A counting variable that indexes rows
Consider the following code: int a[5] = {1,3,5,7,9};int b = a[3]; // <--- here Rewrite the last statement (marked “here”) without using array brackets [ ]. Group of answer choices int b = a + 3; int b = *(a + 3); int b = *a + 3; int b = *(a + 2);
Answer the given question with a proper explanation and step-by-step solution. In Java, please. Consider the following problem. Input: an array of integers A[] Output: rearranges the array to have the following property: Suppose the first element in the original array A[], A[0] = x. In the rearranged array, suppose that x is at index i, that is A[i] = x. Then, we want the rearranged array to be such that A[j] <= x for all j < i and A[j] > x for all j > i. The rearranging should place all the values less than (or equal to) x to the "left" of x and all values larger than x to the right of x. Here's an example. Suppose the array has the elements in this initial order: 4 3 9 2 7 6 5 A[0] = 4. After rearranging elements, we get: 3 2 4 5 9 7 6 That is, A[0] = 4, is positioned in the resulting array so that all elements less than 4 (that is, 2, 3) are to its left (in no particular order), and all elements larger than 4 are to its right (again, in no particular order).
Write in JAVA, JUST CHANGE THE SWAP PART I don't want int i and j in (public static void swap(int[] array, int i, int j)) this part. I want you to do it by writing( public static void swap(int[] array){ Just initialize i and j somewhere else please. How can you do that? public class SelectionSort {public static void main(String[] args) {int[] intarray = {20, 35, -15, 7, 55, 1, -22};for(int lastUnsorted = intarray.length-1;lastUnsorted > 0;lastUnsorted--){// if largest is in 0th index// we start from the 1st index// if 1st is greater than it, swap the elementint largest=0;for(int i=1; i<=lastUnsorted; i++){if(intarray[i] > intarray[largest]){largest = i;}}swap(intarray, largest, lastUnsorted);}for(int i=0; i<intarray.length; i++){System.out.println(intarray[i]);}}public static void swap(int[] array, int i, int j){if(i == j){return;}int temp = array[i];array[i] = array[j];array[j] = temp;}}
Question 1. (-) Analyze the below code: #include <stdio.h> int main(void) { int array1[9]; printf("Enter Array1 elements:"); for(int i=0;i<9;i++) scanf("%d",&array1[i]); for(int i=0;i<9;i++) printf("%d ",array1[i]); return 0; } Add code line to print your name (Ghadeer) and take a screenshot for the program output Array elements should be given as: (-) 3 5 7 11 13 17 19 23 31 Explain the code in your own words in details -) Update the code to have float array elements of size 8. (-) Take a screenshot for the program output. Array elements should be given as : (-) 2.3 4…
Write in JAVA, JUST CHANGE THE SWAP PART I don't want int i and j in (public static void swap(int[] array, int i, int j)) this part. DELETE I, AND J HERE. IT MUST BE JUST INT[] ARRAY I want you to do it by writing( public static void swap(int[] array){ Just initialize i and j somewhere else please. How can you do that? public class SelectionSort {public static void main(String[] args) {int[] intarray = {20, 35, -15, 7, 55, 1, -22};for(int lastUnsorted = intarray.length-1;lastUnsorted > 0;lastUnsorted--){// if largest is in 0th index// we start from the 1st index// if 1st is greater than it, swap the elementint largest=0;for(int i=1; i<=lastUnsorted; i++){if(intarray[i] > intarray[largest]){largest = i;}}swap(intarray, largest, lastUnsorted);}for(int i=0; i<intarray.length; i++){System.out.println(intarray[i]);}}public static void swap(int[] array, int i, int j){if(i == j){return;}int temp = array[i];array[i] = array[j];array[j] = temp;}}
What is the value of the following expressions (or ERROR)?1. __________ s.length()2. __________ t.length()3. __________ 1 + a4. __________ a.toUpperCase()5. __________ "Tomorrow".indexOf("r")6. __________ "Tomorrow".lastIndexOf('o')7. __________ "Tomorrow".substring(2,4)8. __________ (a.length() + a).startsWith("a")9. __________ s = = a10. __________ a.substring(1,3).equals("bc")
I am trying to write a code that swaps 1st element of an array with 2nd one, 3rd with 4th and keeps like that. It is not working and instead I wrote a code that is reversing the order. (better explanation on pictures attached.) I am using Java. public static void swapPairs(String[]array) {for(int i= 0; i< array.length / 2; i++) {int j= array.length - i -1;swap(array, i, j);}}public static void swap(String[] array, int i, int j) {String temp= array[i];array[i]= array[j];array[j]= temp;}
Implement the function below. void swap(int pos1, int pos2){} Initial code to be completed: class ArrayList : public List { int* array; int index; int capacity; void dyn_all_add(){ int cap = ceil(capacity * 1.5); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } void dyn_all_rem(){ int cap = capacity - (capacity/3); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } public: // CONSTRUCTOR ArrayList() { capacity = 4; array = (int*)malloc(capacity); index = 0; } int add(int num) { if (index == capacity){ dyn_all_add(); } *(array + index) = num; index++; return index; } int get(int pos){ if (pos-1 < index){ return *(array + pos-1); } return -1; } int size(){ return index; }…
*IN JAVA PLEASE* 2)For this exercise, you are given an array of integers. Return true if every element in the array is an odd number, otherwise return false. 3) Given an array of strings, return the array in reverse order. For example, given: reverse({"one", "two", "three"}); You would return: {"three", "two", "one"} 4) For this exercise, you need to shift all the elements in the array one space to the right (increase the index of the element by 1). The last element will wrap around and become the new first element. For example, given: moveUp({"first", "second", "third", "fourth"}); You would return: {"fourth", "first", "second", "third"}
Use Java programming. Write the removeEvens() method, which receives an array of integers as a parameter and returns a new array of integers containing only the odd numbers from the original array. The main program outputs values of the returned array. Hint: If the original array has even numbers, then the new array will be smaller in length than the original array and should have no blank elements. Ex: If the array passed to the removeEvens() method is [1, 2, 3, 4, 5, 6, 7, 8, 9], then the method returns and the program output is: [1, 3, 5, 7, 9] Ex: If the array passed to the removeEvens() method is [1, 9, 3], then the method returns and the program output is: [1, 9, 3] import java.util.Arrays; public class LabProgram { public static int[] removeEvens(int [] nums) { /* Type your code here */} public static void main(String[] args) { int [] input = {1,2,3,4,5,6,7,8,9};int [] result = removeEvens(input); // Helper method Arrays.toString() converts int[] to a…
For this assignment please use 2 arrays. Write a program DiscreteDistribution.java that will take an integer command-line argument m, followed by a sequence of positive integer command-line arguments a1,a2,…,ana1,a2,…,an, and will print m random indices (separated by whitespace), choosing each index i with probability proportional to ai.