6 Suppose multidimensional arrays A and B are declared using A(-2:2, 2:22) and B(1:8,-5:5,-10:5) a. Find the length of each dimension and the number of elements in A and B b. Consider the element B[3,3,3] in B. Find the effective indices E, E, E, and the address of the element, assuming Base(B)=400 and there are w=4 words per memory location.

6 Suppose multidimensional arrays A and B are declared using A(-2:2, 2:22) and B(1:8,-5:5,-10:5) a. Find the length of each dimension and the number of elements in A and B b. Consider the element B[3,3,3] in B. Find the effective indices E, E, E, and the address of the element, assuming Base(B)=400 and there are w=4 words per memory location.

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

for (c = 0; e array(d]) position - d; if (position !- c) array[c]; swap = array[c) - array position] - swap; array(position];
Write a C program to read a one-dimensional array, print sum of all elements along with inputted array elements using Dynamic Memory Allocation. Hint: memory will be allocated in this program using malloc() and released using free().
Consider a two dimensional array X[-10...5, 7....15] in which staring location is at 250. If every data of given array takes 4 byte of space and store in column major order, then what will be the location of A[12][10]
An array T[-1.35][-2.15] is stored in the memory along the row with each element occupying 4 bytes. Find out the base address and address of element T[2O][5], if an element T[2][2] is stored at the memory location 300O. Find the total number of elements stored in T and number of bytes allocated to T.
Question 5 use c++ to Solve the following short programing tasks: Given a binary array, the task is to count the number of 1’s and 0’s in this array using STL Algorithms in C++.Given an array and an integer N, find elements which are divisible by N, using STL Algorithms in C++.Given a vector, reverse this vector using STL in C++ without using predefined functions/algorithms.Given two vectors, find common elements between these two vectors using STL in C+
3. Consider an 1-d array of type int and a pointer pointing variable pointing to the 2nd item of the array. Write down the code for the following: int arr(10) = (5,6,23,4,89,70,12,78,33); int *ptr = arr+1; (a) Print the first item of the array using ptr. (b) Print all prime numbers of the array using value at address. (c) Print the last item of the array using a pointer to an array. You are not allowed to initialize the pointer to the address of the last item. Iterate using a loop to change the value of the pointer. (d) Now print the array in reverse order using a pointer. 101
1. Asymptotics. Given an array A of n integers, you'd like to output a two-dimensional n x n array B in which B[i, j] = max {A[i], A[i + 1],..., A[j]} for each i < j. For i j the value of B[i, j] can be left as is. for i = 1,2, η for j = i + 1, n " Compute the maximum of the entries A[i], A[i + 1], , A[j]. Store the maximum value in B[i, j]. (a) Find a function of such that the running time of the algorithm is O(f(n)), and clearly explain why. (b) For the same function f argue that the running time of the algorithm is also (f(n)). (This establishes an asymptotically tight bound (f(n)).) (c) Design and analyze a faster algorithm for this problem. You should give an algorithm with running O(g(n)), where lim→∞ g(n)/f(n) = 0.
The ColumnChoice problem takes as input a two-dimensional array A[1..m, 1..n] of Os and 1s with m rows and n columns along with a non-negative integer k < n. It asks whether there exists a subset SC {1, ..., n} of k columns such that for each row i e {1,..., m} there exists at least one column j e S where A[i, j] = 1. Prove that ColumnChoice is NP- complete.
Study the scenario and complete the question(s) that follow: Two dimensional arraysA two-dimensional array is actually an array in which each element is a one-dimensional array. The length of an array x is the number of elements in the array, which can be obtained using length. x[0],x[1], . . . , and x[x.length − 1] are arrays. Their lengths can be obtained using x[0].length,x[1].length, . . . , and x[x.length − 1].length. Source: Liang D. (2018) Create a Java application that consists of two-dimensional array of 4 by 6. Assign the array to a matrix. Use any integer values for your matrix. Create three methods that will do the following: 3.1 Print out all the elements in the matrix. 3.2 Calculate the sum of each row of the matrix. 3.3 Calculate the largest number of each row of the matrix. 3.4 The main method must implement all three methods and output the results for each line.
Using Java Modify the program 1 to compute the multiplication of two vectors with the sizes mx1 and 1xn. The result is a matrix mxn computed as follows: the element on the position r and c in the product will be equal with m1[r][0]*m2[0][c].
- Can you provide me with the correct answer - The answer I inputted was 25,33,145,2 but it was shown as incorrect on my homework portal.
None