6. Design a data structure that has the following properties: • Find median takes O(1) time • Extract-Median takes O(log n) time • Insert takes O(log n) time • Delete takes O(log n) time where n is the number of elements in your data structure. Describe how your data structure will work and provide algorithms for all aforemen- tioned operations. You are not required to prove the correctness of your algorithm.

Q: Create a NxN jigsaw puzzle. Create data structures and describe an algorithm to solve the challenge.…

A: We have a classic jigsaw puzzle. The grid-like puzzle has rows and columns. Each piece has four…

Q: Question 3: Give an algorithm that finds the maximum size subarray that is increasing (the entries…

A: The algorithm is given below.Explanation---For finding the maximum size subarray that is increasing…

Q: Design a data structure for a set in which insertions, deletions, and membership queries can be…

A: An array of dimension n+1, where the i-th element of the array indicates whether the integer i is in…

Q: Consider sets represented as lists (possibly with duplicates, not necessarily ordered). If each list…

A: The question is on finding time complexity of the list intersection.

Q: Consider there are random numbers and their size is not predictable initially. The requirement is to…

A: Answer : 1) The data structure that can be used to store large data in an efficient way can be a…

Q: Illustrate the growth of the algorithm by: i. providing a table that reports the growth of the…

A: Solution:

Q: Assume that a two-dimensional array of doublewords has three logical rows and four logical columns.…

A: Let's imagine a double-word array in two dimensions that has three logical rows and four logical…

Q: please answer the following definitions: A programming construct that is defined within a…

A: As per our guidelines, we are supposed to answer only 1st three parts. Kindly repost the remaining…

