Language: JavaScript (Node.js) • Autocomplete Ready & 1 > 'use strict';... 5. Use array.map to double each 26 27 /* number 28 * Complete the 'double' function below. 29 Use array.map to complete the double function. The function is expected to double each number in an array. * The function is expected to return an INTEGER_ARRAY. * The function accepts INTEGER_ARRAY arr as parameter. 30 31 32 */ 33 34 function double(arr) { 35 36 } 37 38 > function main() {... :::::::

Language: JavaScript (Node.js) • Autocomplete Ready & 1 > 'use strict';... 5. Use array.map to double each 26 27 /* number 28 * Complete the 'double' function below. 29 Use array.map to complete the double function. The function is expected to double each number in an array. * The function is expected to return an INTEGER_ARRAY. * The function accepts INTEGER_ARRAY arr as parameter. 30 31 32 */ 33 34 function double(arr) { 35 36 } 37 38 > function main() {... :::::::

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

Create two dynamic arrays A and B with random numbers.a) Merge B in array A calling a function by reference.b) Delete the Prime numbers from the merged array A calling a function by pointer.c) Print the Array A in ascending order.You have to use only two Arrays A and B throughout the code. Be carefulabout memory leakage.Example:A= [20, 30, 5, 7, 19]B= [19, 10, 15, 11, 17, 25] a) After merging B in A, the merged Array A will look like-A= [20, 30, 5, 7, 19, 19, 10, 15, 11, 17, 25] b) After deleting prime numbers the merged Array would look like-A= [20, 30, 10, 15, 25] c) Finally print the merged array in ascending orderA= [10, 15, 20, 30, 25] In C++ Please
2) Complete the below code by making the reuse of the existing functionality. Find the index of the equilibrium element in the given array. In an array equilibrium element is the one where the sum of all the elements to the left side is equal to the sum of all the elements on the right side. Return Value: 1) Return -1 if no equilibrium element is found 2) In case there is more than one equilibrium element, return the element with the least index value. You are supposed to complete the given code by reusing the existing function. You can click on Compile & run anytime to check the compilation/execution status of the program you can use printf to debug your code. The submitted code should be logically/syntactically correct and pass all the test cases. Code approach For the question: Correct the given implementation. Do not modify the approach. Test Case: a[] = {1,2,3,4,3,3}. 4 is the equilibrium element since its left side sum (1+2+3) is equal to its right side sum…
3) A function is implemented with a feature to print a line when x is found in the array A. def better_linear_search(A, x): for i in range(len(A)): if A[i] == x: print(x,"found at",i) return i return -1 What is the output after running code below? better_linear_search([17, 2, 10, 3], 10) better_linear_search([0, 9, 9, 9], 18) better_linear_search([12, 8, 7, 8], 8).
Analysis. (-) 1. Consider the below Array: M1array [4] = {3,5,7,9} Pass the whole array into a M1avg function, explain your answer? (-) Answer: 2. Array1[2] = {15,35}; Array2[2] = {42,54}; Write a C program to swap elements between Array1 and Array2? Explain your answer (-) Answer: 3. Analyze the below code and correct the error? Explain your answer #include <stdio.h> int main(void) { int Array1 [4] = {2,5,8,11}; printf("%d",Array1 [4]); return 0; } -) 4. Array1[2] = {5,10}; Write a C program to add 5 for each element in Array1? Explain your answer (-) Answer: 5. Consider the below Array: M1array [4] =…
Java Program. Write a function that returns the index of the smallest element in an array of doubles. If there are more such elements than one, return the last index is fine. Using the following header: int IndexOfSmallestArray(double array[], int size) Finish the function implement only.
Talk about the difference of accessing elements in an array VS access the memory address of an array What will happen with the following code: 1: cout << array<<endl; 2: cout << array[0] << endl; Does C++ support Index Out of bound Checking? If so, please explain how that works, if not, explain what will happen if Index Out of bound happens.
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.
This exercise give you practice working with a two-dimensional array. the Example 7.14 on two-dimensional arrays, recall that I loaded the array using an Initializer list. Modify Example 7.14. Instead of using an initializer list to load the array, create 2 functions: loadArray – function “loadArray“ will have 1 parameter which will be the grade array. The function will allow the user to enter 12 quiz grades (3 for each student), store each quiz grade in the appropriate element of the grade array, and return an int representing the number of quizzes entered (12). “loadArray” will use nested loops to prompt the user to enter the 12 grades. It will count each grade entered and return the number of quizzes entered. loadFromFile – function “loadFromFile” will have 1 parameter which will be the grade array. The function will return an int representing the number of quizzes read(12). “loadFromFile” will use nested loops to read the values from the file and store each quiz grade in the…
5. Using c++, Write a function that determines the index of the second to the last occurrence of a target b in an integer array a. Return -1 if b is not in a or there is only 1 occurrence of b in a.
2. Write a program which sorts the CGPA array having cgpa of all students in ascending order by using bubble sort and make use of pointers for each and every variable and constant and array.
Rewrite the Binary search function in the textbook to use a generic type for the array elements. Test the function with arrays of int, double, and string values. *When using test arrays make sure elements are stored in ascending sorted order*
Write a lambda expression to count odd numbers in the following array, using a seed value of 0. Display your result on Console. int[] array = { 8,2,2,24,5,7,5,3,2,10};