Running Time Analysis: Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. You MUST choose your answer from the following (not given in any particular order), each of which could be reused (could be the answer for more than one of a) – f)): O(N2), O(N½)O(N3 log N), O(N log N), O(N), O(N2 log N), O(N5), O(2N), O(N3), O(log N), O(1), O(N4), O(N12)O(NN), O(N6), O(N8), O(N9) **For any credit, you must explain your answer. Assume that the most time-efficient implementation is used. Assume no duplicate values and that you can implement the operation as a member function of the class – with access to the underlying data structure. a) Pop a value off a stack containing N elements implemented as an array. Explanation: b) Printing out all the odd values stored in a binary search tree containing N positive integers in ascending order. Explanation: c) Finding the minimum value in a binary search tree of size N. Explanation:

Running Time Analysis: Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. You MUST choose your answer from the following (not given in any particular order), each of which could be reused (could be the answer for more than one of a) – f)): O(N2), O(N½)O(N3 log N), O(N log N), O(N), O(N2 log N), O(N5), O(2N), O(N3), O(log N), O(1), O(N4), O(N12)O(NN), O(N6), O(N8), O(N9) **For any credit, you must explain your answer. Assume that the most time-efficient implementation is used. Assume no duplicate values and that you can implement the operation as a member function of the class – with access to the underlying data structure. a) Pop a value off a stack containing N elements implemented as an array. Explanation: b) Printing out all the odd values stored in a binary search tree containing N positive integers in ascending order. Explanation: c) Finding the minimum value in a binary search tree of size N. Explanation:

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 18SA

See similar textbooks

Similar questions

The time complexity equation of merger-sort is T(n) = 2* T(n/2) + n, where T(1) = C and C is a constant. Solve this equation by giving detailed steps. If you have an equation like the following T(n) = 3* T(n/3) + n, where T(1)=T(2)=C, what would be T(n)?
Consider a divide-and-conquer algorithm that calculates the sum of all elements in a set of n numbers by dividing the set into two sets of n/2 numbers each, finding the sum of each of the two subsets recursively, and then adding the result. What is the recurrence relation for the number of operations required for this algorithm? Answer is f(n) = 2 f(n/2) + 1. Please show why this is the case.
Given the following code snippet, find the following:1) Recurrence relation of func (x,y) when x>0 and length of y is n.T(x,n) = T(_) + O(_) (Just fill in the blanks)For 2-3, consider worst-case scenario and initial value of y as [1]2) Time complexity of func (x,y)3) Auxiliary Space Complexity of func (x,y)
Run Time Analysis Provide the tightest big-Oh bound on the run time for each of the following methods. int fib(int n) { if( n==0 ) return 0; else if( n==1 ) return 1; else { return fib(n-1) + fib(n-2); } }
Imagine a collection of nuts and bolts that are all together in one pile on a table. Describe, in pseudocode, how you would find all matching pairs of nuts and bolts. You need to find one solution for each of the problem-solving approaches given below. For each of your solution, determine how many comparisons of pairs of nuts and bolts you might have to make in the best- and worst- case scenario. You can assume that there are complete pairs, no single nuts or bolts, and that for each bolt, there is exactly one nut that fits. Describe a solution to the nuts and bolts problem (in pseudocode) using a Divide and Conquer Approach.
Worst case running time Describe the worst case running time of the following code in “big-Oh" notation in terms of the variable n. You should give the tightest bound , possible. (a) sum = 0; for( i = 1; i < n; i++ ) for( j = 1; j < i * i; j++ ) if( j % i == 0 ) for( k = 0; k < j; k++ ) sum++;
The median m of a sequence of n elements is the element that would fall in the middle if the sequence was sorted. That is, e ≤ m for half the elements, and m ≤ e for the others. Clearly, one can obtain the median by sorting the sequence, but one can do quite a bit better with the following algorithm that finds the kth element of a sequence between a (inclusive) and b (exclusive). (For the median, use k = n/2, a = 0, and b = n.) select(k, a, b)Pick a pivot p in the subsequence between a and b.Partition the subsequence elements into three subsequences: the elements <p, =p, >p Let n1, n2, n3 be the sizes of each of these subsequences.if k < n1 return select(k, 0, n1).else if (k > n1 + n2) return select(k, n1 + n2, n).else return p. c++
Let X(1..n) and Y(1..n) contain two lists of n integers, each sorted in nondecreasingorder. Give the best (worst-case complexity) algorithm that you can think for finding(a) the largest integer of all 2n combined elements.(b) the second largest integer of all 2n combined elements.(c) the median (or the nth smallest integer) of all 2n combined elements.For instance, X = (4, 7, 8, 9, 12) and Y = (1, 2, 5, 9, 10), then median = 7, the nthsmallest, in the combined list (1, 2, 4, 5, 7, 8, 9, 9, 10, 12). [Hint: use the conceptsimilar to binary search]
What is the worst case size of SL and SR (in terms of n) when you divide a list of unsorted items of size n into groups of (2*9)+1 while selecting a pivot? Input your answer as a decimal to three places. E.g. 3n/8 would be 0.375
solution should have O(l1.length + l2.length) time complexity, since this is what you will be asked to accomplish in an interview. Given two singly linked lists sorted in non-decreasing order, your task is to merge them. In other words, return a singly linked list, also sorted in non-decreasing order, that contains the elements from both original lists.
Solve the following recurrences using recursion tree method and write the asymptotic time-complexity. 1. T(n) = 3T (n/4) + n^22. T(n) = T (n/5) + T(4n/5) + n3. T(n) = 3T(n − 1) + n^4 4. T(n) = T (n/2) + n^2
3. Solving RecurrencesGive asymptotic upper and lower bounds for T(n) in each of the following recurrences.Assume that T(n) is constant for n ≤ 2. Make your bounds as tight as possible, andjustify your answers. (1) T(n) = 4T(n/4) + 5n(2) T(n) = 5T(n/4) + 4n(3) T(n) = 25T(n/5) + n2