Write a program that produces ten random permutations of the numbers 1 to 10. To generate a random permutation, you need to fill an array with the numbers 1 to 10 so that no two entries of the array have the same contents. You could do it by brute force, generating random values until you have a value that is not yet in the array. But that is inefficient. Instead, follow this algorithm: 1. Make a second array and fill it with the numbers 1 to 10. 2. Repeat 10 times A. Pick a random element from the second array.

Write a program that produces ten random permutations of the numbers 1 to 10. To generate a random permutation, you need to fill an array with the numbers 1 to 10 so that no two entries of the array have the same contents. You could do it by brute force, generating random values until you have a value that is not yet in the array. But that is inefficient. Instead, follow this algorithm: 1. Make a second array and fill it with the numbers 1 to 10. 2. Repeat 10 times A. Pick a random element from the second array.

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

FOR JAVA // Question is the first one, try to solve it by using the second question. Repeat the second question, but if there are multiple occurrences of the number, your program must return the largest index instead of the small- est. Write a method that takes a one dimensional integer array and an integer, and returns the index of the integer in the array. If the integer is not in the array, your program must return -1. If there are multiple occurrences of that number, your program must return the smallest index.
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 %.
How to write a program in java that ask the user to input an int size value into a 2d array, then output a table of random 0 and 1 of that size (table must be a perfect square), then output the fraction of your array that is ones and the fraction that is zeros, then output the sum for each row, the sum of colunms and which row and colunm have the largest sum, then determine if the largest row sum is greater than the largest column sum or vice versa, then output the sum of the diagonal(the diagonal starting at location [0][0] and going down to [N-1][N-1] for an array of size N) and determine if the diagonal sum is greater or equal to the largest row sum and greater than or equal to the largest column sum? output should look similar to screen shot
Write a program that first reads an integer for the array size, then reads numbers intothe array, and finally outputs how many numbers have values that are greater than theaverage. For practice reasons, try not to use the index notation of arrays (e.g. myarray[i])at all. Use pointers instead.
I have a java program that is supposed to compare the sums of the columns of a 2D array and output the index of the column with the largest sum. I was able to find the column sums but I do not know how to compare the different sums and output the index of the largest sum. Here is the piece of code that finds the column sums: int [] colSum = new int [arr[0].length]; for (int k = 0; k < colSum.length; k++) { System.out.print(colSum[k]); ----> colSum[k] = the column sums How do I compare the integers in colSum[k] to find the largest sum and how do I output the index of the largest sum?
Suppose we expect the elements of the array a to be ordered so thata[0] ≤ a [1] ≤ a [2]≤ ...However, to be safe we want our program to test the array and issue a warningin case it turns out that some elements are out of order. The following code issupposed to output such a warning, but it contains a bug. What is the bug?double[] a = new double[10];<Some code to fill the array a goes here.>for (int index = 0; index < a.length; index++)if (a[index] > a[index + 1])System.out.println("Array elements " + index +" and " + (index + 1) + " are out of order.");
Write a program to enter 10 numbers using keyboard and put them in an array.Now generate another array of same size from the array created in the first stepby satisfying the following conditions: If the number is prime then write ‘P’ to the same location of the secondarray If the number is divisible by 5 then write ‘F’ If the number is divisible by 3 then write ‘T’ If number is an Even number and neither divisible by 3 or 5 then write‘E’ If number is an Odd number and a non-prime number write ‘N’
Write a program that randomly fills an array of integers andthen sorts it. The array size is entered by the user and the values are chosen at randomin {-1, 0, 1}. Analyze the time complexity of your program. Here is a sample run: Enter the size: 10 ↵Enter1 0 1 −1 0 1 −1 0 0 0−1 −1 0 0 0 0 0 1 1 1
Write a program to input a list of numbers in an array and then rearrange this array in such a waythat all the odd numbers appear in the beginning of the array and all the even numbers appear in theend of the array. E.g., if the input list is 1,4,2,7,6,5,9, then after rearrangement the list should be:1,7,5,9,4,2,6.
Write a Java program that creates an array of integers with length 5 and fills it with the number 1 through 5 then loop through the array and print out each element
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 in a class EvensOddsAvg that counts the integers that are below the average. Read 15 integers from the keyboard and place them in an array. Compute the sum and count of the evens and the odds separately. Find the average of the integers, and count and display the integers that are below average.