2 3 [[1,2, 3], [4, 5, 6] ] \4 5 Complete the Python function transpose () below that takes as input a rectangular matrix (of any size) in list-of-lists representation, and returns the list-of-lists representation of its transpose. In other words, if M = [[1, 2, 3], [4, 5, 6]] then transpose (M) will return [[1, 4], [2, 5], [3, 6]]. You need need not check the input list M for consistency, i.e. you may assume each list in M has the same length. def transpose (M) :

2 3 [[1,2, 3], [4, 5, 6] ] \4 5 Complete the Python function transpose () below that takes as input a rectangular matrix (of any size) in list-of-lists representation, and returns the list-of-lists representation of its transpose. In other words, if M = [[1, 2, 3], [4, 5, 6]] then transpose (M) will return [[1, 4], [2, 5], [3, 6]]. You need need not check the input list M for consistency, i.e. you may assume each list in M has the same length. def transpose (M) :

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Note: Use less than 500 characters to describe the solution! The functions of a linked list can be performed with an array or vector (insert, delete, search, etc). Discuss or explain why would we go through the complexity of building a linked list.
Consider the pseudocode for insertion sort. Here, the next element in the unsorted portion of the list is swapped to the left until we find its appropriate location in the sorted part of the list. Describe another approach for determining where the next element belongs in the sorted portion of the list. In the context of sorting a vector in C++, does this affect the overall asymptotic run time of insertion sort? Why or why not?
Consider two already created singly linked lists List_A and List_B. Define pseudocode/algorithm for function i.e., differenceAB( ) wherein the function differenceAB( ) generates the list which contains the nodes only in List_A and not in List_B. Also write the code for the same in C language. which sorting algorithm is adaptable for singly linked list and why ? Answer the question correctly and in detail and please attempt complete question.
Linked List Question Which of the following statements are correct regarding the time complexity of getting the index of an item in a list? In an array-based implementation of lists, the worst-case time complexity of getting the index of an item in a list is O(n). In a linked list implementation, the worst-case time complexity of getting the index of an item in a list is O(1). Which of the following statements are correct regarding the time complexity of removing an item from a list? In an array-based implementation of lists, the worst-case time complexity of removing an item given the index of the item is O(n). In a linked list implementation, the worst-case time complexity of removing an item given the index of the item is O(n). Which of the following statements are correct about adding an element to a list implemented using arrays with no maximum limit for the number of elements and array growing? Adding an element may require copying elements to a new…
To add the two polynomials, assume that the singly linked lists' nodes are sorted in decreasing order of the variable x's exponents.The goal is to generate a new list of nodes representing the sum of P1 and P2. This is accomplished by combining the COEFF fields of nodes with identical powers of variable x in lists P1 and P2, and then creating a new node in the resultant list P1 + P2. The procedure's crux is presented below.P1 and P2 are the start pointers of the singly linked lists that represent polynomials P1 and P2. PTR1 and PTR2 are two temporary pointers that are initially set to P1 and P2, respectively. Make procedural code.
1a) Briefly discuss the significant difference between a priority queue and an ordinary queue. Using an everyday example, explain how a priority queue is used an underlying data structure. b) Compare and contrast the linear search and binary search algorithms by searching for the numbers 45 and 84 in the following list: 3 8 12 34 54 84 91 110 120
Haskell Using "merge", define a function "msort :: Ord a => [a] -> [a]" that implements "merge sort", in which the empty list and singleton lists are already sorted, and any other list is sorted by merging together the two lists that result from sorting the two halves of the list separately. Hint: first define a function "halve :: [a] -> (a],[a])" that splits a list into two halves whose lengths differ by at most one.
1-Write a C program to show operations on a singly linked where each node consists of integers. (a) Insert (At beginning, At end) (b) Delet (At beginning, At end) (c) Search (d)reverse (e) Print middle element 2 Write a C program using dynamic variable & pointers to construct a singly linked list consisting of the following information in each node. Student id (integer), student name (character string) & semester (integer). 3 Write a C program using dynamic variables & pointers to construct an ordered (ascending) singly linked list based on the rank of the student, where each node consists of the following information student id( integer) student name(character), rank(integer).
To add the two polynomials, we assume that the singly linked lists' nodes are organized in decreasing order of the variable x's exponents.The goal is to generate a new list of nodes reflecting the sum of P1 and P2. This is accomplished by combining the COEFF fields of nodes with comparable powers of variable x in lists P1 and P2, and then adding a new node in the resultant list P1 + P2. The procedure's core is presented below.P1 and P2 are the beginning pointers of the singly linked lists that symbolize polynomials P1 and P2. Furthermore, PTR1 and PTR2 are two temporary pointers that are originally set to P1 and P2, respectively. Procedure code should be written.
4) Given that a queue is being represented by the following circular representation in an array (front is currently 4 and back is currently 7): array component: 0 1 2 4 5 6 7 8 | | | | 37 | 41 | 12 | 34 | | a) Show what this representation would like after the following sequence of operations are performed: deq(q, i); deq(q, j); enq(q, 81); enq(q, 72); enq(q, 38); deq(q, k); (indicate the current position of front and back for each operation) b) What is an advantage of this implementation of a queue? c) What is a disadvantage of this implementation of a queue?
Need help with SML. I need to define the follwing functions. A range function similar to the range function in Python. For example, range (2,12,3) returns the list [2,5,8,11] fun range(start, stop, step)= nil; A slice function, with functionality similar to the Python list slice operator. For example, slice ([11,22,3,14,5,6], 1, 4) returns the list [22,3,14]. Assume that the indices specified are valid for the list. Hint: Write a helper function nthElement that returns the element at a specified (0-based) index in a list. For example, nthElement([10, 2, 34, 20], 2) returns 34, the element at index 2. fun binarySearch(sortedList, value) = false;
Consider a “superstack” data structure which supports four operations: create, push, pop, andsuperpop. The four operations are implemented using an underlying standard stack S as shownbelow.def create():S = Stack.create()def push(x):S.push(x)def pop():return S.pop()def superpop(k,A): // k is an integer, A is an array with size >= ki = 0while i < kA[i] = S.pop()i = i + 1Show that each of these operations uses a constant amortized number of stack operations. In yoursolution:• Define your potential function Φ.• State, for each operation, its actual time, the change in potential, and the amortized time.3. Suppose we add a superpush operation to the superstack from Problem 2. The superpush operationis defined as follows:def superpush(k,A): // k is an integer, A is an array with size >= ki = 0while i < kS.push(A[i])i = i + 1Is it still true that each of the superstack operations uses a constant amortized number of stackoperations? Answer YES or NO.• If your answer is YES, give an…