Write a function trans(m) which returns the transpose

Assignment Help Python Programming

Reference no: EM13163658

(2) Write a function trans(M) which returns the transpose of an n-by-n matrix M. The matrix M is represented by a list of n lists, each of length n. Transposing M means that each M[i][j] is swapped (once!) with M[j][i].
The function must not use print(..) nor input(..). Write your own functions { don't call readymade solutions.
Example: trans([[4,2,1], ['a','a','a'], [-1,-2,-3]]) should return [[4,'a',-1], [2,'a',-2], [1,'a',-3]].

Reference no: EM13163658

Questions Cloud

Create a set of instructions : Provide a private address to be used for the AS and a public address to be used to connect to an ISP router connected to a border router.Create a set of instructions for the lab that would have students create a basic configuration and test connecti..

A boolean matrix has the parity property : A Boolean matrix has the parity property when each row and each column has an even sum, i.e. contains an even number of bits which are set. Here's a 4 x 4 matrix which has the parity property:

Same directory as your program : In the same directory as your program, create a file FF1, and write into it Hello (with a space at teh end). Similarly, create a file FF2, and write into it world! (with a new line, i.e., an ENTER at the end). And create a file DD and write into i..

Multiple choice question on networking : 1-Which of the following extensions point to an executable string of code?

Write a function trans(m) which returns the transpose : Write a function trans(M) which returns the transpose of an n-by-n matrix M. The matrix M is represented by a list of n lists, each of length n. Transposing M means that each M[i][j] is swapped (once!) with M[j][i].

True or false about networking : 2- A print queue must be set up for every printer on the network served by a print server. True False

Permutation ciphers : Permutation Ciphers (a.k.a. Transposition Ciphers) are another class of simple cryptosystems. For this we use the functions apply(.,.) and inv(.) from Homework 4; copy these two functions into your le as auxiliary functions.

Function should return a dictionary : Write a function numOccur(s), where s is a string; the function should return a dictionary whose keys are the 26 ascii letters abcdefghijklmnopqrstuvwxyz

Recursion to write a python function : Use recursion to write a Python function depth(LL), where LL is a nested list of lists of lists etc. of numbers (i.e., oat and int) and strings. We want to return the depth of nesting, i.e., how often, maximally, there is a list in a list etc

User Account

All Pages