1- Sum Perfects. (Program should call a function that fill array with 10 random mumbers and call a function that finds the sum of the perfect mumbers in the array) 2- Average of Primes: (Program should fill two dimensional array with 16 random mumbers, and call a function that find the average of primes in the array) 3- Return to the main menu. To Exit press d or D.

1- Sum Perfects. (Program should call a function that fill array with 10 random mumbers and call a function that finds the sum of the perfect mumbers in the array) 2- Average of Primes: (Program should fill two dimensional array with 16 random mumbers, and call a function that find the average of primes in the array) 3- Return to the main menu. To Exit press d or D.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 16PE

See similar textbooks

Similar questions

(Numerical) Given a one-dimensional array of integer numbers, write and test a function that displays the array elements in reverse order.
Exercise 1: //The max function the max between a and b, it returns a if a == //b public double max(double a, double b); //The mult function returns the result of a * b public double mult(double a, double b); //The exist in array function returns the index of the element //‘a’ if //‘a’ exist in array ‘arr’ otherwise returns ‘-1’ public int existsInArray(int [] arr, int a); //Are array equals method compares two arrays and returns true // if the elements of array ‘a’ are equal to elements of array // ‘b’, element by element. If equals it returns 0, it returns - // 1 if not public int areArrayEquals(int [] a, int [] b); Devise four executable test cases for every method in the JUnit notation. See the attached handout for a refresher on the notation.
//convert array of numbers from farenheit to celcius// example:// argument: [23, 32, 41, 50, 59]// return: [-5, 0, 5, 10, 15]// hint: use Array.mapfunction toCelcius(array){ } //write a function that takes an input array and returns an array of booleans (>=75) or fail (<75)// example:// argument: [20, 30, 50, 80, 90, 100]// return: [false, false, false, true, true, true]// hint: use Array.mapfunction passOrFail(array){ }
Task 1: Find the longest word Implement the function findLongestWord that takes as an argument an array of words and returns the longest one. If there are 2 with the same length, it should return the first occurrence. Write the JS code in a separate file. You can use the following array to test your solution: var words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpott'];
5. Write a function which will find the average of all elements of an array of integers. Pass an array and a dimension (the number of elements), and return the value of the average as a float ( the return value). Test this function in the main program with the array: 5, 7, 3, 5, 6, 4.
3x3 2d array filled with random numbers from 0-9 without repetitions using functions and pointers let the user choose from 5 options.1-fill the array with random numbers.2-print the array.3-print the largest number in the array.4-print the diagonal line from the array.5-type "." to exit the program.
String [] plants = newstring [] {“onions”, “carrots”, “peas”, “tomatoes”, “bananas”, “lemons”}; Using the array above , write code that 1. Prints the elements of the array in the order they appear in the array using a lambda function 2. Prints the elements of the array in descending order using a Linq function 3. Prints the elements of the array in ascending order using a linq fucntion 4. Prints the elements of the array that contain “ba” using a linq function
1. declare an array to hold 12 floating point numbers: 2. Now that we have our array, set all 12 numbers to -100. 3. Change all even positions (all lines with an even index: 0,2,4, etc) to 96.8Use a function call to print the array.
It's important to note that the name of an array by itself is really a pointer to the first element of the array. Therefore passing an array to function is simple since you can just specify the name of the array. Are these statements true?
1.Write the code to take an array (int stuff[100]) and initialize each element of stuff to -1. 2.Write the code to take an array (int stuff[100]) and initialize each element with user input a.Update the program to sum the values in the array. b.Update the program to print all elements of the array in reverse order. c.Update the program to search through the array and find the smallest value in the array. d.Update the program to search through the array for the value 6, and print “found it”, if it exists. #####java only#####
C++ Lexicographical Sorting Given a file of unsorted words with mixed case: read the entries in the file and sort those words lexicographically. The program should then prompt the user for an index, and display the word at that index. Since you must store the entire list in an array, you will need to know the length. The "List of 1000 Mixed Case Words" contains 1000 words. You are guaranteed that the words in the array are unique, so you don't have to worry about the order of, say, "bat" and "Bat." For example, if the array contains ten words and the contents are cat Rat bat Mat SAT Vat Hat pat TAT eat after sorting, the word at index 6 is Rat You are encouraged to use this data to test your program.
Help on the following question? Code Review Section Your co-worker has developed a function to find the median value in an unsorted array with an odd number of elements. For arrays with an even number of elements, this function does not apply. To normally find such a value would be to sort the array and then obtain the value at the middle index of the array. For example, [5 2 53 1 4], the median is 4 because when it is sorted, the array will be [1 2 4 5 53] and the value at the middle index is 4. Your co-worker’s function uses the partition function that is the same function as the one the QuickSort algorithm uses. Here’s the code he shows you: public static int[] array = {6, 1, 20, 10, 4}; public static int findMedian(int lo, int hi, int medianIndex) { int partitionIndex = partition(lo, hi); if (medianIndex == partitionIndex) return partitionIndex; if (medianIndex > partitionIndex) return findMedian(partitionIndex + 1, hi,…