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)

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 1PP: (Statistics) a. Write a C++ program that reads a list of double-precision grades from the keyboard...

See similar textbooks

Similar questions

(Electrical eng.) a. An engineer has constructed a two-dimensional array of real numbers with three rows and five columns. This array currently contains test voltages of an amplifier. Write a C++ program that interactively inputs 15 array values, and then determines the total number of voltages in these ranges: less than 60, greater than or equal to 60 and less than 70, greater than or equal to 70 and less than 80, greater than or equal to 80 and less than 90, and greater than or equal to 90. b. Entering 15 voltages each time the program written for Exercise 7a runs is cumbersome. What method could be used for initializing the array during the testing phase? c. How might the program you wrote for Exercise 7a be modified to include the case of no voltage being present? That is, what voltage could be used to indicate an invalid voltage, and how would your program have to be modified to exclude counting such a voltage?
(Numerical) Given a one-dimensional array of integer numbers, write and test a function that displays the array elements in reverse order.
4. Write a program to find kth smallest element in unsorted array?You are given an unsorted array of numbers and k, you need to find the kth smallest number in the array. Forexample if given array is {1, 2, 3, 9, 4} and k=2 then you need to find the 2nd smallest number in the array,which is 2.
Task using C language Write a program that checks both of the following conditions hold for a given array a1, a2, …, an. If the conditions hold, display “yes”, otherwise, display “no”. a1 < a2 < … < an For every i from 2 to n, ai isn’t divisible by ai-1. Requirements Follow the format of the examples below. The program reads in the number of elements of the array, for example, 4, then read in the numbers in the array, for example, 3 6 8 9. In the main function, declare the input array after reading in the number of elements of the array, then read in the elements. Examples (your program must follow this format precisely) Example #1 Enter the length of the input array: 7Enter the array elements: 2 5 4 1 6 9 12Output: no Example #2 Enter the length of the input array: 6Enter the array elements: 2 7 13 19 23 43Output: yes
3. Write a program to find intersection of two sorted array.For example, if the two sorted arrays as input are {21, 34, 41, 22, 35} and {61, 34, 45, 21, 11}, it should returnan intersection array with numbers {34, 21}. For the sake of this Problem, you can assume that numbers ineach integer array are unique.
A minimax or saddle point in a two-dimensional array is an element that is the minimum of its row and the maximum of its column, or vice verse. For example, in the following array11 22 33 33 99 55 66 77 77 44 99 22the element 33 is a minimax because it is the maximum of row 0 and the minimum of column 2. The element 55 is another minimax because it is the minimum of row 1 and the maximum of column 1.Write a program that reads a 4-by-3 matrix, and then prints the location and value of each minimax in the matrix. For example, it would printa[0][2] = 33 is a minimax a[1][1] = 55 is a minimaxfor the matrix shown above.