CREATE A FLOWCHART FOR THIS CODE ASAP THANK YOU M1 - np.array([[12,7,3],[4 ,5,6],[7 ,8,9]])M2 - np.array([[1,0,01,[0,1,01,[0,0,1]result = [[0 for x in range (3)] for y in range (3)]for i in range(len(M2)) :for j in range (len(MI[0])):for k in range (len (M1)):result[i][j] += M2[i][k] * M1[k][j]print (result)[[12, 7, 31, [4, 5, 6], [7, 8, 9]]

Here as per python code, draw flowchart as per my knowledge. i hope you like it.

M1 - np.array (I [12,7,3], [4 ,5,6], [7,8,9] ]) M2 - np. array(( [1,0,01, [0,1,0], [0,0,1] 1) result = [[0 for x in range(3)] for y in range(3)1 for i in range(len(M2)): for j in range(len(M1[0])) : for k in range (len (M1)): result[i][j] += M2[i][k] * M1[k][j] print (result) [[12, 7, 31, [4, 5, 6], [7, 8, 9]]

M1 - np.array (I [12,7,3], [4 ,5,6], [7,8,9] ]) M2 - np. array(( [1,0,01, [0,1,0], [0,0,1] 1) result = [[0 for x in range(3)] for y in range(3)1 for i in range(len(M2)): for j in range(len(M1[0])) : for k in range (len (M1)): result[i][j] += M2[i][k] * M1[k][j] print (result) [[12, 7, 31, [4, 5, 6], [7, 8, 9]]

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Take an array of length n where all the numbers are nonnegative and unique. Find the element inthe array possessing the highest value. Split the element into two parts where the first part containsthe next highest value in the array and the second part holds the required additive entity to get thehighest value. Return the array index value. Consider the negative numbers as well.Input: [4, 8, 6, 3, 2]Output: [4, 6, 2, 6, 3, 2]
Execute the following using Array Implementation. Use diagrams in showing your final answer c. INSERT(Alice,1,L) INSERT(Bob,2,L) INSERT(Kare,3,L) INSERT(Ram,4,L) DELETE(2,L) What will happen to your array?
A unimodal array is an array that has a sequence of monotonically increasing integers followed by a sequence of monotonically decreasing integers, assuming all elements in the array are unique. Example: - A= {4, 5, 8, 9, 10, 11, 7, 3, 2, 1}: A is a unimodal array because there is an increasing sequence followed by a decreasing sequence and the maximum element is 11.- B= {11, 9, 8, 7, 5, 4, 3, 2, 1}: B is not a unimodal array because there is no increasing sequence It is simply a decreasing sequence and the maximum element is 11.- C= {1, 2, 3, 4, 5, 7, 8, 9, 11}: C is not a unimodal array because There is an increasing sequence, but there is no decreasing sequence and the maximum element is 11.a) Design an efficient algorithm with the lowest possible complexity to state whether a given array is unimodal or not, and explain why your algorithm is efficient. b) Analyze the complexity of your algorithm. Data Structure With Python
Write a code segment IN PYTHON that initializes each cell in a three-dimensional array with an integer that represents its three index positions. Thus, if a position is (depth, row, column), the integer datum at position (2, 3, 3) is 233.
9.). integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1. A subarray is a contiguous part of an array. Example 1: Input: nums = [1], k = 1 Output: 1 Example 2: Input: nums = [1,2], k = 4 Output: -1 Example 3: Input: nums = [2,-1,2], k = 3 Output: 3.
Given an integer **n**, create a two-dimensional array of size **n×n** according to the following rules and print it: - On the main diagonal put `0`.- On the diagonals adjacent to the main put `1`.- On the next adjacent diagonals put `2`, and so forth. # Example input ```5``` # Example output ```0 1 2 3 41 0 1 2 32 1 0 1 23 2 1 0 14 3 2 1 0```
Given an array, find the next greater element for each element in the array, ifavailable. If not available, print the element itself. The next greater element y for anelement x in the array is the first element that is greater than x and occurs on its rightside. The next greater element of the right most element in an array is the elementitself.Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]
Write a java program that creates a 4 x 5 two-dimensional array and fills it with the following numbers in this order: 16, 22, 54, 25, 41, 63, 91, 62, 42, 28, 98, 85, 13, 83, 33, 91, 58, 16, 23, 11 Find the following: Sum of the numbers. Average of the numbers to two decimal places. Maximum value of the numbers. Minimum value of the numbers. Total Count of the numbers greater than or equal to 50. You should first output the entire array and then output the answers to the above 5 questions. Make sure your output clearly identifies which answers are which.
java program that Read data from one array and sort elements in ascending order, and sum up two consecutive elements of the array and store them in other array. Read data from one array called array and sort elements in ascending order. Sum up two consecutive elements of the sumUpArray and print the results
Given an integer array, find the length of the longest subsequence formed by the consecutive integers. The subsequence should contain all distinct values, and the character set should be consecutive, irrespective of its order. For example: Input: [2, 0, 6, 1, 5, 3, 7] Output: 4 Input: [2, 4, 6, 3, 7, 4, 8, 1] Output 4 Explanation: The longest subsequence formed by the consecutive integers is [2, 0, 1, 3]. It has distinct values and length 4. Explanation: The longest subsequence formed by the consecutive integers is (2, 4, 3, 4, 1]. The distinct subsequence is [2, 4, 3, 1] having length 4. a) Design a brute-force algorithm to solve this problem , and analyse the complexity of your solution b) Design a more efficient algorithm to do the same task with less complexity , and analyse the complexity of your solution. [Important instruction to be followed: Create an arbitrary input of at least 5 elements and use it to provide full explanation of how your proposed algorithm should work step…
Vectors store a linear arrangement of values, accessed by a single index. Two-dimensional arrays store a tabular arrangement of values, accessed by two indexes, for example matrix[i][j], where i is the row index, and j is the column index. A common two-dimensional array that you should have seen early on in your education is a multiplication table. For example, here is the multiplication table up to 5 x 5: 1 2 3 4 5 1 1 2 3 4 5 2 2 4 6 8 10 3 3 6 9 12 15 4 4 8 12 16 20 5 5 10 15 20 25 Write a program that asks the user for the number of rows and columns for a multiplication table and prints out the corresponding results.
What are the advantages and disadvantages of using an unordered array versus an ordered array?