Q.3 Consider a two dimensional array A[1...10] [3...8] that is column index ranges from 3 to 8 and row index ranges from 1 to 10. Now suppose element are arranged in column major order. If Base address of A is 1000 then address of element A[5][7] will be . (Assume size of each element is 1) A 44 В 1044 C 64 D 1064

Q.3 Consider a two dimensional array A[1...10] [3...8] that is column index ranges from 3 to 8 and row index ranges from 1 to 10. Now suppose element are arranged in column major order. If Base address of A is 1000 then address of element A[5][7] will be . (Assume size of each element is 1) A 44 В 1044 C 64 D 1064

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

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.
a) Calculating the average value of array elements and assigning it to the variable avg,b) Write the code that implements the Selective Sorting algorithm in assembly language (emu 8086) with the option a, in the blank space below, explain the code.n = 10 (number of elements in array a)a [10] = {32, 16, 64, 128, 2, 8, 0, 4, 1, 3}
3.Consider a numpy 2-D array of the form [[50, 60, 70], [67, 88, 90], [60, 78, 97]]where the ith 1-D array contains the marks of the ith student in three subjects (inthis order. E.g. 50, 60, 70 are the subject1, subject2, subject3 marks respectivelyof student-0. Use numpy sum function only to i) create a 1-D numpy array withthe sum of the marks of individual students ii) create a 1-D numpy array with thesum of subject-wise marks. Also, do these operations to produce 2-D numpyarrays with the same content.Hint: use axis = 1, 0 etc4. Given two 1-D numpy arrays A and B, remove the elements in A which are alsoin B and store the resulting array in C. Use numpy set operations.5. Given two numpy 2-D arrays arr1 = np.array([[1, 2], [4, 5]]), arr2 = np.array([[3, 3],[1,1]]) explore the difference between np.multiply(arr1, arr2) and np.matmul(arr1,arr2
using VBA program and excel Suppose we have a matrix of numbers in cells C2:F5. Write a macro that - Reads the entries of the matrix into an array. - Flips this matrix diagonally along the NE-SW diagonal to create a new to form a new matrix. So if the original matrix was then the flipped array would be - Creates a 4 by 4 array with the entry in the row and column given by . - Writes to cells C8:F11, to cells H8:K11 and to cells M8:P11.
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
x86 assembly language Write a general-purpose program with loop and indexed addressing that adds 12h to 0th, 3rd , 7th , 11th ,15th ,19th , … elements of a DWORD array. For example, in array: Array1 DWORD 12h, 13h, 14h,15h, 16h, 17h, 18h, 19h, 1ah, 1bh, 1ch, 1dh, 1eh, 1fh becomes: Array1 : 24h, 13h, 14h, 27h,16h,17h,18h, 2bh, 1ah, 1bh, 1ch, 2f, 1eh, 1fh I did the following code buts it wrong. I need to do it without using no Lea, no HLT, and no RPT. How would I do that? .CODE LEA SI,ARRAY1MOV CX,4MOV AX,0ADD [SI],12HADD SI,0CHADD [SI],12H;repetition with indexed addressing modeRPT:ADD SI,10HADD [SI],12HLOOP RPTHLT
26. PLEASE TURN THIS SELECTION SORT FUNCTION INTO SIMPLE RISC-V CODE: (please do not explain the code, I understand the code) #include <stdio.h> void swap(int *xp, int *yp) { int temp = *xp; *xp = *yp; *yp = temp; } void selectionSort(int arr[], int n) { int i, j, 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 = i; for (j = i+1; j < n; j++) if (arr[j] < arr[min_idx]) min_idx = j; // Swap the found minimum element with the first element if(min_idx != i) swap(&arr[min_idx], &arr[i]); } } /* Function to print an array */ void printArray(int arr[], int size) { int i; for (i=0; i < size; i++) printf("%d ", arr[i]); printf("\n"); } // Driver program to test above functions int main() { int arr[] = {64, 25, 12, 22, 11}; int n = sizeof(arr)/sizeof(arr[0]); selectionSort(arr, n); printf("Sorted array: \n"); printArray(arr, n); return 0; }
write a c++ for the following. donot copy from other sites. Solve this question without using pointers. Take a Boolean 2D array of 10X10, where each row is sorted from the user, Find the row with the maximum number of 1s.Example:Input matrix0 1 1 10 0 1 11 1 1 1 // this row has maximum 1s0 0 0 0Output: 2
(C++) I need a quicksort algorithm implementation which returns the indices of the sorted array in an array without modifying the array itself:ie,Before sortingindex : 0 1 2 3 4 5values: 70 60 40 20 30 50After sortingindex : 3 4 2 5 1 0values: 70 60 40 20 30 50 function returns an array with indexes: [3 4 2 5 1 0]
Let's assume that we have an array with 6 members. The members are 10H,20,17H,77H,30H,77 in sequantial order.The offset address of the array is loaded into BX register.In sequencial order, MOV AL,[BX+3], MOV AH,23H , ADD AL,AH commands are executed. What are numbers in AL and AH registers? Select one: a. AL=100h, AH=33H b. AL=100, AH=23H c. AL=9AH, AH=23 d. AL=9AH, AH=23H e. AL=A9H, AH=23
MIPS Assembly Complete the fibonacci function that should compute the series of N (integer) elements of Fibonacci numbers (Links to an external site.) and put them into a global array, named "fib_array" (in the memory). (Note: You can assume "fib_array" will have enough space to place N elements.)>>> $a0 contains the N's value, which represents the number of elements of the Fibonacci number to be completed. Sample: Expected output:0, 1, 1, 2, 3
write your own MIPS program that allocates space for two integer arrays (P and Q) of size 9 each. You can use pointers or indices for traversing arrays. The program should do the following:a. Read in the value of N (a digit between 1 and 9, the actual working size of your array).b. Read in from the keyboard the first N values of the array P. Note that we want both arrays P and Q to haveidentical elements (see the example below for additional explanation).c. Output to the console the N values of both arrays P and Q (use any format and additional text you like).Textbook i use is "Computer Organization and Design 4th Edition by John L hennesyExample: let’s say that the digit read from the keyboard was 3. This means that N=3; them our program will initialise two arrays with elements P[0], P[1], P[2] and Q[0], Q[1], Q[2]. Elements of the arrays are to be read from the keyboard, let’s assume that they were: 25, 11 and 2. The arrays are to be initialised as following:Q[0]=25 Q[1]=11 Q[2]=…