Question 3: Show the steps of Strassen's algorithm to multiply the following two 4 x4 matrices: X...
Question 4 [12 marks] Some applications of mathematics require the use of very large matrices (several thousand rows for example) and this in turn directs attention to efficient ways to manipulate them. This question focuses on the efficiency of matrix multiplication, counting the number of numerical arithmetic operations (addition, subtraction and multiplication) involved. We start with very simplest case of 2x2 matrices. (a) The standard way of multiplying 2x2 matrices uses 8 multiplications and 4 additions. List the 8 products...
Use Excel to multiply the two matrices. -1 10 8 5 -4 8 11 7 21 3 = 62 1-0
Q3) Apply Quick sort algorithm to sort the following Array (Show complete steps, and show the values of p,r and q) 7 13 5 2 4 10 15 6 3 6
1. Show the steps in order to sort {11,5,6,3,8,1,9,2} using Mergesort algorithm. 2. Show the element sequences of running Shellsort on the input {15,2,8,1,10,7,4,3,9,11,12,6} at the increments {7, 3, 1}, respectively. 3. Show the steps in details of sorting {15, 2, 8, 1, 10, 7, 4, 3, 9, 11, 12, 6} using quicksort with median-of-three partitioning and a cutoff 3 (if the elements are less than 3, using insertion sort).
Please show work clearly. Thanks 4. Suppose you had n matrices with dimensions: ai xbi ,a2 x b2. . . . ,a,, X bn. Your goal is to determine, given two integers s and t, whether it is possible to multiply a sequence from the list of given matrices together, in any order and possibly not using all of the matrices, to end up with a matrix with dimensions s × t. For example, if the list of matrix dimensions...
Question #4 (15 points) In class, we discussed a divide-and-conquer algorithm for matrix multiplication that involved solving eight subproblems, each half the size of the original, and performing a constant number of e(n) addition operations. Strassen's Algo- rithm, which we did not cover, reduces the number of (half-sized) subproblems to seven, with a constant number of e(n) addition and subtraction operations. Provide clear, concise answers to each of the following related questions. • (7 points). Express the runtime of Strassen's...
Question 1 - Revised Simplex Algorithm 10 marks Suppose we are solving the following linear programming problem Subject to 8x1 + 12x2 + x3 15x2 + x4 3x1 + 6x2 + X5 -120 60 = 48 x1,x2,x3, x4,x5 2 0 Assume we have a current basis of x2,xz, x5. Demonstrate your understanding of the steps of the Revised Simplex Algorithm by answering the following: a) What is the basic feasible solution at this stage? What is the value of the...
Question 3 Given the data X1 = 1, X2 = 4, X3 = 5, X4 = 8, X5 = 10, evaluate 2 y2 56 0 28 0 e 784 206
Activity 15 - Matrices, Sequences and Conics Math 180 Task 6: Matrices and Cryptography messages. Using the following code, Matrices are used to encode and decode encrypted KİLİMİN 2 | 3 | 4 | 5 | 6 17 18 T-9 10111 | 12 | 13 | 14 一0一ㄧ一Pー1_Qー1.RT-s-T_T-I-U 15 16 17 18 19 20 21 ㄨㄧㄒㄧㄚ 1-2.TSPACE 24 25 26 ˇ一ㄒ一w 22 23 The sentence MATRICES ARE FUN becomes: AİRİE 13 1 20 189 3 5 19 0 1 18...
Question 1. Solving Recursive Relations [3 mark]. A naive multiplication of two matrices of order n requires O(nᵒ) additions. By using a divide and conquer approach, Strassen devised another algorithm that requires T(n) additions where T(n) = 7T(n/2)+cna, where c is a constant independent of n and T(1) = 0 (as multiplying two numbers re- quires no additions). Use the method of backward substitution (introduced in Week 2's lecture) to show that Strassen’s algorithm requires O(nlog27) = O(n2.81) additions, which...