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) :

Q: This is to be done in ML coding language. Please provide the actual code (with an output). Try and…

A: The ML Code is given below with output screenshot

Q: Implement a program that implements a sorted list using dynamic  allocated arrays. Use C++ and do…

A: A sorted list using dynamic allocated arrays is a data structure that allows you to store elements…

Q: Write a recursive function: maximum(lst: list)--> int The function returns the maximum from a list…

A: Complete the recursive function in python language to find the maximum of list elements: Function…

Q: must answer properly also attach output screeenshot Given a sorted vector, create a function that…

A: Solution:   Given, Given a sorted vector, create a function that return balanced binary search tree…

Q: Let xHead, yHead and zHead be the head pointers of 3 linked lists of integers (called X-list, Y-list…

A: All the code already you have. I have implemented only  merging the two list in third list  so copy…

Q: Write a function in C++ called SortByUpper, that takes a vector of strings and changes that vector…

A: Below i have written:

Q: 3- If an input for Merge-sort is a sorted list, then the recursive function can be written as as…

A:

Q: For a suitable number of buckets, use an array of lists data structure to sort I a list of strings,…

A: Introduction: Bucket sort is a sorting algorithm that divides the input into several "buckets" and…

Q: In the game of Connect Four, two players take turns playing on an n x n board, which we represent as…

A: The game is called Connect Four. It is played on an n x n board, which is represented as a 2D list…

Q: Write a PYTHON function (program) thst takes a list as argument, and returns a list without the…

A: Pop(i) function removes the i’th element from the list.  Hence the orignal list is altered.

Q: Write the function most common substring(S,m) that receives a string S and an integer m and returns…

A: The problem at hand is to find the most frequent substring of length m in a given string S. The…

Q: Write a function matrix_multiply(mat1, mat2) that takes two matrices and returns the result of the…

A: import numpy as np def matrix_multiply(mat1, mat2):    rows = len(mat1)    cols = len(mat2[0])…

Q: In the Julia language, complete the function for counting sort   function…

A: Counting sort is a sorting algorithm that sorts elements based on the number of occurrences of each…

Problems on amortized analysis

Amortized analysis is a technique used to perform micro-level analysis of an algorithm's complexity or resource (time and memory) consumption. It is used for analyzing the time efficiency of data structures that support many operations such as stacks and heaps.Operations supported by stack include push, pop, multi push, and multi pop while operations supported by heap are inserted, delete, extract-min, and so forth. It focuses on the sequence in which these operations are executed and therefore, provides an accurate cost estimation.