create a flowchart discuss the functions and methods [30] def mat_operations (mat1, mat2):mat1 = np.array (mat1)mat2 = np.array (mat2)print('Matrix 1:', mat1)print('Matrix 2:', mat2)if (mat1.shape != mat2.shape):print('The shape of both matrices are not same. Could not perform operations.')returnprint('Sum of the given matrices:')msum = mat1 + mat2print (msum)print('Difference of the given matrices:')mdiff = mat1mat2print (mdiff)print('Element-wise multiplication of the given matrices:')mmul = np.multiply(mat1, mat2)print (mmul)print ('Element-wise division of the given matrices:')mmul = np.divide(mat1, mat2)print (mmul) [28] def mat_desc (mat):sq = Falsemat = np.array(mat)print (mat)print('Shape: ', mat.shape)print('Size:', mat.size)print ('Rank:', np.linalg.matrix_rank(mat))if (mat.shape[0]sq = Trueprint('The matrix is square')mat.shape[1]):=3Delse:print('The matrix is non-square')if (mat.shape[0] == 0 and mat.shape[1]print('The matrix is empty')0):==else:print('The matrix is not empty')iden = np.identity(mat.shape[0])if(sq and (iden == mat).all()):print('The matrix is an identity matrix')else:print('The matrix is not an identity matrix')one = np.ones ((mat.shape[0], mat.shape[1]))if((one == mat).all()):print('The matrix is an ones matrix')else:print('The matrix is not an ones matrix')np.zeros ( (mat.shape[0], mat.shape[1]))zero =if((zero == mat).all()):print('The matrix is an zeros matrix')else:print('The matrix is not a zeros matrix')

There is a shape function to determine the shape of a matrix. There is a size function to determine…

Answered: tions and me

Engineering

Computer Science

tions and me

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

