Requirements:Multidimensional Array.Java Programming.Exact output of the code same with the sample outputs. 2. Print Multidimensional ArrayElements in Reverse Orderby CodeChum AdminAsk the user to input the rows and columns of amultidimensional array and its elements. Then, print the itselements starting from the end (i.e. last row, last column) allthe way to the start (i.e. first row, first column)Sample Output 1Enter number of rows: 3Enter number of columns: 3Enter element at row 0, column 0: 1Enter element at row 0,column 1: 2Enter element atrow 0,column 2: 3Enter element atrow 1,column 0: 4Enter element atrow 1,column 1: 5Enter element atrow 1,column 2: 6Enter element at row 2,column 0: 7Enter element at row 2,Enter element at row 2,963∞05~8 7241column 1: 8column 2: 9 Sample Output 2Enter number of rows: 2Enter number of columns: 4Enter element at row 0, column 0: 10Enter element at row 0,column 1: 20Enter element at row 0,Enter element atrow 0,Enter element atrow 1,Enter element at row 1,Enter element at row 1, column 2: 35Enter element at row 1, column 3: 4545 35 25 1540 30 20 10Sample Output 3Enter number of rows: 4Enter number of columns: 3Enter element at row 0, column 0: 4Enter element atrow 0,column 1: 5Enter element at row 0,Enter element at row 1,Enter element atrow 1,Enter element atrow 1,Enter element atrow 2,Enter element at row 2,Enter element at row 2,column 2: 30column 3: 40column 0: 15column 1: 25لیاEnter element at row 3,column 0: 7Enter element at row 3,column 1: 8Enter element at row 3, column 2: 99 8 712 11 1032 1546stcolumn 2: 6column 0: 1column 1: 2column 2: 3column 0: 10column 1: 11column 2: 12

Introduction Java Programming: Java is a general-purpose, object-oriented programming language…

2. Print Multidimensional Array Elements in Reverse Order by CodeChum Admin Ask the user to input the rows and columns of a multidimensional array and its elements. Then, print the its elements starting from the end (i.e. last row, last column) all the way to the start (i.e. first row, first column) Sample Output 1 Enter number of rows: 3 Enter number of columns: 3 Enter element at row 0, column 0: 1 Enter element at row 0, column 1: 2 Enter element at row 0, column 2: 3 Enter element at row 1, column 0: 4 Enter element at row 1, column 1: 5 Enter element at row 1, column 2: 6 Enter element at row 2, colum 0: Enter element at row 2, column 1: 8 element at row 2, column 2: 9 Enter 7 4 1 963 5052 8

2. Print Multidimensional Array Elements in Reverse Order by CodeChum Admin Ask the user to input the rows and columns of a multidimensional array and its elements. Then, print the its elements starting from the end (i.e. last row, last column) all the way to the start (i.e. first row, first column) Sample Output 1 Enter number of rows: 3 Enter number of columns: 3 Enter element at row 0, column 0: 1 Enter element at row 0, column 1: 2 Enter element at row 0, column 2: 3 Enter element at row 1, column 0: 4 Enter element at row 1, column 1: 5 Enter element at row 1, column 2: 6 Enter element at row 2, colum 0: Enter element at row 2, column 1: 8 element at row 2, column 2: 9 Enter 7 4 1 963 5052 8

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

