What is the output of the following program? public class output{public static void find (int [] arr1, int [] arr2, int start)int x=0,y=0, m=0;for (int iif (arr1[i]0;ic arr1.length;i++)start)%3D==x++3;for(int jif (arr2[j]= x; j< arr2.length;j++)== start)y++;for(int k0;k< arr2.length;k++)if ((arr2[k]start) && (arr1[k]start))m++3;int R = (x+y)-m;System.out.println (R);} // end of find methodpublic static void main(String [] args) {int [] arr1int [] arr2 =find (arr1, arr2, 10);{10,10,30};{5,10,5};}// end of main}// end of class

Given inputs arr1 = 10 10 30 arr2 = 5 10 5 start = 10 initially x = 0 y=0 m=0 the first for loop…

public class output{ public static void find (int [] arr1,int [] arr2, int start) int x=0,y=0, m=0; for (int i if (arri[i] 0;i< arr1.length;i++) start) == x++; for (int j if (arr2[j] = x; j< arr2.length;j++) start) y++3; 0; k< arr2.length; k++) for(int k { if ((arr2[k] start) && (arr1[k] start)) == m++3; (x+y)-m; System.out.println (R); } // end of find method int R = public static void main(String [] args) { int [] arr1 int [] arr2 find (arr1, arr2, 10); {10,10, 30}; {5,10,5}; %3D }// end of main }// end of class

public class output{ public static void find (int [] arr1,int [] arr2, int start) int x=0,y=0, m=0; for (int i if (arri[i] 0;i< arr1.length;i++) start) == x++; for (int j if (arr2[j] = x; j< arr2.length;j++) start) y++3; 0; k< arr2.length; k++) for(int k { if ((arr2[k] start) && (arr1[k] start)) == m++3; (x+y)-m; System.out.println (R); } // end of find method int R = public static void main(String [] args) { int [] arr1 int [] arr2 find (arr1, arr2, 10); {10,10, 30}; {5,10,5}; %3D }// end of main }// end of class

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

Create a java program Using only one 2-D array (table) with equal odd sizes for its rows and columns, write a complete java program for a magic square. Use the sample output below as your basis for uniformity. Note: A magic square has its rows, columns, and diagonals sum to be ALL EQUAL in value. Input: Enter size = 3 Output: 3 x 3 magic square 8 1 6 3 5 7 4 9 2 Note: All rows, columns, and diagonal sum = 15 Try again (Y/N) Y Input: Enter size = 5 Output: 5 x 5 magic square 17 24 1 8 15 23 5 7 14 16 4 6 13 20 22 10 12 19 21 3 11 18 25 2 9 Note: All rows, columns, and diagonal sum = 65 Try again (Y/N) N Thank you. Have a great day ahead.
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?
Implement the vacuum cleaning agent function in Python/Java for the scenario described below: Consider two-dimensional Boolean array of size m x n (m and n can each be equal to 4) where m is the number of rows, and n is the number of columns. Obtain numerical positive integer values for m and n as inputs from the user. Generate random numbers and scale them down to either a “0” or a “1” according to whether they represent “Clean” or “Dirty”, respectively. After filling the array with 0s or 1s, start at some random array position indicating the initial position of the vacuum cleaner. First check if at that current position, there is the presence of a “Dirt” or not determined by whether 0 or 1 is filled in at that initial position of the vacuum cleaner. If there is a “Dirt”, clean it, and if there is no “Dirt” do a No-operation. After this is done, generate random numbers modulo 4 to obtain random numbers 0, 1, 2, 3 indicating whether to take a left, right, up or down correspondingly. If…
import java.util.Random; class Main { public static void main(String[] args) { Random rand = new Random(); int a = new int[100]; for (int i = 0; i < 100; i++) { a[i] = rand.nextInt(100); } print(a); System.out.println("---"); quicksort(a, 0, a.length - 1); print(a); } public static void print(int[] a) { for (int x : a) { System.out.println(x); } } public static void swap(int[] a, int p1, int p2) { int temp = a[p1]; a[p1] = a[p2]; a[p2] = temp; } public static int partition(int[] a, int left, int right) { int pivot = right; int p1 = left; int p2 = pivot - 1; while (p2 >= p1) { if (a[p1] > a[pivot]) { swap(a, p1, p2); swap(a, p2, pivot); p2 = pivot - 1; } else { p1++; } } return pivot; } public static void quicksort(int[] a, int left, int right) { if (left < right) { int p = partition(a, left, right); quicksort(a, left, p - 1);…
Beginner Java import java.util.Arrays;import java.util.Scanner; Arrays and scanner required. Suppose that a Scanner object contains a bunch of tokens all on a single line separated by spaces. For example: 100.5 65 pizza 100 45.75 70 5.8 5 Also suppose that you have two integers n and m that are both positive. For example: n = 5 and m = 10 Write a static method: public static double partialSum(Scanner s, int n, int m) that takes a Scanner and two integers n and m as arguments and returns the sum of the integers read by the Scanner that are divisible by n and not divisible by m. In the above example, the integers divisible by 5 and not divisible by 10 are 65 and 5, so the result would be 70. If the Scanner is empty, or no tokens are valid integers, the result should be 0. You can assume the Scanner is not null. It is probably easiest to test your method by creating a Scanner with a String instead of System.in. The starter code for an example of how to do this is…
import java.util.* ; public class Averager { public static void main(String[] args) { //a two dimensional array int[][] a = {{5, 9, 3, 2, 14}, {77, 44, 22, 15, 99}, {14, 2, 3, 9, 5}, {88, 15, 17, 121, 33}} ; System.out.printf("Average = %.2f\n", average(a)) ; System.out.println("EXPECTED:") ; System.out.println("Average = 29.85") ; System.out.printf("Average of evens = %.2f\n", averageEvens(a)) ; System.out.println("EXPECTED:") ; System.out.println("Average of evens = 26.57") ; Random random = new Random(1) ; a = new int[100][1] ; for (int i = 0 ; i < 100 ; i++) a[i][0] = random.nextInt(1000) ; System.out.println("For an array of random values in range 0 to 999:") ; System.out.printf("Average = %.2f\n", average(a)) ; System.out.printf("Average of evens = %.2f\n", averageEvens(a)) ; } /** Find the average of all elements of a two-dimensional array @param aa the two…
Fix the Java code below, make sure it can make the same outputs as the sample: import java.util.ArrayList;import java.util.Scanner; class Main{ //Returns index of name if found otherwise -1 public static int findName(ArrayList<String> arr, String name) { for(int i = 0; i < arr.size(); i++) if(arr.get(i).equals(name)) return i; return -1;//Name not found } //Deletes a name from ArrayList public static void deleteName(ArrayList<String> arr, String name) { int index = findName(arr, name);//Get index of name to be deleted for(int i = index; i < arr.size() - 1; i++){ arr.set(i, arr.get(i + 1)); } arr.remove(arr.size() - 1);//Remove last element } public static void main(String[] args) { Scanner scan = new Scanner(System.in); System.out.print("Enter number of students(upto 10): "); int n = scan.nextInt(); ArrayList<String> arr = new…
public class Soru2 { static void sort(char a[]) { for(int i = 0; i < a.length; i++) { for(int j = i + 1; j < a.length; j++) { if(a[j] == 'X' && a[i] == 'O') { char temp = a[j]; a[j]=a[i]; a[i]=temp; } } } for(int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } } public static void main(String[] args) { char a[] = {'X','O','X','O','X','O','X','O','X','O'}; sort(a); } } Calculate the time complexity and number of steps of the algorithm?
Write a client program that loops around getting two fractions from the user,output their sum, and state whether or not they are equal. Keep looping until the first fraction entered is a zero fraction. import java.util.ArrayList;import java.util.Scanner; //Define the class Fractionclass Fraction{private int n, d;public Fraction(){//Initialize the valuesthis.n = this.d = 0;}public Fraction(int n, int d){//Initialize the variablesthis.n = n;this.d = d;}//Define the getter function getNum() that returns the numeratorpublic int getNum(){//Returns numeratorreturn n;}//Define the getter function getDen() that returns the denominatorpublic int getDen(){//Returns denominatorreturn d;}//Define the boolean function isZero() that returns 0 if numerator is 0 and denominator is not equals to zeropublic boolean isZero(){return(getNum() == 0 && getDen() != 0);}public boolean isequals(Object c){Fraction f = (Fraction) c;return(Integer.compare(n,f.n))==0 &&…
(JAVA) Find the maximum value and minimum value in milesTracker. Assign the maximum value to maxMiles, and the minimum value to minMiles. Sample output for the given program: Min miles: -10 Max miles: 40 _________________________________ import java.util.Scanner; public class ArraysKeyValue { public static void main (String [] args) { Scanner scnr = new Scanner(System.in); final int NUM_ROWS = 2; final int NUM_COLS = 2; int [][] milesTracker = new int[NUM_ROWS][NUM_COLS]; int i; int j; int maxMiles; // Assign with first element in milesTracker before loop int minMiles; // Assign with first element in milesTracker before loop for (i = 0; i < milesTracker.length; i++){ for (j = 0; j < milesTracker[i].length; j++){ milesTracker[i][j] = scnr.nextInt(); } } /* Your solution goes here */ System.out.println("Min miles: " + minMiles); System.out.println("Max miles: " + maxMiles); }}
Java problem From the given array, create pairs of numbers from left to right, find the absolute value of the difference between each pair, find the minimum and maximum of the absolute values, and return it to a String array of size 1. Output format : {min_value : max_value} Sample input = {2,-1,4,7,2} Sample output={2:8}
Write a java recursive method called printNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12