def large_position(matrix: list[list[int]], row: int, col: int) -> int: """ Returns the area of the largest rectangle whose top left corner is at position <row>, <col> in <matrix>. You MUST make use of the helper <longest_chain> here as you loop through each row of the matrix. Do not modify (i.e., mutate) the input matrix. >>> case100 = [[1, 0, 1, 0, 0], ... [1, 0, 1, 1, 1], ... [1, 1, 1, 1, 1], ... [1, 0, 0, 1, 0]] >>> large_position(case1, 0, 0) 4 """ Helper: def longest_chain(lst: List[int]) -> int: count = 0 # defining count variable as 0. Using it for counting the length of the sequence.i = 0 # defining i variable as 0. Using it for index positionwhile (i < len(lst) and lst[i] != 0): # iterating through out the list while i is lesser than the length of the list and until we encounter any 0i += 1 # increasing the index valuecount += 1 # increasing the countreturn…
def large_position(matrix: list[list[int]], row: int, col: int) -> int: """ Returns the area of the largest rectangle whose top left corner is at position <row>, <col> in <matrix>. You MUST make use of the helper <longest_chain> here as you loop through each row of the matrix. Do not modify (i.e., mutate) the input matrix. >>> case = [[1, 0, 1, 0, 0], ... [1, 0, 1, 1, 1], ... [1, 1, 1, 1, 1], ... [1, 0, 0, 1, 0]] >>> large_position(case1, 0, 0) 4 """ You must refer to this while writing for the code above Helper: def longest_chain(lst: List[int]) -> int: count = 0 i = 0while (i < len(lst) and lst[i] != 0): i += 1 count += 1 return count """ Please do this on python you should not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter import ""'
Java Program Your program should use 2D arrays to implement simple matrix operations. Your program should do the following: • Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order • Print M1 to the console; make sure you format as a matirx • Repeat the previous steps for a second matrix M2 • Create a matrix M3 that is the transpose of M1 and print it to the console • Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message. • Extra credit: Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements: • Use a helper method for reading a positive integer using an input validation loop. • Use a helper method for printing a matrix. Your helper methods should be private and…
Question 4: (30 marks) A Math teacher is teaching Math course to a set of classes (each class may have different number of students) and want to check the behavior of his students in a homework report. The teacher gave the classes the same exam and marked their answer and wants to know the class whose students got the highest average. Help the teacher in the required analysis of student’s marks by implementing a Java program ClassAverageMArks2DimmArray using 2-dimensional array to store the students marks and then compute the average of each class student’s marks. The program has the following specification: • A Method titled averageClassMarks for computing the average (as double) of a class students marks (given to the method as a single-dimensional array) • Another Method titled averageAllClassesMarks for computing the average (as single array of double) of all the classes class student’s marks (given to the method as a 2dimensional array). This method has to repeatedly call the…
8.13 LAB: Library book sorting Two sorted lists have been created, one implemented using a linked list (LinkedListLibrary linkedListLibrary) and the other implemented using the built-in Vector class (VectorLibrary vectorLibrary). Each list contains 100 books (title, ISBN number, author), sorted in ascending order by ISBN number. Complete main() by inserting a new book into each list using the respective LinkedListLibrary and VectorLibrary InsertSorted() methods and outputting the number of operations the computer must perform to insert the new book. Each InsertSorted() returns the number of operations the computer performs. Ex: If the input is: The Catcher in the Rye 9787543321724 J.D. Salinger the output is: Number of linked list operations: 1 Number of vector operations: 1 Which list do you think will require the most operations? Why? Main.cpp: #include "LinkedListLibrary.h"#include "VectorLibrary.h"#include "BookNode.h"#include "Book.h"#include <fstream>#include…
Ocaml 1. Create a function flip val flip : bool array array -> int -> int -> bool array array = <fun> that given a bool matrix and two integers i; j. it negates the values(true!false, false!true) at location i; j in the matrix, as well negatingthe values on the (up to) 4 horizontally/vertically adjacent elements. 2. Create a function print matrix val print_matrix : bool array array -> unit = <fun> that given a bool matrix, it prints it on screen (true !"T", false!"F").
import java.util.Scanner;import java.util.ArrayList; public class UserIDSorting {// TODO: Write the partitioning algorithm - pick the middle element as the // pivot, compare the values using two index variables l and h (low and high), // initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessarypublic static int partition(ArrayList<String> userIDs, int i, int k) {} // TODO: Write the quicksort algorithm that recursively sorts the low and // high partitionspublic static void quicksort(ArrayList<String> userIDs, int i, int k) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in); ArrayList<String> userIDList = new ArrayList<String>(); String userID; userID = scnr.next();while (!userID.equals("-1")) {userIDList.add(userID);userID = scnr.next();}// Initial call to quicksort quicksort(userIDList, 0, userIDList.size() - 1); for (int i = 0; i < userIDList.size(); ++i)…
5.28 LAB: Matrix multiplication (JAVA) A matrix is a rectangle of numbers in rows and columns. A 1xN matrix has one row and N columns. An NxN matrix has N rows and N columns. Multiplying a 1xN matrix A and an NxN matrix B produces a 1xN matrix C. To determine the Nth element of C multiply each element of A by each element of the Nth column of B and sum the results. Helpful information can be found at matrix multiplication. Write a program in java that reads a 1xN matrix A and an NxN matrix B from input and outputs the 1xN matrix product, C. The first integer input is N, followed by one row of N integers for matrix A and then N rows of N integers for matrix B. N can be of any size >= 2. For coding simplicity, follow each output integer by a space, even the last one. The output ends with a newline. Ex: If the input is: 2 2 3 1 2 3 4 A contains 2 and 3, the first row of B contains 1 and 2, and the second row of B contains 3 and 4. The first element of C is (2 * 1) + (3 * 3), and…
Java Quick Sort but make it read the data 10, 7, 8, 9, 1, 5 from a file not an array // Java implementation of QuickSort import java.io.*; class GFG { // A utility function to swap two elements static void swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } /* This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot */ static int partition(int[] arr, int low, int high) { // pivot int pivot = arr[high]; // Index of smaller element and // indicates the right position // of pivot found so far int i = (low - 1); for (int j = low; j <= high - 1; j++) { // If current element is smaller // than the pivot if…
(Bucket Sort) A bucket sort begins with a one-dimensional array of positive integers to besorted, and a two-dimensional array of integers with rows subscripted from 0 to 9 and columns subscripted from 0 to n – 1, where n is the number of values in the array to be sorted. Each row of thetwo-dimensional array is referred to as a bucket. Write a function bucketSort that takes an integerarray and the array size as arguments.The algorithm is as follows:a) Loop through the one-dimensional array and place each of its values in a row of thebucket array based on its ones digit. For example, 97 is placed in row 7, 3 is placed inrow 3 and 100 is placed in row 0.b) Loop through the bucket array and copy the values back to the original array. The neworder of the above values in the one-dimensional array is 100, 3 and 97.c) Repeat this process for each subsequent digit position (tens, hundreds, thousands, andso on) and stop when the leftmost digit of the largest number has been processed
Flood a. Write a function print_int_matrix : int array array -> unit = < fun> That prints a rectangular integer matrix on screen. b. Write a function flood : ’a array array -> ’a -> unit = that changes the values of the input matrix according to the rules of the game Flood: https://www.chiark.greenend.org.uk/~sgtatham/puzzles/js/ flood.html. In short, it changes the value of the top left element, along with every element of the same value that is reachable from it, to the specified ’a value. An element is reachable if there exist a path from the top left element by going down, left, up, or right along same value elements. here is how the compilation should be: 1 # let generate_matrix rows columns vals seed = Random .init seed ; Array . make_matrix rows columns 0 | >Array . map ( Array . map (fun x - > Random . int vals ) ) ;;2 val generate_matrix : int -> int -> int -> int -> intarray array = <fun >(this is continue on the images)
O'caml Sliding tiles (35%) The mechanics described in this exercise can be used to implement a game sliding tiles. For basic description of the game see https://en.wikipedia. org/wiki/Sliding_puzzle. 1. Create a type slidingTile, consisting of a char matrix and two integers x and y. The integers x and y are the coordinates of an empty tile. 2. Create a function val slide : slidingTile -> int -> int -> slidingTile = that given a slidingTile and two integers, that represent a location in the matrix, it slides the tile from the specified location to the empty tile, then returns the altered slidingTile. If provided location is not adjacent to the empty tile, or out of bounds, then return the slidingTile unaltered. 3. Create a function val print_tile : slidingTile -> unit = that prints a slidingTile on screen with the corresponding characters from the matrix. However, print an empty space where the empty tile is instead.