using c++ with comments please Problem C. Incomplete sortingInput file:Output file:Time limit:Memory limit:standard inputstandard output1 second256 megabytesYou are given matrix with n rows and m columns.You have to sort each column of matrix in descending order.InputThe first line consists of two integers n and m - number of rows and columns of matrix respectively.Each of the next n lines contains m integers dij - elements of the matrix at the intersection of ih rowand jeh column.OutputPrint this matrix after sorting.Examplesstandard inputstandard output334 5 61 233233211214564 39 881236774 564 566 781 239 87

#include <iostream> using namespace std; int main(){ int n,m; int a[100][100]; //to…

Problem C. Incomplete sorting Input file: Output file: Time limit: Memory limit: standard input standard output 1 second 256 megabytes You are given matrix with n rows and m columns. You have to sort each column of matrix in descending order. Input The first line consists of two integers n and m - mumber of rows and columns of matrix respectively. Each of the next n lines contains m integers dij - elements of the matrix at the intersection of ih row and juh column.

Problem C. Incomplete sorting Input file: Output file: Time limit: Memory limit: standard input standard output 1 second 256 megabytes You are given matrix with n rows and m columns. You have to sort each column of matrix in descending order. Input The first line consists of two integers n and m - mumber of rows and columns of matrix respectively. Each of the next n lines contains m integers dij - elements of the matrix at the intersection of ih row and juh column.

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

I have the question and answer to this problem can someone explain the concept and how exactly I should go about doing it though step by step please Write a C function whose prototype is int select(char valid[ ][20], int num, char input[ ]); Each row of the array valid consists of a "valid" command. There are a total of num rows in valid. Your function should determine where the string stored in the variable input occurs in the table valid, and return the row number in which it occurs; if the string does not occur in valid, your function should return -1. The strings in valid may be of different lengths, but are all lower case. The string input may be mixed case, but your function should return a match regardless of case. For example, if the first three rows of valid were the strings "insert", "clear", and "printqueue", and the input string were "CLEar", your function should still recognize CLEar as equivalent to clear and return the integer 1. int select(char valid[ ][20],…
The MixColumn transformation of AES consists of a matrix–vector multiplication in the field GF(2^8) with P(x)=x^8 +x^4 +x^3 +x +1. Let b =(b7 x^7 +...+b0) be one of the (four) input bytes to the vector–matrix multiplication. Each input byte is multiplied with the constants 01, 02 and 03. Your task is to provide exact equations for calculating the results of those three constant multiplications. We denote the result by d =(d7 x^7 +...+d0). 1. Write expressions for computing the 8 bits of d=01 · b as functions of the bi`s: d0= , d1= , d2= , d3= , d4= , d5= , d6= and d7= . 2. Write expressions for computing the 8 bits of d=02 · b as functions of the bi's. If a XOR operation of two bits is required write it as, for example, b0+b1. d0= , d1= , d2= , d3= , d4= , d5= , d6= and d7= . 3. Repeat for d =03 · b: d0= , d1= , d2= , d3= , d4= , d5= , d6= and d7= . Note: The AES specification uses “01” to represent the polynomial 1, “02” to represent the polynomial x, and “03” to represent x +1
Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, wherelength(TAM) is the number of letters of TAM. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used…
Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only…
Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only…
4 I enrolled in the Algorithms, Part II course on Coursera, and considering that the question is given after the Radix Sort lecture, I'm assuming the intent is to use one of the Radix Sorts. Given an unsorted array A[] of N 64-bit integers and a target value T, determine whether there aretwo distinct integers i and j such that a[i] + a[j] = T. Briefly explain why your algorithm is correct. Your algorithm should run O(N) in the worst case.
Correct and detailed answer will be Upvoted In C Question: How can the function, matrix_initialize_unopt, be optimized and rewritten with loop collapsing? n has a size of 3000 struct fn_args { int n; int *mem1; int *mem2; }; int check(int x, int y) { return x < y; } void set(int *mat, int i, int num) { mat[i] = num; } void matrix_initialize_unopt(struct fn_args *args) { int i, j, n; int *mat1, *mat2; n = args->n; mat1 = args->mem1; mat2 = args->mem2; for (i = 0; check(i, n); i++){ for (j = 0; check(j, n); j++){ set(mat1, i * n + j, i); set(mat2, i * n + j, i+1); } } }
sub : computer science Pls solve asap.i ll upvote.Thank You Convert this C++ function to an ARM 64 function and please check before bc I've been getting ones that don't assemble or get a segmentation fault.void insertionSort(int arr[], int n) { int i, key, j; for (i = 1; i < n; i++) { key = arr[i]; j = i - 1; // Move elements of arr[0..i-1], // that are greater than key, to one // position ahead of their // current position while (j >= 0 && arr[j] > key) { arr[j + 1] = arr[j]; j = j - 1; } arr[j + 1] = key; } }
C++ Given an integer matrix of size M × N. Find the number of the first of its columns containing an equal number of positive and negative elements (zero elements of the matrix must be ignored). If there are no such columns, then print 0. Write a function to solve this problem. void max_each_column(int a[20][20], int n, int m) 3 3 1 2 -3 4 0 3 7 -8 0 Output: 1
(a) Write a function matrix_multiply(mat1, mat2) that takes two matrices and returns the result of the matrix multiplication between mat1 and mat2. If the two matrices are not compatible with multiplication, then None should be returned. (b) Write a function print_sums(list1, list2) that takes two equal-length lists of numbers and prints all the sums of the corresponding elements. Thus the first line is the sum of the first element of list1 and the first element of list2, the second line is the sum of the second elements, and so on.
Matrix multiplication plays an important role in a number of applications. Two matrices can only be multiplied if the number of columns of the fi rst matrix is equal to the number of rows in the second.Let’s assume we have an m × n matrix A and we want to multiply it by an n × p matrix B. We can express their product as an m × p matrix denoted by AB (or A ⋅ B). If we assign C = AB, and ci,j denotes the entry in C at position (i, j), then for each element i and j with 1 ≤ i ≤ m and 1 ≤ j ≤ p. Now we want to see if we can parallelize the computation of C. Assume that matrices are laid out in memory sequentially as follows: a1,1, a2,1, a3,1, a4,1, ..., etc.Assume that we are going to compute C on both a single core shared memory machine and a 4-core shared-memory machine. Compute the speedup we would expect to obtain on the 4-core machine, ignoring any memory issues.Repeat above Exercise, assuming that updates to C incur a cache miss due to false sharing when consecutive elements are in a…
Consider the following problem. INPUT: Positive integers r1, ··· , rn and c1, ··· , cn . OUTPUT: An n by n matrix A with 0/1 entries such that for all i the sum of the ith row in A is ri and the sum of the ith column in A is ci , if such a matrix exists. Think of the problem this way. You want to put pawns on an n by n chessboard so that the ith row has ri pawns and the ith column has ci pawns. Consider the following greedy algorithm that constructs A row by row. Assume that the first i-1 rows have been constructed. Let aj be the number of 10 s in the jth column in the first i-1 rows. Now the ri columns with with maximum cj -aj are assigned 1’s in row i, and the rest of the columns are assigned 00 s. That is, the columns that still needs the most 1’s are given 1’s. Formally prove that this algorithm is correct using an exchange argument.