Problem 2 - Computing prefect numbersA positive integer is called a perfect number if it is equal to the sum of all of its positivedivisors, excluding itself. For example, 6 is the first perfect number because 6 = 3 +2 + 1.(The same applies for 28 1+2 + 4+7+14).Write a program that creates an array of N integers (N = 3000) and fills it with randomnumbers between 1 and 200. The program has to count the number of perfect numbers inthis array. To do that in less time, it breaks down the job between three threads:1. threadLow: counts perfect numbers in the first part of the array. (From 0 up to1000)2. threadMiddle: counts perfect numbers in the second part of the array. (From 1000up to 2000)3. threadHigh: counts perfect numbers in the third part of the array. (From 2000 up to3000)The parent (main) thread waits for them to finish, calculates the sum of the three values,and prints it. Note that the three threads have similar jobs to perform with somedifferences regarding the range of search in the array.

ger is called a perfect number if it is equal to the sum of all positi divisors, excluding itself. For example, 6 is the first perfect number because (The same applies for 28 1+2 + 4+7+14). Write a program that creates an array of N integers (N3000) and fills numbers between 1 and 200. The program has to count the number of perfe array. To do that in less time, it breaks down the job between three thre 1. threadLow: counts perfect numbers in the first part of the array. Sitive this 1000) 2. threadMiddle: counts perfect numbers in the second part of the array up to 2000) 3. threadHigh: counts perfect numbers in the third part of the array. (Frc 3000)

ger is called a perfect number if it is equal to the sum of all positi divisors, excluding itself. For example, 6 is the first perfect number because (The same applies for 28 1+2 + 4+7+14). Write a program that creates an array of N integers (N3000) and fills numbers between 1 and 200. The program has to count the number of perfe array. To do that in less time, it breaks down the job between three thre 1. threadLow: counts perfect numbers in the first part of the array. Sitive this 1000) 2. threadMiddle: counts perfect numbers in the second part of the array up to 2000) 3. threadHigh: counts perfect numbers in the third part of the array. (Frc 3000)

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

Using methods and arrays, write a program that Creates and fills an array A of size 50 filled with random integers in the range 5 to 50 inclusive. prints it out in 5 lines (10 values per line). • Calculates the sum of the odd elements of A and print it out.
Write a hangman game that randomly generates a word andprompts the user to guess one letter at a time, as presented in the sample run.Each letter in the word is displayed as an asterisk. When the user makes a correctguess, the actual letter is then displayed. When the user finishes a word, displaythe number of misses and ask the user whether to continue to play with anotherword. Declare an array to store words, as follows:// Add any words you wish in this arrayString[] words = {"write", "that",...}; (Guess) Enter a letter in word ******* > p↵Enter(Guess) Enter a letter in word p****** > r↵Enter(Guess) Enter a letter in word pr**r** > p↵Enterp is already in the word(Guess) Enter a letter in word pr**r** > o↵Enter(Guess) Enter a letter in word pro*r** > g↵Enter(Guess) Enter a letter in word progr** > n↵Entern is not in the word(Guess) Enter a letter in word progr** > m↵Enter(Guess) Enter a letter in word progr*m > a↵EnterThe word is program. You missed 1 timeDo…
Complete the method endsInFive that takes as arguments a 2D-array of integers and an integer value that represents a column index in the array. endsInFive returns the number of values in the column that end in 5. It is possible that the array is ragged, meaning that the number of columns in each row is different. For example, 2 is returned if the following 2D-array is passed as the first argument of endsInFive and the integer 3 as the second argument (the values 25 and 115 end in five at column index 3).
Java Program to Print Elements Which Occur Odd Number of Times. Given an array of integers, print all the elements whose frequency are odd. Example: Array = [5, 4, 4, 2, 1] Output: 5 2 1.
Below is a bubble sort program that sorts the elements in an array. static void bubbleSort(int] arr) { arr.length; int temp = 0; for (int i = 0; i arrlil) { int n = temp arrlj- 1 arrlj - 1] = arrlil: arrli] = temp; Based on the program above, please draw a control flow graph for it. In your control flow graph, what are the test requirements for edge coverage List test path(s) that achieves the edge coverage. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. In your control flow graph, what are the test requirements for edge-pair coverage? List test paths that achieve the edge-pair coverage Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason.
Write a program to: fill array by 10 integers Find the second maximum Print the array Print the elements greater than the average Print only numbers that are positive using array in java
A positive integer is called a perfect number if it is equal to the sum of all of its positive divisors, excluding itself. For example, 6 is the first perfect number because 6 = 3 + 2 + 1. (The same applies for 281+2+4+7+ 14). Write a program that creates an array of N integers (N = 3000) and fills it with random numbers between 1 and 200. The program has to count the number of perfect numbers in this array. To do that in less time, it breaks down the job between three threads: 1. threadLow: counts perfect numbers in the first part of the array. (From 0 up to 1000) 2. threadMiddle: counts perfect numbers in the second part of the array. (From 1000 up to 2000) 3. threadHigh: counts perfect numbers in the third part of the array. (From 2000 up to 3000) The parent (main) thread waits for them to finish, calculates the sum of the three values, and prints it. Note that the three threads have similar jobs to perform with some differences regarding the range of search in the array.
Write a program that finds the two smallest numbers in an array of n numbers.
Using methods and arrays , write a program that Creates and fills an array A of size 50 filled with random integers in the range 5 to 50 inclusive . prints it out in 5 lines ( 10 values per line ) . • Calculates the sum of the odd elements of A and print it out .
Write a program that simulates a lottery. The program should have an array of five integers named winningDigits, with a randomly generated number in the range of 0 through 9 for each element in the array. The program should ask the user to enter five digits and should store them in a second integer array named player. The program must compare the corresponding elements in the two arrays and count how many digits match. For example, the following shows the winningDigits array and the Player array with sample numbers stored in each. There are two matching digits, elements 2 and 4. WinningDigits 7 4 9 1 3 player 4 2 9 7 3 Once the user has entered a set of numbers, the program should display the winning digits and the player’s digits and tell how many digits matched. Working program Complete indentation, proper use of variables Comments on your program
?? Reduction code.
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 %.