= 10^6 μs 1m = 60 x 1s log n Vn nlogn n² 2. For each function f(n) and time t in the following table, determine the largest size n of a problem that can be solved in time t, assuming that the algorithm to solve the problem takes f(n) microseconds. n³ 2n n! 1hr = 60 x 1m 1 day = 24 x 1hr 1 second 1 minute 1 hour 1 month = 28 x 1 day 1 day 1 month 1 year = 12 x 1 month 1 year 1 century 100 x 1 year 1 century

= 10^6 μs 1m = 60 x 1s log n Vn nlogn n² 2. For each function f(n) and time t in the following table, determine the largest size n of a problem that can be solved in time t, assuming that the algorithm to solve the problem takes f(n) microseconds. n³ 2n n! 1hr = 60 x 1m 1 day = 24 x 1hr 1 second 1 minute 1 hour 1 month = 28 x 1 day 1 day 1 month 1 year = 12 x 1 month 1 year 1 century 100 x 1 year 1 century

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's say there are n villages, {X1, . . . , Xn} on the country-road and we aim to build K < n restaurants to cover them. Each restaurant has to be built in a village, and we hope to minimize the average distance from each village to the closest restaurant. Please give an algorithm to compute the optimal way to place these K restaurants. The algorithm should run in O(k * n^2) time. Solutions with slightly higher time complexity also accepted.
For a given problem with inputs of size n, algorithms running time,one of the algorithm is o(n), one o(nlogn) and one o(n2). Some measured running times of these algorithm are given below: Identify which algorithm is which and explain the observed running Times which algorithm would you select for different value of n?
For function f(n)=log n and time t=1 second, determine the largest size n of a problem that can be solved in time t, assume that the algorithm to solve the problem takes f(n) microseconds.
There are n different sizes of boxes, from 1 to n. There is an unlimited supply of boxes of each size t, each with a value vt . A box of size t can hold several smaller boxes of sizes a1, a2, . . . , ak as long as the sum of sizes a1 + a2 + . . . + ak is strictly less than t. Each of these boxes may be filled with yet more boxes, and so on. Design an algorithm which runs in O(n2 ) time and finds the maximum value that can be attained by taking one box, potentially with smaller boxes nested inside it.
Assume that each of the expressions below gives the processing time T(n) spent by an algorithm for solving a problem of size n. Select the dominant term(s) having the steepest increase in n and specify the lowest Big-Oh complexity of each algorithm. For example, the dominant term in 0.1n + 10n4 is 10n4 and it is O(n4). Expression Dominant term(s) O(. . .) 5 + 0.001n3 + 0.025n 500n + 100n1.5 + 50n log10 n 0.3n + 5n1.5 + 2.5 · n1.75 n2 log2 n + n(log2 n)2 n log3 n + n log2 n 100n + 0.01n2 0.01n + 100n2 2n + n0.5 + 0.5n1.25 0.01n log2 n + n(log2 n)2 100n log3 n + n3 + 100n
Consider the following bridge crossing problem where n people with speeds s1, ··· , sn wish to cross the bridge as quickly as possible. The rules remain: • It is nighttime and you only have one flashlight. • A maximum of two people can cross at any one time • Any party who crosses, either 1 or 2 people must have the flashlight with them. • The flashlight must be walked back and forth, it cannot be thrown, etc. • A pair must walk together at the rate of the slower person’s pace. Give an efficient algorithm to find the fastest way to get a group of people across the bridge. You must have a proof of correctness for your method.
Subject: Theory of Computation Design a brute-force algorithm for solving this problem (below) and demonstrate that this algorithm's time complexity grows exponentially with input length. Adding 2 binary numbers, w is the length of the input which is the number of digits in the numbers. Suppose the input has the same number of digits
Suppose there is a circle. There are n petrol pumps on that circle. You are given two sets ofdata.1. The amount of petrol that every petrol pump has.2. Distance from that petrol pump to the next petrol pump.Calculate the first point from where a truck will be able to complete the circle (The truck willstop at each petrol pump and it has infinite capacity). Expected time complexity is O(n). Assumefor 1 liter petrol, the truck can go 1 unit of distance.For example, let there be 4 petrol pumps with amount of petrol and distance to next petrolpump value pairs as {4, 6}, {6, 5}, {7, 3} and {4, 5}. The first point from where truck can make acircular tour is 2nd petrol pump. Output should be “start = 1” (index of 2nd petrol pump) note: use C++ with DSA concepts
The algorithm of Euclid computes the greatest common divisor (GCD) of two integer numbers a and b. The following pseudo-code is the original version of this algorithm. Algorithm Euclid(a,b)Require: a, b ≥ 0Ensure: a = GCD(a, b) while b ̸= 0 do t ← b b ← a mod b a ← tend whilereturn a We want to estimate its worst case running time using the big-Oh notation. Answer the following questions: a. Let x be a integer stored on n bits. How many bits will you need to store x/2? b. We note that if a ≥ b, then a mod b < a/2. Assume the values of the input integers a and b are encoded on n bits. How many bits will be used to store the values of a and b at the next iteration of the While loop? c. Deduce from this observation, the maximal number iterations of the While loop the algorithm will do.
The factorial function f(n) = n! is defined by n! = 1 2 3... n whenever n is a positive integer, and O! = 1. Provide big-O estimates for the factorial function and the logarithm of the factorial function. As an illustration, 1! = 1, 2! = 1 2=2, 3! = 1 23 = 6, and 4! = 1 234=24.Take note of how quickly the function n! expands. Consider the following: 20! = 2,432,902,008,176,640,000.
You are given a collection of n bolts of different widths and n corresponding nuts. Youare allowed to try a nut and bolt together, from which you can determine whether thenut is larger than the bolt, smaller than the bolt, or matches the bolt exactly. However,there is no way to compare two nuts together or two bolts together. The problem isto match each bolt to each nut. Design an algorithm for this problem with Θ(n log n) average-case complexity (in terms of nut-bolt comparisons). Explain why your algorithm has Θ(n log n) average-case complexity. You may use any result given in class without explicitly solving recurrence equations. I know that one can use Quicksort to get nlogn but I just don't know how to implement it. Thank you so much.
Small witnesses are easy to findThe definition of NP requires that the number of bits of the witness is at most polynomialin the number of bits of the input, i.e., |w| = poly(n). Suppose a decision problemA ∈ NP has the property that witnesses, when they exist, are at most logarithmic size,i.e., |w| = O(log n). Show that this implies A ∈ P.