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: 4 Cartesian map Use the built-in higher order functions? and write a non-recursive function val…

A: generating the Cartesian product of two arbitrary lists in your language. Demonstrate that your…

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: Write a function to find the largest element of an array using; a.Tail recursion b. Non-tail…

A: In tail recursion the recursive call is the final statement before the return while in non tail…

Q: implement a LinkedList class that stores integers using dynamic memory and a proper main program to…

A: The implementation in C++ is given below:

Q: How its gonna look without vector in cpp, recursive

A: code   #include <iostream>using namespace std; void getMazePaths(int sr, int sc, int dr, int…

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: Write a mutually recursive RACKET function (max-length str-list) that takes one argument, a…

A: def get_max_str(list, fallback=''): if not list: return fallback max_str = list[0]…

Q: A function dog_and_fox() has been analyzed to run with O(n²) complexity to process a list of size n.…

A: Time Complexity = O(n2) for size n 5 days to process a list of size 1000 for list of size 2000 would…

Q: Define a Python list named A to represent a 2x2 matrix of ones. Could you write the codes by using…

A: #this is how we can represent 2x2 matrix in python3A=[[1,1],[1,1]] #print matrix Afor i in range(2):…

Q: (a) The required hasko merge [] x = x merge x [] = x

A: Let's see the solution.

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: Complexity of Binary Search Suppose our programming language has only one type of list. It takes…

A: Binary search: This search will often divide the search interval into half and begin with in an…

Q: PYTHON CS1 PROBLEM Define a function that takes a dictionary gdict as a parameter and returns a list…

A: Here is the  complete python code. See below step for code.

Q: For a singly linked list pointed at by pointer Ptr, write the implementation of a function named…

A: Given :

Q: Please use python codes and don't copy from previous answers. 3.) Consider the matrix list x =…

A: PROGRAM: #Header file to access the list   import numpy as np   #Creating the list   list1 =…

Q: How to perform following functions in single linked list using getters and setters in c++…

A: Solution:   Given, Insert at beginning and insert at last Search     Function for Insert a node at…

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: Study the definition of function funArray and answer the question below. void funArray (double List…

A: Function is called as pass by value and original values doesn't gets reflected

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 a C++ function appendList() that takes two linked-list headers as a parameter, append the…

A: C++ Code: #include <iostream> using namespace std; //--------Class for defining type of node…

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: 2. Show and draw the linked list for the following Python codes step by step. Assume the node is in…

A: here in the question ask for a draw a visulization of linkedlist given in program.

Q: Write a function sumLength() that takes a list of strings as parameter, finds and returns the total…

A: Write a function sumLength() that takes a list of strings as parameter, finds and returns the total…

Q: compare and contrast static array-based unsorted list and static array-based sorted list, There is a…

A: The static array-based list has the following disadvantages: 1. The list is un-sorted meaning it…

Q: ion called genericSort() that takes in a numeric or integer vector, sorts it, and returns the…

A: We need to define the genericSort() to sort and return the sorted indices as per the given…

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: SEARCH IN MATRIX You are give a matrix (a list of lists) of DISTINCT integers and a target number.…

A: Below I have provided Python Programming . Also, I have attached the screenshot of the code and…

Q: 2. Define a recursive function merge :: Ord a => [a] -> [a] -> [a] that merges two sorted lists of…

A: Haskell code:- merge :: [a] -> [a] -> [a]merge = \s1 -> \s2 ->  case s1 of    [] ->…

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…

Q: given a unsorted array arr[]={5,10,7,18,9,63,4,1,2,12,25}; write a function in C+ to search a…

A: Given : arr[]={5,10,7,18,9,63,4,1,2,12,25}; Write a search function that takes parameter array and a…

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.