Let m be a randomly chosen non-negative integer having at most n decimal digits, i.e. an integer in the range 0 sms 10" – 1. Consider the following problem: determine m by asking only 5- way questions, i.e. questions with at most 5 possible responses. For instance, one could ask which of 5 specific sets m belongs to. Prove that any algorithm restricted to such questions, and which correctly solves this problem, runs in time 0(n).

Let m be a randomly chosen non-negative integer having at most n decimal digits, i.e. an integer in the range 0 sms 10" – 1. Consider the following problem: determine m by asking only 5- way questions, i.e. questions with at most 5 possible responses. For instance, one could ask which of 5 specific sets m belongs to. Prove that any algorithm restricted to such questions, and which correctly solves this problem, runs in time 0(n).

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

Write the algorithm for the problem that works in constant space and time complexity. Input: N OUTPUT: 1 if Tom wins, 0 if Jerry wins.
Suppose that f (n) = 0(g(n)) and f(n) = 0(h(n)), then it is ( always / sometimes / never ) the case that g(n) = 0(h(n)).
Roses 1 2 3 4 5 Profit $5 $15 $24 $30 $35 For each positive integer n, let f(n) be the maximum profit that Flora can make with n roses.For example, if n = 10, Flora can make numerous bouquet combinations, including two 5-rose bouquets (total profit of $70), and a 4-rose bouquet with three 2-rose bouquets (total profit of $75). Provide two different algorithms for calculating f(n): one using Recursion, and one using Dynamic Programming. Explain why both algorithms are guaranteed to return the correct value of f(n).
For the problem, give pseudocode for your solution, and remember to include a proof of correctness and runtime. Note that in general, faster algorithms will receive more credit, so a brute force O(n 2 ) algorithm will not get many points if there is a faster O(n) or O(n log n) alterative. In IR2 , we define a slab to be a pair of parallel lines. Given a set of points P in IR2 , find the narrowest slab containing P, where the width of the slab is the vertical distance between its bounding lines.
Another recursive algorithm is applied to some data A = (a₁, ..., am) where m = 2* (i.e. 2, 4, 8,16 ...) where x is an integer ≥ 1. The running time T is characterised using the following recurrence equations: T(1) = c when the size of A is 1 T(m) = 2T (2) + c otherwise Determine the running time complexity of this algorithm.
Write a recurrence for this algorithm and solve it to obtain a tight upper bound on the worst case runtime of this algorithm. You can use any method you like for solving this recurrence.
Consider an n by n matrix, where each of the n2 entries is a positive integer. If the entries in this matrix are unsorted, then determining whether a target number t appears in the matrix can only be done by searching through each of the n2 entries. Thus, any search algorithm has a running time of O(n²). However, suppose you know that this n by n matrix satisfies the following properties: • Integers in each row increase from left to right. • Integers in each column increase from top to bottom. An example of such a matrix is presented below, for n=5. 4 7 11 15 2 5 8 12 19 3 6 9 16 22 10 13 14 17 24 1 18 21 23 | 26 | 30 Here is a bold claim: if the n by n matrix satisfies these two properties, then there exists an O(n) algorithm to determine whether a target number t appears in this matrix. Determine whether this statement is TRUE or FALSE. If the statement is TRUE, describe your algorithm and explain why your algorithm runs in O(n) time. If the statement is FALSE, clearly explain why no…
Suppose that, in a divide-and-conquer algorithm, we always divide an instance of size n of a problem into 10 subinstances of size n/3, and the dividing and combining steps take a time in Θ(n 2) . Write a recurrence
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you fill in the values is the correct one. Notice how it is a lot easier to analyze the running time of…
There are n people who want to carpool during m days. On day i, some subset si ofpeople want to carpool, and the driver di must be selected from si . Each person j hasa limited number of days fj they are willing to drive. Give an algorithm to find a driverassignment di ∈ si each day i such that no person j has to drive more than their limit fj. (The algorithm should output “no” if there is no such assignment.) Hint: Use networkflow.For example, for the following input with n = 3 and m = 3, the algorithm could assignTom to Day 1 and Day 2, and Mark to Day 3. Person Day 1 Day 2 Day 3 Limit 1 (Tom) x x x 2 2 (Mark) x x 1 3 (Fred) x x 0
Input: An odd integer B, and a set A= {a_1, . .. , a_2n} of 2n distinct positive integers. Question: Decide whether A can be partitioned inton disjoint pairs (a_i, a_j), where 1 s i
We want to determine whether an unsorted array A of n entries has duplicates. These integers are 1,..., 2n. Give this solution's worst-case running time asymptotic order T(n). Find an efficient algorithm.