Please help me answer Problem 2 Problem 2Find the smallest integer p such that f(n) = O(nº) for each of the followingchoices of the function f. You may assume that n E N. You should explainyour answers but do not need to write formal proofs. You may find it useful toremember that logn & 0(1) and log n ≤ n for all n.1. f(n) = 3n²2. f(n) = log n3. f(n) = n²log nlog n4. f(n) ==5. f(n)=nn³+2n²_n-1

As per our company guidelines, only three sub parts will be answered at a time. So, please repost…

Problem 2 Find the smallest integer p such that f(n) = O(n²) for each of the following choices of the function f. You may assume that n€ N. You should explain your answers but do not need to write formal proofs. You may find it useful to remember that log n ‡ 0(1) and log n ≤ n for all n. 1. f(n) = 3n² 2. f(n) = log n 3. f(n) = n²log n

Problem 2 Find the smallest integer p such that f(n) = O(n²) for each of the following choices of the function f. You may assume that n€ N. You should explain your answers but do not need to write formal proofs. You may find it useful to remember that log n ‡ 0(1) and log n ≤ n for all n. 1. f(n) = 3n² 2. f(n) = log n 3. f(n) = n²log n

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

Let N = {0, 1, 2, . . .} be the set of Natural Numbers. Given an n ∈ N, which of the followingconditions are necessary, and which of these conditions are sufficient, for the Natural Number,n, to be a factor of 10.(a) 1 is a factor of n.(b) 1 is a factor of 2n.(c) −n is a factor of 10.(d) 10 is a multiple of n.(e) n is divisible by 2.(f) n^2 is divisible of 5.(g) n = 10.
1: Given a fixed integer B (B ≥ 2), we demonstrate that any integer N (N ≥ 0) can bewritten in a unique way in the form of the sum of p+1 terms as follows:N = a0 + a1×B + a2×B2 + … + ap×Bpwhere all ai, for 0 ≤ i ≤ p, are integer such that 0 ≤ ai ≤ B-1.The notation apap-1…a0 is called the representation of N in base B. Notice that a0 is theremainder of the Euclidean division of N by B. If Q is the quotient, a1 is the remainder of theEuclidean division of Q by B, etc.1. Write an algorithm that generates the representation of N in base B. 22. Compute the time complexity of your algorithm.
Let f (n) and g(n) be functions with domain {1, 2, 3, . . .}. Prove the following: If f(n) = O(g(n)), then g(n) = Ω(f(n)).
Analyze the running time (i.e. T(n)) of these functions. You should be able to find some simple function f(n) such that T(n) O(f(n)). You should show your work and rigorously justify your an- 1. swer.
Determine whether the proposed definition isa valid recursive definition of a function f from the setof nonnegative integers to the set of integers. If f is welldefined, find a formula for f(n) when n is a nonnegativeinteger and prove that your formula is valid. f(0) = 1, f(n) = −f(n − 1) for n ≥ 1
Show that the following argument is valid for any natural number n ∈N. p1 →p2 p2 →p3 ... pn−1 →pn ¬pn ∴¬(p1 ∨···∨pn−1................
Let ƒ : Z → Z be some function over the integers. Select an appro- priate proof technique (direct, contradiction, induction, invariant or pigeonhole), and prove that if you have: a, f(a), ƒ(f(a)), ƒ(f(f(a))) and f(f(f(f(@)))), then at least 2 of those numbers are equivalent modulo 4.
Note: For all integers k,n it is true that kn, k+n, and k-n are integers. An integer k is even if and only if there exists an integer r such that k=2r. An integer k is odd if and only if there exists an integer r such that k=2r+1. For every integer k it is true that if k is even then k is not odd. For every integer k it is true that if k is odd then k is not even. For every integer k it is true that if k is not even then k is odd. For every integer k it is true that if k is not odd then k is even. If P then Q means the same thing as P → Q (P implies Q). 3. Consider the argument form pvr .. p→r Is this argument form valid? Prove that your answer is correct. 4. Prove that for every integer d, if d³ is odd then d is odd.
Practice Exercise #3: For each of the following recurrences, give an expression for the runtime T (n) if the recurrence can be solved with the Master Theorem. Otherwise, indicate that the Master Theorem does not apply. 1. T(n) = T + 2⁰ 2. T(n) = √2T) + logn 3T (+2 3. T(n) = 4. T(n) = 64T() -n²logn
f(n) = O(f(n)g(n)) Indicate whether the below is true or false. Explain your reasoning. For all functions f(n) and g(n):
6. Suppose functions f(n) > 0 and g(n) > 0 satisfy f(n) = 0(9(n)). Prove or give a counterexample to each of the following. (a) log, f(n) = O(log, 9(n)). To avoid an obscure special case, assume that g(n) > 2 for all n. (b) 2/(n) = 0(29(n)) %3D %3D (c) (f(n))² = 0(g(n))")
We want to prove that f(n) = 1/n² +8√n + 1 is O(n²) using the formal definition introduced in class (i.e f(n) is O(g(n)) if there are two constant c and no such that f(n) ≤ c · g(n) for all n ≥ no). Which of the following pair(s) of constants c and no satisfy the definition? C = and no = C = 21 2 C = 19 and no 2 R 1/2 and no c = 10 and no = 1000 P = A. TA B 0 Consider the string s="BARBAPAPA". Which of the following trees is/are representing the optimal prefix codes obtained by the Huffman Algorithm? (Reminder: an edge to the left child encodes a 0, while an edge to the right child encodes a 1). 1 = = 4 A A 101010110110 10101001010110110 01100001100110011 R B 100001100011001100 B. TB P A) (R B P C. Tc A Using the codes from above, which of the following bit strings are valid encoding of s using Huffman Encoding? B R P D. Tp