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 arra

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 arra

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

Write a program that generates 200 random integers between0 and 9 and displays the count for each number. (Hint: Use an array of ten integers,say counts, to store the counts for the number of 0s, 1s, . . . , 9s.)
The Sieve of Eratosthenes is an algorithm that finds all prime numbers up to a given limit, n. It works by creating an array of Booleans, flag, of size n+1, initializing the array to true (assuming every number is a prime number in the beginning), and iteratively traversing the numbers from 2 to n, setting the values of indices that are multiples of other numbers to false. Write a program using the algorithm above, and display all the prime numbers up to 50.
Write a program that reads 10 numbers, finds the largest number, prints it, finds the smallest number, and prints it.Without using arrays
Write a program that declares an array of 15 integers and reads the values from the user. Make sure that the user doesn’t enter a value greater than 10 (if the user enters a value not in the allowed range, discard that value and read another to put into the array). Now tell the number that occur maximum number of times in the array. For example for the following 7 has maximum occurrence. 4,7,3,3,2,7,1,5,7,9,9,9,7,8,10 Use both linear and binary search.
Write a program that creates an array of integers sine 10. And do the following- a) Ask the user to enter 10 numbers (all > O) one by one and store them in the array. If user enters a number «0 then program should ask user to enter the number again with a message that "Pl enter a number >0" b) Print the smallest number c) Print the largest number d) Print the average
Write a program that declares an array of size 10.Read 10 integer from user and store them in the array then prints them out in reverse order.
Write a program using Java programming language that reads an array of numbers and: Program writes all even numbers! Program writes the number of all negative numbers! Program writes the product of all numbers on odd indexes in the array!
You have an integer array A of size N. Find the closest pair of numbers in an array and print their difference.Input: 1 5 10 4 2 7 8 Output: 1
An array of short numbers [] is given, and integers are written in the array. Your task is to replace each element in this array by dividing it by 3. You do not know the size of the array.
This is an array given below :[0, 1, 1, 0, 1, 2, 1, 2, 0, 0, 0, 1]Write a Java Program that re-arranges this given array exactly as shownbelow:0 0 0 0 0 1 1 1 1 1 2 2.You are not allowed to use an extra array to solve the problem :)
Write a method that sums all the numbers that are prime from a given array of int values using the following header: public static long sumPrimeElements(int[] m) Write a test program that reads an array of n elements and displays the sum of all its prime elements.
Write a java program that: • Reads 10 integer numbers and store them in an array of size 10. • Find and display how many numbers in the array divisible by 2. • Print those numbers on the screen. • Find and display the average of all odd numbers in the array. Sample Input/Output: Enter 10 numbers: 1 2 4 2 5 7 30 11 3 21 There are 4 numbers divisible by 2. Those are : 2 4 2 30 The average of odd numbers in the list is 8