embly program to do the following: a) Given an array Y with 8 intergers. i.e., Y= [ Y0,Y1,Y2,Y3,Y4,Y5,Y6,Y7] Swap each pair of the array elements, Y[2i] and Y[2i + 1] if Y[2i] > YY[2i + 1] for all i = 0.3 b) Square each element and then the result is multiplied by an immediate constant X. Assume Y0>Y1>Y2>Y3>Y4>Y5>Y6>Y7, the array Y should be modified as: Y= [ Y12(x)Y02(x)Y32(x)Y22(x)Y52(x)Y

embly program to do the following: a) Given an array Y with 8 intergers. i.e., Y= [ Y0,Y1,Y2,Y3,Y4,Y5,Y6,Y7] Swap each pair of the array elements, Y[2i] and Y[2i + 1] if Y[2i] > YY[2i + 1] for all i = 0.3 b) Square each element and then the result is multiplied by an immediate constant X. Assume Y0>Y1>Y2>Y3>Y4>Y5>Y6>Y7, the array Y should be modified as: Y= [ Y12(x)Y02(x)Y32(x)Y22(x)Y52(x)Y

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.3: Declaring And Processing Two-dimensional Arrays

Problem 3E: (Practice) a. Write a C++ program that adds the values of all elements in the val array used in...

See similar textbooks

Similar questions

Write it's python3 code and CPP code for the problem as stated below : Sort an array of 0s, 1s and 2s Given an array of size N containing only 0s, 1s, and 2s; sort the array in ascending order. Example 1: Input: N = 5 arr[]= {0 2 1 2 0} Output: 0 0 1 2 2 Explanation: 0s 1s and 2s are segregated into ascending order.
Write it's python3 code and CPP code for the problem as stated below : Sort an array of 0s, 1s and 2s Given an array of size N containing only 0s, 1s, and 2s; sort the array in ascending order. Example 1: Input: N = 5 arr[]= {0 2 1 2 0} Output: 0 0 1 2 2 Explanation: 0s 1s and 2s are segregated into ascending order. Example 2: Input: N = 3 arr[] = {0 1 0} Output: 0 0 1 Explanation: 0s 1s and 2s are segregated into ascending order. Your Task: You don't need to read input or print anything. Your task is to complete the function sort012() that takes an array arr and N as input parameters and sorts the array in-place. Expected Time Complexity: O(N) Expected Auxiliary Space: O(1) Constraints: 1 <= N <= 10^6 0 <= A[i] <= 2
Please translate this C++ code in MIPS assembly language Translate the following C++ program into MIPS assembly language. Note that the array initializations have been provided. Make sure your loops are efficient (i.e., they should not have unnecessary branches). Allocate i to $s0, j to $s1, sum to $s2. You may use any other MIPS registers. int x[] = {9, -1, 2, 13, 79, 4, -87, 3}; int main() { int j = 0; int sum = 0; for (int i=0; i<8; i++) { if (x[i] < 0) { sum = sum + x[i]; j--; } x[j] = sum; j++; } }
1.Given an array arr[] and an integer K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct. Note :- l and r denotes the starting and ending index of the array. Example 1: Input: N = 6 arr[] = 7 10 4 3 20 15 K = 3 Output : 7.
2. C++ Take an array of 10 elements. Split it into middle and store the elements in two dfferent arrays. E.g.- INITIAL array: 58 24 13 15 63 9 1 78 8 81 After spliting: 13 15 58 63 8 24 81 1 78
) Consider the following C code snippet. void swap(int *xp, int *yp) { int temp = *xp; *xp = *yp; *yp = temp; } int findMinimum(int arr[], int N) { // variable to store the index of minimum element int min_idx = 0; int min_E = arr[min_idx]; // Traverse the given array for (int i = 1; i < N; i++) { // If current element is smaller than min_idx then update it if (arr[i] < min_E) { min_idx = i; min_E = arr[min_idx]; } } return min_idx; } /* Function to sort an array using selection sort*/ void selectionSort(int arr[], int n) { int i, min_idx; // One by one move boundary of unsorted subarray for (i = 0; i < n-1; i++) { // Find the minimum element in unsorted array min_idx = findMinimum(&arr[i], n-i); // Swap the found minimum element with the first element if(min_idx != 0) swap(&arr[min_idx+i], &arr[i]); } }…
Develop python program of function randomArray(m, n) that takes two integers as argument and returns a 2D m-by-n array with random elements in it. Develop python program of function adder(a1, a2) that reads two 2D arrays of the same size and returns an array that is the summation of a1 and a2. To add the two arrays, you need to add their elements, correspondingly. Develop a python program of function inverseArray(a) that takes a 2D-array as argument and inverses the array. You will need to inverse the rows, first and then inverse the columns, next. For instance, if the array = [[2, 3, 4], [5, 6, 7]], the inverse will be = [[7, 6, 5], [4, 3, 2]]
In C++ Language: Write a function SummOdd that will find the sum of all elements of add order a1+ a3+... of a given array. Pass an array arr[] and a dimension n and return the value of the sum a1+ a3+... as the function's return value. Call this function in the main() with arr[] = { 8,6,4,2,3,5} and dimension n=6 to test the correctness of your general function. Keywords: Write function, pass array and dimension, return sum of odd order
Program the following in C language. Prompt the values from user for a single dimensional integer array of length 5 and accept them in First In First Out Consider a one dimensional character array of length 5 and holding data a, e, i, o and u. Sort them in ascending Randomly place values in a 2 dimensional integer array. Prompt values from user for a one dimensional integer array of length 10 in FILO order. Arrange this array in ascending and descending order in other 2 arrays.
Reference the image below.(a) Write a code in python to implement Hoare's algorithm.(b) Using LArray = {36, 12, 39, 34, 89, 2, 47, 95, 17, 19, 78, 22} as input, display the finaloutput and the array LArray after it has been manipulated by the algorithm.(c) Modify the algorithm to display the LArray after each swap done, being sure to indicatewhat swap is being observed.
JAVA Problem Create a function that determines whether elements in an array can be re-arranged to form a consecutive list of numbers where each number appears exactly once. Examples cons([5, 1, 4, 3, 2]) → true // Can be re-arranged to form [1, 2, 3, 4, 5] cons([5, 1, 4, 3, 2, 8]) → false cons([5, 6, 7, 8, 9, 9]) → false //9 appears twice
Wasit University Collage of Engineering Electrical Department 2020-2021 Subject: Computer Programing I Class: First Class Time: 90 min Note: Solve these questions by using C++ program or C+ application on your cellphones Q1/Write C++ program, to find the summation of even numbers in 2D-array. Q2/ Write C++ program, to read A[ n, n ] of numbers, then put 5 instead each odd positive number.