Write a program that reads an integer array a[] from the console and writes out the subsequence of the array that sums to the largest value. If there are more than one such subsequence, then the program should write out the subsequence that starts at the smallest position in the array and, if there are more than one subsequence of largest sum starting at the same smallest position, it should write out the shortest such subsequence.
Write a program to shift all the zero present in the array in the alternative order, For example.Input array: -1 2 0 8 5 0 0 6Output array: -1 0 2 8 0 5 0 6Sample Input:First input should describe the number of elements in the array and in the second line take all the input. 50 1 2 0 3Output: -1 0 2 0 3
reversing the elements of an array involves swapping the corespodning elements of the array: the first with the last, the second with the next to the last, and so on, all the way to the middle of the array. given an array a, an int variable n containing the number of elements in a, and two other int variables, k and temp, write a loop that reverses the elements of the array. do not use any other variables besides a, n, k, and temp. in c++
Write a program that does the following:- Prompts the user to enter 5 double floating point numbers and stores them in array A.- Creates another array B, and fills it by summing up the values of each two consecutivearray elements from array A.- Prints array B.For example, for array A = [2.2, 3.5, 6.7, 4.3, 1.5], array B will be = [5.7, 10.2, 11, 5.8]
Write an c progra, that takes an array of N integers (N will be specified by the user at run time). It then finds how many numbers in the array are divisible by 3 and how many numbers are divisible by 7. the it copies, from the input array above, the numbers that are divisible by 3 into a new array and those divisible by 7 into a different new array. Once copied, the algorithm should compute the average of each of these two new arrays and print the averages on the screen with suitable message to let the user know which average is being printed Note: an integer number is divisible by 3 (respectively 7) if the remaining of its division by 3 (respectively 7) is 0. You are allowed to use the modulus operator %.
First, write a Java method merge that takes as parameter a non-empty double array representing employees’ salaries. The method merges the values of every 2 adjacent elements. put the merged values at the beginning of the array, and put 0 in the remaining positions. Suppose that the original array will contain an even number of elements. Second, write two java methods readArray(int[]a) and printArray(int[]a) that reads/writes the elements of an array passed in parameter from/to the standard input/output. Finally, Use the following main method to test your different methods: public class MergeSalary { private static Scanner input = new Scanner(System.in); public static void main(String[] args) { } } double[] salaries = new double[10]; System.out.print("Enter 10 salaries: "); readArray(salaries); merge(salaries); System.out.print("Salaries after merge: "); printArray(salaries); Hint: For the method merge, you can work on the same array or use a temporary array. Run example:…
First, write a Java method merge that takes as parameter a non-empty double array representing employees’ salaries. The method merges the values of every 2 adjacent elements. put the merged values at the beginning of the array, and put 0 in the remaining positions. Suppose that the original array will contain an even number of elements. Second, write two java methods readArray(int[]a) and printArray(int[]a) that reads/writes the elements of an array passed in parameter from/to the standard input/output. Finally, Use the following main method to test your different methods:
Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array
Write a program that has an double array intArray[] that has N elements and is initialized with values start from 0 and incremented by 1 and then multiplied by 2. Your task is to print the address of the odd index and its value. [Note: you can define the value of N at least 10 or more] PLEASE DO NOT USE ANY INDEX TO ACCESS ELEMENTS OF THE ARRAY. Sample Output:Elements of intArray:0 24 6 8 10 12 14 16 18The address of index 1 is: Ox7ffebe1108c4 and the vlaue holds is 2The address of index 3 is: 0x7ffebe1108cc and the vlaue holds isThe address of index 5 is: 0x7ffebe1108d4 and the vlaue holds is 10The address of index 7 is: 0x7ffebe1108dc and the vlaue holds is 14The address of index 9 is: 0x7ffebe1108e4 and the vlaue holds is 18
Write a Program for insertion and deletion from an array without replacement of element from the arrays. Also, write a program to search the array for the presence of a given element from an array. Write the sub-functions in the provided test case in text form and upload the same. #include<stdio.h> #include<stdlib.h> int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int insert_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of insertion, x: element to insert*/ /*output:-1 indication error or 0 if successful /* write the function for inserting element into a position*/ } int delete_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of deletion, x: element to deletion*/ /*output:-1 indication error or 0 if successful /* write the function for delete element into a position*/ } int linear_search_function(int *data, int n, int x) { /*write the function to…
Write a Java program to implement a 3X3 integer array and print the sum of each row and each column of that array. Take the array elements from console (keyboard) during the program execution. You can use Scanner class. Sample output: Sum of elements of first row: 14 Sum of elements of second row: 13 Sum of elements of third row: -5 Sum of elements of first column: 1 Sum of elements of second column: 6 Sum of elements of third column: 14
Write method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example: Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {