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

Language: C++ Write a Program with Comments for your code to improve quick sort. The quick sort algorithm presented in the ClassNotes-Sorting, it selects the first element in the list as the pivot. Revise it by selecting the median among the first, middle, and last elements in the list.Explain your Outputs or Answers for the following: (C) Give a list of n items (for example, an array of 10 integers) representing the worst-case scenario. (D) Give a list of n items (for example, an array of 10 integers) representing the best-case scenario. Please compile your answers in a file including all source code with comments, Explain your running Outputs or Answers in (A) ~(D). Quicksort that was mentioned in the ClassNotes: #include <iostream>using namespace std; // Function prototypesvoid quickSort(int list[], int arraySize);void quickSort(int list[], int first, int last);int partition(int list[], int first, int last); void quickSort(int list[], int arraySize){quickSort(list, 0,…
Write a program to sort the element of I'd array is descending order and also implemented linear search on the same array both is storing and searching operation should be done inside one user defined function take so achieving the required functionality pass array into the function task from main using pass by reference oradress approach by c language
In C++, Can you please look at the code below and revise/fix so it will work according to instructions and criteria. Instruction 1) Write a function that copies a 1D array to a 2D array. The function’s prototype is bool copy1DTo2D(int d1[], int size, int d2[][NCOLS], int nrows); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant size = NCOLS * nrows the function returns true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and 2d array indices is 2d row index = 1d array index / NCOLS 2d column index = 1d array index modulus operator NCOLS 2) Write a function that copies a 2D array to a 1D array. The function’s prototype is bool copy2DTo1D(int d2[][NCOLS, int nrows, int d1[], int size); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant the function return true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and…
Modify the below program in c++ to give the correct output :- void array (int a[]) { cout <« sizeof (a) ; } Also write the driver function
code for this in C: Create an array of N items. Implement these using array initializers in the variable declaration. Print each item in the array list. At the end, print the sum of all nos. in the array and their average.
DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, include the following to your answer: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times
Please use C++ and make sure it's for a sorted array Write a function, removeAll, that takes three parameters: an array of integers,the number of elements in the array, and an integer (say, removeItem). Thefunction should find and delete all of the occurrences of removeItem in thearray. If the value does not exist or the array is empty, output an appropriatemessage. (Note that after deleting the element, the number of elements in thearray is reduced.) Assume that the array is sorted.
PART 1: ONE-DIMENSIONAL ARRAY Instruction: There are two lists of numbers. Create a resultant list whose elements are the product of the elements of the two lists. Example: List A 21 List B List C 630 500 30 50 10 Write a Java program using a one-dimensional array that accepts as input an integer value asking for the number of elements for each list. This will be used to generate random numbers (5 to 69) for the one-dimensional arrays (List A and List B). The program will compute for the product and store it in another array (List C). Display the result similar to the Example above. Sample Input/Output: Depicted below are sample outputs when the program is executed (the items in bold characters are input from the user, while the items in bold italic are generated, calculated and printed by the program): Input the number of elements: 3 List A List B List C 630 500 250 21 30 50 10 25 10 Input the number of elements: 5 List A List B List C 31 13 403 21 30 630 500 50 10 60 41 2460 25 10…
# //Write the assembly for the following loop # //Use indexed array access (no pointers) 15; const int AMAX # # # # . data A: int A[] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; for (int i=AMAX; i > 0; i--) { A[i-1] = A[i] * 2; } # DO NOT CHANGE THIS TEST DATA .word 1, 2, 3, 5, 6, 7, 4, 9, 10, 11, 12, 13, 14, 15 .word AMAX: . word 15 .text .globl main $t0, AMAX $s0, A #TODO: Write the loop code: A[i+1] = A[i] * 2 main: #highest index #&A[0] lw la loоp: exit: li $v0, 10 syscall
Create a NON-RECURSIVE version of this function, it stores any value less than or equal to k on the left side and the rest of the numbers on the right. ***INCLUDE TIME COMPLEXITY #include <iostream> // Use the standard namespace. using namespace std; // Define the function to rearrange the elements. void rearrange(int A[], int k, int start, int end) { // Return if the starting index is equal // to the last index. if (start == end) { return; } // Otherwise, do the following. else { // Swap the element at A[start] with the // element at A[end] if the value of A[start] // is greater than k. if (A[start] > k) { int temp = A[start]; A[start] = A[end]; A[end] = temp; // Decrement the value of end by 1 // and call the function recursively. rearrange(A, k, start, end - 1); } // Otherwise, increment the value of start // by 1 and…
Below is the recursive implementation of binary search from lab with one change (in red): the print statement at the top of the function which prints "BOO" There is also a main function which calls bsearchR on the sorted array data[] with 7 elements and searching for 10. QUESTION: How many BOOS will be printed by this program? // Recursive Binary Search Routine that does the "Real" Work int bsearchR(int a[], int lo, int hi, int x) { int m; printf("BO0\n"); // <<<<==== NEW STATEMENT if(hi < lo) return -1; m = (lo + hi) / 2; if(a[m] == x) return m; else if(x < a[m]) return bsearchR(a, lo, m-1, x); else return bsearchR(a, m+1, hi, x); } int main() { int data[] = {5, 8, 12, 15, 20, 25, 30}; int idx = bsearchR(data, e, 6, 10); return 0; }