Suppose we have two 2-dimensional arrays a and b, and consider the following C code. int a[4][4]; int b[4][4]; for (int i = 0; i < 4; i++) for (int j = e; j < 4; j++) { a[i][j] = 0; b[j][i] = 1; Assume that array a starts at address 0 and array b starts at address 64; the size of int is 4 bytes; the cache is 32 bytes and direct-mapped with a block size of 16 bytes; the cache is initially empty; accesses to the a and b arrays are the only sources of misses. (a) Out of 16 accesses to array a, how many are cache misses? (b) Out of 16 accesses to array b, how many are cache misses?

Suppose we have two 2-dimensional arrays a and b, and consider the following C code. int a[4][4]; int b[4][4]; for (int i = 0; i < 4; i++) for (int j = e; j < 4; j++) { a[i][j] = 0; b[j][i] = 1; Assume that array a starts at address 0 and array b starts at address 64; the size of int is 4 bytes; the cache is 32 bytes and direct-mapped with a block size of 16 bytes; the cache is initially empty; accesses to the a and b arrays are the only sources of misses. (a) Out of 16 accesses to array a, how many are cache misses? (b) Out of 16 accesses to array b, how many are cache misses?

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

Python Coding Exercise: Write a function that takes three parameters: a 2-D array arr, a row location i, a column location j and returns a float representing the fraction of neighbors around arr [i,j] # write your function here:def find_frac(arr,i,j):
Print the elements of the array ‘a’ using the mentioned notations: int a[]={1,2,3,4,5}; int *p; p = a; for (int i = 0; i< 5; i++) { //Subscript notation with name of array //Subscript notation with pointer 'p' //Offset notation using array name //Offset notation using pointer 'p' }
For these three arrays: int A[4][3] = {4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48} and int B[4][3] = {5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38} Perform the following operation on A and B: int C[4][3] = A[4][3] + 2*B[4][3]. Then the value in C[3][2] is: _______
C Program Dynamic Arrays Write a program that accepts an array of size N as an input. Create an array that has N number of prime numbers using calloc. Start from the lowest prime number. Print the elements inside a pair of square brackets [ ] where each elements are separated by a comma and a space. Input 1. One line containing an integer for the total number of inputs N. Output Enter size N: 3 [2, 3, 5]
Java Objective:Design and implement simple matrix manipulation techniques.Details:Your java program should use 2D arrays to implement simple matrix operations.Your program should do the following:• Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order• Print M1 to the console; make sure you format as a matirx• Repeat the previous steps for a second matrix M2• Create a matrix M3 that is the transpose of M1 and print it to the console• Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message.• Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements:• Use a helper method for reading a positive integer using an input validation loop.• Use a helper method for printing…
please solve it in C language Use one-dimensional arrays to solve the following problem. Read in two sets of numbers, each having 10 numbers. After reading all values, display all the unique elements in the collection of both sets of numbers. Use the smallest possible array to solve this problem.
Practice with Two-Dimensional arrays Type in the following program: //Tic-Tac-Toe #include using namespace std; int main() { char ttt[3][3]; //initialize the board for (int row = A;row < 3; row++) for (int col = 0; col < 3; col++) ttt[row][col] = '?'; return 0; } | 1. Add code to declare a new 4x3 matrix. 2. Add code to input values for the matrix. 3. Add code to print the matrix. 4. Submit the final program and sample output.
C program Create random array with user-defined size Write the CreateNewArray() function, which creates an array of any size and randomly fills it with integers in the interval [min, max). Function inputs: the size of the array (int), a seed value for the random number generator (int), and the values min and max defining the interval [min, max) (both ints). Function outputs: a pointer to the newly created array of integers. main() is mostly written for you. It reads in all inputs from the user, calls CreateNewArray(), and prints the array's entries. However, you will need to add a statement at the end of main() to free the memory that you allocated in CreateNewArray(). Reminder: If you dynamically allocate any memory, you MUST free that memory before the end of your program. Note: Inside CreateNewArray(), use srand() to seed the random number generator and rand() to generate random integers in the interval [0, RAND_MAX]. Both functions are accessible in stdlib.h.
Java Program - Functions with 2D Arrays Write a function named displayElements that takes a two-dimensional array, the size of its rows and columns, then prints every element of a two-dimensional array. Separate every row by a new line and every column by a space. In the main function, write a program that asks for integer input to be assigned on a 3 x 3 array and call the function displayElements to print the contents on the next line. Input 1. Multiple lines containing integer each line Output R1C1: 1 R1C2: 2 R1C3: 3 R2C1: 4 R2C2: 5 R2C3: 6 R3C1: 7 R3C2: 8 R3C3: 9 1 2 3 4 5 6 7 8 9
//convert array of numbers from farenheit to celcius// example:// argument: [23, 32, 41, 50, 59]// return: [-5, 0, 5, 10, 15]// hint: use Array.mapfunction toCelcius(array){ } //write a function that takes an input array and returns an array of booleans (>=75) or fail (<75)// example:// argument: [20, 30, 50, 80, 90, 100]// return: [false, false, false, true, true, true]// hint: use Array.mapfunction passOrFail(array){ }
[Lo Shu Magic Square] The Lo Shu Magic Square is a grid with 3 rows and 3 columns. The Lo Shu Magic Square has the following properties: 1. The grid contains the numbers 1 through 9 exactly. 2. The sum of each row, each column, and each diagonal all add up to the same number. In a program you can simulate a magic square using a two-dimensional array. Write a function that accepts a two-dimensional array as an argument, and determines whether the array is a Lo Shu Magic Square. Test the function in a program. 15 4 +15 3 5 7 > 15 8 1 6 + 15 15 15 15 15 Required function header: const int COLS = 3; void showArray(const int array[][COLS], int rows); //display 2-D array content bool checkLoShuSquare(const int array[][COLS], int rows); // check if the 2-D is a Lo Shu Square • Hint: Find the sum of the first row. If the sum of any other row or col != the sum of the first row. return false from the checkLoShuSquare() function
Complete the following function definition to recursively print the index of a unique value in an array or -1 if the value is not found:1 int getIndex(int *a, int s, int v) {2 if( ) { // if no values are found3 4 }5 if(a[s-1] == v) { // if a value is found6 7 }8 return getIndex( ); // recurse to check next value9 }Hint:Recurse through the array by counting down from size. 1. Complete the one line of code for line 2:2. Write one line of code for line 3:3. Write one line of code for line 6:4. Complete the one line of code for line 8: please send an atom code. not other software