In this problem, we are dealing with two dimensional arrays (or matrices) that have 10 rows and 10 columns. Further, each entry in the array is 1, 2, or 3. Assume that the rows as well as columns are indexed by 1 through 10. Recall that there are 3100 such matrices. (a) In how many such matrices every row has exactly 5 ones and there are no other restrictions? (b) Imagine the matrix to be divided into 4 quadrants. In how many such matrices, in every quadrant there are exactly 10 ones and there are no other restrictions?

In this problem, we are dealing with two dimensional arrays (or matrices) that have 10 rows and 10 columns. Further, each entry in the array is 1, 2, or 3. Assume that the rows as well as columns are indexed by 1 through 10. Recall that there are 3100 such matrices. (a) In how many such matrices every row has exactly 5 ones and there are no other restrictions? (b) Imagine the matrix to be divided into 4 quadrants. In how many such matrices, in every quadrant there are exactly 10 ones and there are no other restrictions?

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

3π TT 4 4 1. Suppose that to build a 3×3 matrix in which the first column contains the sine of the elements between and 27, the second column contains the sine of the elements between and 37, the third column contains the sine of the elements between and Two spacing are required between the elements. You are requested to find the determinant and the inverse of the aforementioned matrix (Hint: Use linspace(a,b,n) to build three rows and transpose of a matrix to find the columns of the aforementioned matrix) a) Sketch the flow diagram b) Write the MATLAB Code on the answer sheet to construct this matrix, to find the determinant and the inverse of this matrix. c) Add explanation (comment) for each line of this MATLAB Code. d) Run the m-script and show the screenshots on your answer sheet by using the "print screen" button on the keyboard. e) Discuss what it can be said about the matrix in terms of its determinant and in terms of its inverse. 2. Let you consider the following linear…
Q1. Design a generic matrix multiplier. Here ‘generic’ means the design should work for anymatrix multiplication X∙Y = Z, where the matrices X, Y, and Z are of sizes a×b, b×c, and a×crespectively. Now, pick a, b, c from the last three digits of your roll number. ( If any of the digitsis 0, take 3 instead of it; if two digits are 0s, then take 3 for the first 0, and 5 for the second 0)For Example, if the last three digits are 123 then a = 1, b = 2, and c = 3; if the last three digitsare 204 then a = 2, b = 3, c = 4; f the last three digits are 100 then a = 1, b = 3, c = 5.
Use a simple algorithm to do the following ant it as a matlab code 1. Determine the mean of the elements of a matrix A WITHOUT using the mean function 2. Find out how many non-zero elements a matrix A has 3. Sum the diagonal elements of a square matrix A 4. Add the first and last elements of a vector v if you are not given the length of v
. The determinant of an n X n matrix can be used in solving systems of linear equations, as well as for other purposes. The determinant of A can be defined in terms of minors and cofactors. The minor of element aj is the determinant of the (n – 1) X (n – 1) matrix obtained from A by crossing out the elements in row i and column j; denote this minor by Mj. The cofactor of element aj, denoted by Cj. is defined by Cy = (-1y**Mg The determinant of A is computed by multiplying all the elements in some fixed row of A by their respective cofactors and summing the results. For example, if the first row is used, then the determi- nant of A is given by Σ (α(CI) k=1 Write a program that, when given n and the entries in an n Xn array A as input, computes the deter- minant of A. Use a recursive algorithm.
Suppose a computer program needs to apply an affine transformation to a complex three-dimensional object made up of 3000 points. The transformation is composed of 8 matrices (call them M1 through M3), so for each point (x, y, z) in the object, the following operation is performed. |-|-|-|-|| y M1 M2 M3 M7 M8 Each multiplication of a matrix times a column vector involves 16 multiplications (of one number by another) and 12 additions, for a total of 28 arithmetic operations. Each multiplication of a matrix times another matrix involves 64 multiplications and 48 additions, for a total of 112 arithmetic operations. (These numbers are not made up or chosen randomly; they are facts about 4 x 4 matrix multiplication.) The most inefficient way of applying the transformation to the 3000 points would be to begin on the left, multiplying M1 by M2, then that result by M3, and so on along the list from left to right, and doing the same 8 multiplications again for each of the 3000 points. How many…
1. Suppose we have three points in a two dimensional space: (3,1), (2,1), and (7,7). We want to perform PCA on these points, so we construct a 2-by-2 matrix whose eigenvectors are the directions that best represent these three points. Construct this matrix, as outlined in the PCA algorithm discussed in class, and identify, in the list below, one of its elements. a) 25.5 O b) 14 O c) 27 d) 12
The goal of this problem is to walk from cell (0, 0) to cell (m, n) of a two-dimensional array. Each step must be either to the right or downward. So you can step from cell (1, 1) to cell (1, 2) or (2, 1). but not from (1, 1) to (0, 1) or (1,0). You are given a toll matrix, where each cell contains a toll that must be paid upon entry into that cell. The goal is to make it from cell (0, 0) to cell (m, n) while paying the smallest possible total toll. Does a greedy algorithm work? Think it out. Write a dynamic programming algorithm that finds the minimum possible total toll. It does not need to do reconstruction and say how to achieve that total toll.
Using Python, to help solve the following problem. Provide an explanation of your solutions to the problem. 4. A symmetric matrix D is positive definite if x¹TDx > 0 for any nonzero vector x. It can be proved that any symmetric, positive definite matrix D can be factored in the form D = LLT for some lower triangular matrix L with nonzero diagonal elements. This is called the Cholesky factorization of D. Consider the matrix [2.25 -3 4.5 -10 -3 5 4.5 -10 34 a. Is A positive definite? Explain. A = b. Find a lower triangular matrix L such that LLT = A.
Find the eigenvalues of the matrix and determine whether there is a sufficient number to guarantee that the matrix is diagonalizable. (Recall that the matrix may be diagonalizable even though it is not guaranteed to be diagonalizable by the theorem shown below.) Sufficient Condition for Diagonalization If an n xn matrix A has n distinct eigenvalues, then the corresponding eigenvectors are linearly independent and A is diagonalizable. Find the eigenvalues. (Enter your answers as a comma-separated list.) Is there a sufficient number to guarantee that the matrix is diagonalizable? O Yes O No Need Help? Read it
If a matrix A has size 5x6 and a matrix B has a size 6x4, then what will be the size of a matrix A*B?
Define a numpy array representing the matrix and assign it to the variable B. 7 -6 −1 11 5 -6 -12 14 -8 8 B = -1 14 7 11 -8 12 5 8 8 -1 = 8 26 1 12 8 -1 -5 Furthermore, determine the eigenvector of this matrix with the eigenvalue closest to zero and assign it to the variable special_evec.
6. Use the Table function to create the matrix In Mathematica 2n 1 2n - 2 2n – 3 n .. 2n 2 2n 3 2n 4 п — - .. .. 2n – 3 2n – 4 2n – 5 2 — и w3 = n +1 n - 1 2 n ... n n - n - 2 1 .. 2. .. ..