Suppose we have the following C function:long average (long a 0) { // finds the average (arithmetic mean of an array of 8 elementslong sum = 0;for (int i = 0;sum += a[i):i < 8;i++) (// loop through all elements}return sum/8; // find the average by dividing by the number of elements (8).}In the assembly implementation of the function below, fill in the three missing jump instructions so that it matches the code above:average:xorg trax, traxxorg trcx, trcx# sum = 0* i = 0label2labell:# sum = sum + a[i]# i = i+1addą (šrdi, trcx, 8), &raxincq trcxlabel2:cmpg $8, trcxlabellsalq $3, trax# sum = sum / 8retą

The assembly implementation of the function below for the following question.

Long average (long a [) { // finds the average (arithmetic mean of an array of 8 elements long sum = 0; for (int i = 0; // loop through all elements i < 8; i++) ( sum +- a[i); } return sum/8; // find the average by dividing by the number of elements (8). n the assembly implementation of the function below, fill in the three missing jump instructions so that it matches the code above: average: xorg frax, trax * sum = 0 xorg frcx, trcx label2 labell: addą (rdi, trcx, 8), rax incq trcx # sum = sum + a[i] # i = i+1 Label2: cmpg $8, trcx labell salq $3, trax * sum = sum / 8 retą

Long average (long a [) { // finds the average (arithmetic mean of an array of 8 elements long sum = 0; for (int i = 0; // loop through all elements i < 8; i++) ( sum +- a[i); } return sum/8; // find the average by dividing by the number of elements (8). n the assembly implementation of the function below, fill in the three missing jump instructions so that it matches the code above: average: xorg frax, trax * sum = 0 xorg frcx, trcx label2 labell: addą (rdi, trcx, 8), rax incq trcx # sum = sum + a[i] # i = i+1 Label2: cmpg $8, trcx labell salq $3, trax * sum = sum / 8 retą

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

An array with any number of elements is said to be repeating if any two or more of the elements are appearing in sequential an indexes after each other.Write a C++ function that accepts an integer array and returns 1 or “Repeating” if it is a repeating array, otherwise it returns 0 or “Not Repeating”. For Instance:2, 3, 5, 6, 7, 7, 7, 6, 8, 10 - Repeating2, 3, 4, 6, 4, 6, 4, 7, 8, 9 - Not repeating
A set of integers 0..MAX may be implemented using an array of boolean values. This particular implementation is called a bit-vector implementation of a Set. Since C doesn’t have the Boolean data type, then substitute TRUE with 1 and FALSE with 0, or define 1 and 0 as TRUE and FALSE, respectively.For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE. For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE.For example: if s = {3,4,6,8}, the array looks like this: Implement a programmer-defined data type called BitSet to represent a set as follows:typedef int BitSet[MAX];Implement the following functions:void initialize(BitSet s); - set all array elements to FALSEvoid add(int elem,BitSet s);- set the item indexed by elem to…
Write a function in C swapRows(): which takes two 4x4 array as an argument and swap the values of its even rows with odd rows . Expected input: 5 2 3 1 4 8 9 0 -1 3 8 -2 99 102 33 56 Expected Output: 4 8 9 0 5 2 3 1 99 102 33 56 -1 3 8 -2
) 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]); } }…
Implement a range function for a dynamic array which returns a new dynamic array that is a subset of the original. input parameters: array - (the array and any related parameters) start - index of the first elementend - index of the last elementInterval - An integer number specifying the incrementation of index This function returns a new dynamic array containing the elements from the start thru the end indices of the original array.All array indexing must be done using pointer arithmetic. For example, given the array: 49 96 99 47 76 29 22 16 30 22 If the start and end positions were 5 and 9 with step 2, return a new dynamic array: 29 16 22 Please use following main to test your function. int main(){int *p = new int[10]{49,96,99,47,76,29,22,16,30,22}; int *q = range(p,10,5,9,2);for(int i=0;i<3;i++) cout<<q[i]<<" "; // print 29 16 22 cout<<endl;delete [] q;q = range(p,10,1,8,3); for(int i=0;i<3;i++)cout<<q[i]<<" "; // print 96 76 16 cout<<endl;…
In C program A set of integers 0..MAX may be implemented using an array of boolean values. This particular implementation is called a bit-vector implementation of a Set. Since C doesn’t have the Boolean data type, then substitute TRUE with 1 and FALSE with 0, or define 1 and 0 as TRUE and FALSE, respectively. For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE. Implement a programmer-defined data type called BitSet to represent a set as follows: typedef int BitSet[MAX]; Implement the following functions: void initialize(BitSet s); - set all array elements to FALSE void add(int elem,BitSet s); - set the item indexed by elem to TRUE void display(BitSet s); - display the set on the screen using set notation, e.g. {3,4,5,6} - this means that you will print the index value if the content of that cell is TRUE void getUnion(BitSet result,BitSet s1,BitSet…
Write a c++ program to declare an array of odd number of elements. Split it into the middle and store the elements in two different arrays. e.g. Initial array: 22 58 19 87 15 72 9 1 37 After splitting: 22 58 19 87 15 72 9 1 37 As output, your code should print the original and the two split arrays, each element separated by the comma sign. Your code should be generic enough to also work for arrays with an even number of elements.
In C, implement the function that gets an array of ints and its length, and returns the maximum of the absolute values. int max_abs (const int* arr, int len); For example: On input [1, -3, 7, 4] the function should return 7. On input [2, -3, 2, -4] the function should return 4. On input [0, -3, 2] the function should return 3.
Write a program using c# to do the following: Initialize an array A with 10 elements. Initialize an array B with 7 elements. Divide each element of array A with each element of array B that is a[0]/b[0] , a[1]/b[1] etc. Implement the same to handle divide by zero error and index out of bound error.
Write a function in c programming language that gets an array of points ( function is defined as : typedef struct{ int x; Int y; } point; ) and sorts the array using qsort().Given two points a=(ax,ay) and b=(bx,by) we compare them as follows: 1) if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)1⁄2 is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: - Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] - Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation:(1,1) is first because 12+12=2 is the smallest(3,2)…
Write a function that gets a 2-d array of ints arr[height][width], and returns an array SUM of length height such that SUM[i] contains the sum of all values in the i’th row of the array. For example - On input {{ 1, 2, 3}, {4, 7, -2}, {9, 10, 11}, {1, 5, 4}}; the function returns { 6, 9, 30, 10} // returns array SUM with SUM[i] = sum in the i’th row int* sum_row(int height, int width, const int ar[height][width]); Test for the function: void test_q2() { intar[4][3] = {{1, 2, 3}, {4, 7,-2}, {9,10,12}, {1, 5, 4}}; int* m = sum_row(4,3, ar); intm0 = m[0]; intm1 = m[1]; intm2 = m[2]; intm3 = m[3]; free(m); // checking dynamic memory allocation if (m0==6 && m1==9 && m2==31 && m3==10) printf("Q2 ok\n"); else printf("Q2 ERROR\n"); }
write a c++ program Take an unsorted array from the user and value of n, find if there exists apair of elements in the array whose difference is n. example:Input: arr[] = {5, 20, 3, 2, 50, 80}, n = 78Output: Pair Found: (2, 80)