Need help with CS question The code segment below is to get the value of Ai][] for an integer array A[N][M] for some constant values N and M. Assume the address ofthe array is in %rdx, the row is in %rdi and the column is in %rsl.shl $4, rdilea ($rsi, &rdi, 4), $raxmov (Srdx, &rax,4), $eaxBased on the code above, what is the number of columns (the value of M) n array A?You may give your answer in hex (starting with Ox) or in decimal.

Lets discuss the solution in the next steps

The code segment below is to get the value of Ali) for an integer array A[N][M] for some constant values N and M. Assume the address of the array is in %rdx, the row is in %rdl and the column is in %rsi. shl $4, rdi lea ($rsi, &rdi, 4),rax mov ($rdx, rax, 4), teax Based on the code above, what is the number of columns (the value of M) in array A? You may give your answer in hex (starting with Ox) or in decimal.

The code segment below is to get the value of Ali) for an integer array A[N][M] for some constant values N and M. Assume the address of the array is in %rdx, the row is in %rdl and the column is in %rsi. shl $4, rdi lea ($rsi, &rdi, 4),rax mov ($rdx, rax, 4), teax Based on the code above, what is the number of columns (the value of M) in array A? You may give your answer in hex (starting with Ox) or in decimal.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 10RQ

See similar textbooks

Similar questions

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.
Write a procedure for encryption by rotating each plaintext byte different number of positions. For example, in the following array that represents the encryption key, each number indicates a left rotation: key BYTE 6, 4, 1, 2, 7, 5, 2, 4, 3, 6. Pass the pointer to the text string in EDX, the array size to ECX, a pointer to the key array in ESI, and the direction value (0 or 1) in EBX. Assume that the key array size is 10. Your procedure should loop through plain text and align the key to the first 10 bytes of the message. Rotate each plain text to the left (if the value in EBX is 0) or to the right (if the value in EBX is 1) by the amount in the key array: first byte by 6, second byte by 4 etc. Then align the key to the next 10 bytes until the whole message is encrypted. Write a program that tests the procedure by calling : one time with EBX = 0 (encrypting), then with EBX = 1 (decrypting). Print out the text three times: the original, then the encrypted, then the decrypted.
Suppose you have given a circular array of integers where start and size is given. You need to find the second largest even number and second smallest even number of the array. After that, replace the next index value of the second largest even value index with summation of the second largest even value and second smallest odd value, and previous index value of the second smallest even value index with the multiplication of the second largest odd and second smallest even value. Note: You must change the start and size accordingly. Assume that O represents empty spaces in the array. [You are not allowed to use any additional array/list or any built-in functions except lenO, range0].
Given are group of integers separated by space and a single integer, store the group of integers in an array, return the sorted array, reverse order of the array and number of occurrence of single integer in the sorted array. ex. input: group of integers = 5 6 8 3 5 7 2 4 1 4 7 9 5 single integer = 5 output: [1, 2, 3, 4, 4, 5, 5, 5, 6, 7, 7, 8, 9] [9, 8, 7, 7, 6, 5, 5, 5, 4, 4, 3, 2, 1] 3
Write program in C compatible with quincy please. Exercise 2: Write a program to store an input list of ten integers in an array; then display a table similar to the following, showing each data value and what percentage each value is of the total of all ten values. n % of total 4 2.00 12 6.00 18 9.00 25 12.00 24 12.00 30 15.00 28 14.00 22 11.00 23 11.00 10 5.00
Consider 2 integer arrays, x and y, each with size equal to 10.Initialize array x with random numbers between 1 and 100.Write code that fills array y with values such that each element of y is the corresponding valueof x multiplied by its index.
Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array
Write a MIPS program that defines a one-dimensional array of 10 integers in the static area of the data segment, asks the user to input all 10 array elements, computes, and displays their sum note: the array of 10 integers is not given, the user should input it
Given the following, write a line of code that will initialize p to point to the “7” inthe array).unsigned char x[] = {2, 3, 5, 7, 11, 13, 17};unsigned char *p, *q; If pointer q in the previous question points to some element of array x, whatexpression will return the index of the element pointed to? E.g., if q points to the 13in the above array, then your expression should return 5 In C Programming Please!
Following is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0, 6)"* 9, 15, 22, 38, 7, 8, 14 7, 8, 9, 14, 15, 22, 38 9, 8, 14, 7, 22, 15, 38 9, 8, 7, 14, 22, 15, 38 7, 9, 15, 22, 38, 14, 6 38, 22, 15, 14, 9, 8, 7
Write a code in C++ / cpp to solve the following problem Sasha has an array that contains each number between 1\dots n1…n exactly once. Sasha wants to pick these numbers from 11 to nn in increasing order. On each step, she goes through the array from left to right and picks as many numbers as possible. What will be the total number of steps? Input The first input line has an integer n: the array size. The second line has n integers x1,x2,…,xn: the numbers in the array. Constraints: 1 <= n <= 2*10^5 Output Print one integer: the number of steps. Sample 1 Input 54 2 1 5 3 Output 3
3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called using this array, it would return 0, asit is returning the index of the row, not the sum.Note that the number of columns is required when passing a 2d array to a function.Assume that 2D arrays passed to this function will have 6 columns.Title line: int findLargestIndex(int array[][6], int rows, int columns);