You have Two matrix A =124 6:8 10 12: 14 16 18] and B=[ 135:7 9 11:13 15 17]. write the command and the answer for the following equestions * Sum the two matrices A and B.10 * Find the elements of the main diameter in Matrix A and * Make the all element of column 3 = 0 in the Matrix A .3

You have Two matrix A =124 6:8 10 12: 14 16 18] and B=[ 135:7 9 11:13 15 17]. write the command and the answer for the following equestions * Sum the two matrices A and B.10 * Find the elements of the main diameter in Matrix A and * Make the all element of column 3 = 0 in the Matrix A .3

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 need the answer as soon as possible
John is playing a dice game. The rules are as follows. Roll two dice. Add the numbers on the dice together. Add the total to your overall score. Repeat this for three rounds. But if you roll DOUBLES, your score is instantly wiped to 0 and your game ends immediately! Create a function which takes in a matrix as input, and return John's score after his game has ended (10 points). Example: diceGame([[1, 2], [3, 4], [1, 1]])→ 10 WRITE IN PYTHON PLEASE
Question 17 Aa .You are given a sorted list of n numbers stored in an array A, where n can be arbitrarily large. Now randomly generate a number k and search the number in the list (i.e., in A). Now randomly select two subarrays of A, each of size n^1/2 . Then repeat the same procedure on each of the subarrays. The procedure stops after the subarray sizes become 1. Analyze the time complexity of finding the total number of successful searches in the entire procedure using big O-notation Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
In your R script: Monday Tuesday Wednesday Thursday Friday Product1 325 229 189 192 313 Product2 199 148 223 312 312 Product3 244 403 441 217 299 Store the daily sales of three product (given above) in a matrix object. Assign the row names and column names as given in the table above. Compute and print the average sales of each product (row) and average sales of each day (column). Insert the sales on the weekend to the matrix using cbind function. Saturday Sunday Product1 332 465 Product2 298 513 Product3 287 336 Print the sales of Product2 and Product3 on Tuesday, Thursday, and Sunday as a submatrix (Please type answer no write by hend)
Create a square matrix that has ones in the first row and first column, and whose remaining elements are the sum of two elements: the element above and the element to the left. Your program should be able to make a matrix of any size. Do this exercise using a loop (for or while) with break/continue statements as necessary.
Write a program that takes nxn matrix with entries of integer values. i) Find out the maximum and minimum in the matrix. ii) Ask user to enter one number and search the frequency count of the entered number in each row of the array. iii) Calculate the sum of digits of array elements.
Q1// write program to print sum of the third colume in matrix? 2 4 7 9 10 1 6. 3 2.
Write a program for reading a square matrix (A) 10,10, then calculate and find the following: 1- the sum of the elements of the upper triangle of the matrix. 2 - The sum of the elements of the lower triangle. 3- The sum of the main diagonal elements of the matrix. 4- The sum of the elements of the perimeter of a matrix.
In python, how do you generate a distance matrix H where in each entry hij, the distance between row i and row j are stored, distance is computed by the inner product <x,y>C := xTCy, where the matrix C is a 3x3 matrix: [3 1 6 1 2 1 6 1 27]. The dataset is a 26x5 matrix and I need to find the distance using the above inner product between each row - I should end up with a 26x26 distance matrix H, where each diagonal entry (i=j) is 0.
с++ The table of the football championship is given by a square matrix of order n, in which all elements belonging to the main diagonal are equal to zero, and each element not belonging to the main diagonal is equal to 2, 1 or 0 (the number of points scored in the game: 2—win, 1 — draw, 0—loss).Determine the numbers of the teams that passed the championship without defeat. Input: 5 0 1 0 2 2 2 0 1 2 1 0 1 0 2 0 2 2 2 0 1 1 0 2 2 0 Output: 1 3
In PYTHON (Sum the major diagonal in a matrix) Write a function that sums all the numbers of the major diagonal in an n × n matrix of integers using the following header:def sumMajorDiagonal (m):The major diagonal is the diagonal that runs from the top left corner to the bottom right corner in the square matrix. Write a test program that reads a 4 × 4 matrix and display the sum of all its elements on the major diagonal.Program Sample Run (With Input Shown in Bold)Enter a 4-by-4 matrix row 0: 1 2 3 4Enter a 4-by-4 matrix row 1: 5 6.5 7 8Enter a 4-by-4 matrix row 2: 9 10 11 12Enter a 4-by-4 matrix row 3: 13 14 15 16Sum of the elements in the major diagonal is 34.5
Exercise 2a Generate a random 3 x 3 matrix of integers between -6 and 6 that has a dominant eigenvalue. Either re-run the code until you get a matrix with a dominant eigenvalue, or duplicate the code below several times until you see a matrix with a dominant eigenvalue. Then manually enter this as the matrix A, so when we grade your assignment, the matrix doesn't get re-randomized. % Put your code here A = randi ([-6 6],3) A = 3x3 eig (A) 455 ans = 3x1 ܩ ܚ 2 -5 10.5990 -1.8175 3.2185 -3 1 6 %Hard code the matrix you generated here % so when we grade your assignment the value of the matrix won't % re-randomize Exercise 2b Find the dominant eigenvalue of the matrix A from the previous problem. Compare your estimate to the eigenvalues given by the "eig (A)" command, and do just enough iterations that your estimate accurate to within 10-3, following the procedure described in the example above; use the power method with re-scaleing. % You don't need to re-enter the matrix if you defined it…