Q: Suppose we are given two sorted search tables S and T, each with n entries (with S and T being…

A: Answer: We have explain how to search kth element of two sorted array S and T where finding the kth…

Q: Q2. Rank the following function by their order of growth (increasing order). (n+1)! , 1, nlogn,…

A: The function by their increasing order

Q: The pseudo-code to create the matrix: Procedure AdjacencyMatrix(N): //N represents the number of…

A: Given data : The pseudo-code to create the matrix: Procedure AdjacencyMatrix(N): //N represents the…

Q: SE JAVA The merge sort is a recursive algorithm that can be used to sort an array by first sorting…

A: Merge Sort application:* Merge Sort is useful for sorting linked lists in O(nLogn) time. For linked…

Q: Exercise-1: Find the convolution of the two sequences.x[n] and h[n] given by x[n] = [124] h[n] = [1…

A: Here is an example of Octave code for finding the convolution of two sequences x[n] and h[n]:

Q: Fill in the A[] with names of your childhood friend then write and implement Linear Search algorithm…

A: We are going to create an array of strings with 4 names in it and then we will search for a name in…

Q: Q. What are the middle values compared in searching the data for the list of data below: 9 11 15 17…

A: Using Binary search Algorithm   Pseudocode   Procedure binary_search A ← sorted array n ← size…

Q: Q1: MCM Algorithm Implementation Implement Matrix Chain Multiplication (MCM) algorithm using the…

A: Problem Statement: Implementation of Matrix Chain Multiplication algorithm. Since there is no…

Q: Input: { 4, 2, -3, -1, 0, 4 } Subarrays with zero-sum are {-3, -1, 0, 4 }

A: Find the subarrays from the given array whose sum is zero print all the sub arrays   Note: Kindly…

Q: Q NO: 5 Given the array of natural numbers below i. What is the precondition to perform jump search?…

A:

Q: (c) Consider the elements 15 9 78 54 13 19 6 2 1 52 87 91 Perform the analysis by showing how the…

A: Please check the step 2 for solution

Q: Explain the concept of binary search, and compare it with linear search. Discuss the advantages and…

A: Linear search and binary search are two algorithms used to search for an element in a sorted array.…

Q: Returns the area of the largest rectangle in . The area of a rectangle is defined by number of 1's…

A: Below i have given code:

Q: In elementwise multiplication A.*B each value in one matrix is paired up with a buddy value in the…

A: for first question correct answer is dot(A[1:],B[:1])

Q: simulate Cantor’s diagonalization argument. Using a pool of 5-letter words, build a 5 by 5 matrix in…

A: The problem is based on Cantor's diagonalization argument, a mathematical method used to prove that…

Q: What is the answer to this data structures question: The lower bound Ω(n log n) on the running time…

A:

Q: Algorithm to  illustrates the procedure for Fibonacci search. Here n, the number of data elements is…

A: The Fibonacci search algorithm is a search algorithm that works on sorted arrays. The algorithm…

Q: Worst case of insertion time complexity in BST is                a)  O (log2 n) b.       O (n)…

A: As the time complexity of insertion time is   O (n) the option may not be the correct answer.

Q: A picture is worth a thousand words’ goes the saying: How much information is contained in a…

A: picture of size 250*400 pixel 250*400 no. of pixels=100000 =100000*16 =1600000/8 bits =200000/1024…

Q: 2. Binary Search Algorithm (c) Consider the elements 15 9 78 54 13 19 6 2 1 52 87 91 Perform the…

A: In binary search algorithm, we keep on comparing the required key value with the middle index. Then…

Q: 1. Compute the average running time of Insertion Sort, Merge Sort and the maximum element formally.…

A: Below is the complete solution for the time complexity of both insertion sort and merge sort in…

Q: Develop a merge implementation that reduces the extra space requirement to max(M, N/M), based on the…

A: The goal of this question is to implement a merge sort algorithm with a reduced space requirement.…

Q: python Create a dict mapping keys (N = 100, 200, 400, ... 51200) to arrays with linear…

A: import numpy as np def doubling_range(start, stop):     while start < stop:         yield start…

Q: Recall that np.dot (a,b) performs a matrix multiplication on a and b, whereas a performs an…

A: We need to find the shape of the c variable. See below steps

Q: m. What are the asymptotic worst-case running times for each of the seven fundamental dictionary…

A: Dear Student, The answer to your question is given below -

Q: Data Structure and Algorithm: Please provide a coding example or visual diagram for the following:…

A: Serial search, also known as linear search, is a simple algorithm for finding an element in a list…

Q: Design MapReduce algorithms that takes as input two sets (say, set A and Set B) and performs set…

A: l1=list(map(int,input().split()))l2=list(map(int,input().split()))s1=set(l1)s2=set(l2)print(s1|s2)pr…

Q: B. Radix Sort Algorithm is created by performing stable Bucket Sort for each of the keys. Show,…

A: Hey, since there are multiple questions posted, we will answer first question. If you want any…

Q: In merge sort, the merging step takes O(n) time which is based on the assumption that comparing two…

A: Dear Student, The answer to your question is given below -

Q: What is the running time of finding a single number from an unsorted array of p elements. (a)  O(n)…

A: Running time for searching an element in unsorted array of element n is O(p)   Running time for…

Q: a) Bubble Sort has worst-case run-time complexity O(n). b) Bubble Sort has worst-case run-time…

A: Statements that are correct - A. Bubble sort has worst case run time complexity O (n) . It is False…

Q: Implement the following sorting algorithms to find the total number of element comparisons for the…

A: 1.create a function sort to sort the values.2. create another function to display the value which is…

Q: Help I will thumbs up! Help needed with a data structures question: (a) Using the fact that you can…

A: Statement given: Using the fact that you can sort a 5-long array of numbers with 7 comparisons,…

Q: Provide an algorithm that searches for an element m in the array-like data structure for integers.…

A: ALGORITHM:   Here's an algorithm for searching for an element m in an array-like data structure for…

Q: What is the order of the following data after 3 iterations (i.e. passes) of an descending (i.e.…

A: Lets apply the Descending insertion sort algorithm on given list: [99,6,62,87,75,5,42,98] in first…

Q: Given the pseudocode fragment below to find the largest number in a 2D matrix, drag and drop the…

A: #Sample code in python  matrix = [[1, 2, 3, -4],           [25, -6, 7, 8],           [9, 10, 11,…

Q: The Big-Oh of an algorithm is derived from the T(n) of the algorithm. Suppose an algorithm has T(n)…

A: Intoduction : Big Oh Notation : The Big Oh notation of the program is used to find the function…

Q: Assume that we are utilizing a doubly linked list of unsorted data. What would be the asymptotic…

A: Solution : Search () - O(n) Insert() - O(1) Delete() - O(1)