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.

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.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

1 Sequence (46, 79, 56, 38, 40, 84), using quick sorting (with the leftmost element as the pivot), the first partition result is: OA 38 46 79 56 40 84 OB 38 79 56 46 40 84 OC 40 38 46 56 79 84 OD 38 46 56 79 40 84 2 Each time an element is taken from the unsorted sequence, compared with the elements in the sorted sequence, and then inserted into the appropriate position in the sorted sequence. What is the name of this sort method? A Bubble sort OB Direct insert sort OC Select sort OD Merge sort
Let M(m,n) denote the number of comparisons required to merge two sorted lists of sizes m and n. a) Derive an "information theoretic" lower bound on M(m,n). b) Find an interesting relation between M(m,n) and the analogous function S defined for sorting. Use this relation to derive a lower bound for M(m,n) in terms of S. (Hint: Start with an upper bound on S(m+n).
5. In Quick Sort algorithm, what are the key differences in performance characteristics when comparing the use of a fixed pivot (such as always choosing the first or last element) versus a pivot chosen randomly or through a median-of-three approach?
Alert dont submit AI generated answer.
Write Algorithm procedure code to illustrates the procedure for Fibonacci search. Here n, the number of data elements is such that:i) Fk+1 > (n+1); andii) Fk + m = (n +1) for some m ≥ 0, where Fk+1 and Fk are two consecutiveFibonacci numbers.
Create and test predictions regarding the insertion sort and selection sort running times for arrays with just two key values, assuming that the values are equally likely to occur.
How can I insert, remove, and search nodes in a data structure with a time complexity that is less than O(n)?
Build a Binary Search Tree with the given input order. You must show step by step process of inserting the inputs including both recursive calls and tree diagrams for each step. [ refer to the Insertitem function of Lecture 10 slides to get an idea of doing this.] N.B: Unique Input orders for each student to build the tree are given on a separate file. Write down the input order on your answer script before answering the question. You must use the assigned input order. Do not change the order. TREE INPUT: 4,1,9,3,2,5,6,8,7
For each question, an algorithm will be described that operates on N elements, and your answer should include: (a) a big-O expression that describes the total number of operations in the worst case (for ex- ample, O(N³)) (b) a description of how to achieve the same effect as the algorithm described, but achieved with a better big-O time bound (for example, "use mergesort instead of insertion sort") (c) the big-O time bound for your improved approach. Your improved algorithm does not need to be provably the best possible, but it should have a different and better big-O bound. (It may not be as simple as substituting one named algorithm for another; consider what is redundant about the work done by the existing algorithm.) You don't need to use pseudocode to describe your algorithms - the style used in the problem descriptions is also sufficient for your solutions. You can use pseudocode if you like. Do not write real code. If you wish to use an algorithm described in class, you can name…
Can’t figure this out can you pls explain your solution I need to know the thought process.
In how many ways can five elements be selected in order from a set with Three elements when repetition is allowed? Give explanation.
Fill in the blanks