Find the (a) best-case, (b) worst-case, and (c) average-case number of < comparisons performed by the following pseudocode segment. For parts (a) and (b), tell which values of n produce the best and worst cases. For part (c), assume that all possible values of n are equally likely. Preconditions: n E (5, 10, 15, 20, 25). while n < 17 do n+n+5

Find the (a) best-case, (b) worst-case, and (c) average-case number of < comparisons performed by the following pseudocode segment. For parts (a) and (b), tell which values of n produce the best and worst cases. For part (c), assume that all possible values of n are equally likely. Preconditions: n E (5, 10, 15, 20, 25). while n < 17 do n+n+5

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

8. Solve the following recurrence relations. (16 points) a. T(n) = 4T(n-1) + 1 for n > 1; T(1) = 1; b. T(n) = T(n/2) + 3; T(1) = 1; Here you can assume that n=2k for some integer k.
create a truth table for a. (p^q) V~q b. r =>(p V q)
Question: Suppose we sample m indices from {1, . . . , n} uniformly at random and with repetition. What is theprobability that none of these indices is a correct answer?
Explain how to use a histogram to estimate the size of a selection of the form σA≤v(r).
• Simplify the Boolean functions by means of the tabulation matching method: a. F(w,x,y,z) = Σm(2,3,12,13,14,15) b. P(m,n,o,p,q,r) =Em(6,9,13,18,19,25,27,29,41,45,57,61) c. P(A,B,C,D,E,F,G) =Σm(20,28,38,39,52,60,102,103)
1.Write an efficient algorithm that presents the algorithm methodology by Boyer-Moore string matching algorithm . 2.Derive time efficiency in Best and Worst Cases for the above code.
Classify the 1’s, 2’s, 3’s for the zip code data in R. (a) Use the k-nearest neighbor classiﬁcation with k = 1, 3, 5, 7, 15. Report both the training and test errors for each choice. (b) Implement the LDA method and report its training and testing errors. Note: Before carrying out the LDA analysis, consider deleting variable 16 ﬁrst from the data, since it takes constant values and may cause the singularity of the covariance matrix. In general, a constant variable does not have a discriminating power to separate two classes.
Procedure 1 (Local Search(y) with depth δ) t := 1.While t ≤ δ and ∃z : (H(z,y)=1 and f(z) > f(y)) do y := z. t := t + 1.If there is more than one Hamming neighbor with larger fitness, z may be chosen arbitrarily among them.Algorithm 1 ((1+1) Memetic Algorithm ((1+1) MA)) write correct algorithm otherwise you will get downvote.
Sum of Squared Errors: Remember from your statistics courses that if two random variables X and Y are related by a relation YaX+b and you had a set of observations {(1, 1), (2, 2)..... (z.)). then for every estimated values of a and b, the Sum of Squared Errors (SSE) was defined as in the following formula. SSE(-ar-b)². 1-1 The less SSE, the better a and b are estimated. Consider the following fixed list. In this list each sub-list of length two is standing for one pair (z.). Write a function that recieves two numbers a and b and returns the associated SSE. L- [[1, 2], [1.1, 2], [2, 7.1), (2.5, 7.21, (3, 11]]
From a list of participants’ ids, find which id is missing from the list. The participant ids sorted in ascending order with a certain difference.a. Design your algorithm in pseudocode with the complexity of O (log n)! (PS: use divide and conquer algorithm)b. Do an analysis for your algorithm resulting in an asymptotic notation!c. Prove that your algorithm is correct and create your own input/output for 3 cases, and the minimum number of ids for each case is 15!
Create an algorithm for determining the initial ranking in rank adjustment tournaments.Initial-Rank-Adjustment(P,S) in: set P of n unranked tournament participants; sequence S of m non-negative integers in which Si determines the number of players with the same rank I (m1i=0 Si = n)out: R rated players with the ranking structure S local: M and M player match sequences
Running Time Analysis: Give the tightest possible upper bound for the worstcase running time for each of the following in terms of N. You MUST choose youranswer 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-efficientimplementation is used. Assume no duplicate values and that you can implement theoperation 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 positiveintegers in ascending order. Explanation: c) Finding the minimum value in a binary search tree of size N. Explanation: