2- Generate a (5, 5) numpy array that consists of random values between 20 and 40 and answer the following: (Check this function np.random.random_integers ) a. What is the minimum value in each row b. What is the mean for each column c. Count the number of elements in the array whose values are greater than 30 d. Display the elements in the arrays that are less than 30 e. Add 5 to elements whose value is less than 30. f. Display the top 10 elements in the array

2- Generate a (5, 5) numpy array that consists of random values between 20 and 40 and answer the following: (Check this function np.random.random_integers ) a. What is the minimum value in each row b. What is the mean for each column c. Count the number of elements in the array whose values are greater than 30 d. Display the elements in the arrays that are less than 30 e. Add 5 to elements whose value is less than 30. f. Display the top 10 elements in the array

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

23. What are the values of the elements in the array numbers after the following code is executed? int[] numbers = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100}; for (int i =1, i < 10; 1++) { numbers[i] = numbers [i - 1]; }
Select true or false for the statements below. Explain your answers if you like to receive partial credit Select true or false for the statements below. Explain your answers if you like to receive partial credit Which of the following is true about searching elements in an unordered array? With the data is unsorted, search is O(n) because if the element you are looking for is not there, you have to check every element in the array If you start at the end of the array and traverse to index 0, search improves to O(log n) because you only have to look at half of the array If you get lucky with checking the first element and find it immediately, then the worst case performance of search improves to O(n^2) Which of the following is true about searching elements in an ordered array? You cannot use binary search on an ordered array so the performance is O(n) If there are no holes in the array and the elements are all next to each other, then the performance for search improves to…
- Create a 6 by 8 array of random integer numbers ranged from -35 to 70, - Find how many -ve numbers in the array? - Multiply the array by -5 - Find the location of maximum and the minimum number in the array - List the contents of the array in matlap
4. Given an array of ints, return the number of times that two 6's are next to each other in the array.int n[] = {2, 6, 71, 6, 6, 6, 34, 6, 6, 89}; C++
Complete this code to swap the first and last element of the given array. Do nothing if the array is empty.
Question1: Do the following lab by one dimensional array(not vector) define two lists of numbers (arrays) and ask the user to give the size of each, and then ask the user to fill the list(according to a size that he gave), then compare two arrays and determine whether they are equal? Note: two arrays are equal if all elements are equal.
write only the code required to multiply the number 8 to each array value in the array and print the results on the console Int[][] myArray = {{23, 54, -21}, {11, 35, 42}, {7, 18}}; //write your code here
Given these two arrays, char arrA[] = {'a', 'e', 'i', 'o', 'u'} and char arrB[] = {'T', 'A', 'B','L','E'}, merge these two arrays into a new array. Make sure that the contents of arrA is interspersed with contents of arrB.
C++ 1- Creating an array of 8 random integers /// 2- Copying the elements from the first array to another array that fulfills the following condition: The sum of the element to twice its position is less than the square of the difference between the element that follows it and the element that precedes it except for the first and last element They are copied automatically //// 3- Finds the largest even number in the first array and in what position it is found //// 4- Finds the two smallest odd numbers in the first array and in what position it is
Create an array of 3,4,5,2,6,3,7,3,8,9 elements and find the most occurring element in the array i.e., 3.
Question1: implement lab 3 by the two-dimensional array. ask the user to give you a number of rows and the number of columns. and then you define a two-dimensional array. then your program will print the multiplication table according to the numbers that the user gave. C++
16 السؤال sequential search: what is the best case to search if all the elements of an array are equal ? الاجابات to find two different items all the elements are equal all the elements are different to find the different items at the beginning