程序代写案例-CS 344

  • February 8, 2021

Only for the personal use of students registered in CS 344, Spring 2021 at Rutgers University. Redistribution out of this class is strictly prohibited. CS 344: Design and Analysis of Computer Algorithms Rutgers: Spring 2021 Homework #1 Deadline: Monday, February 8, 11:59 PM Homework Policy • If you leave a question completely blank, you will receive 25% of the grade for that question. This however does not apply to the extra credit questions. • You are allowed to discuss the homework problems with other students in the class. But you must write your solutions independently. You may also consult all the materials used in this course (video recordings, notes, textbook, etc.) while writing your solution, but no other resources are allowed. • Do not forget to write down your name and whether or not you are using one of your two extensions. Submit your homework on Canvas. • Unless specified otherwise, you may use any algorithm covered in class as a “black box” – for example you can simply write “sort the array in Θ(n log n) time using merge sort”. • Remember to always prove the correctness of your algorithms and analyze their running time (or any other efficiency measure asked in the question). See “Practice Homework” for an example. • The “Challenge yourself” and “Fun with algorithms” are both extra credit. These problems are significantly more challenging than the standard problems you see in this course (including lectures, homeworks, and exams). As a general rule, only attempt to solve these problems if you enjoy them. Problem 1. This question reviews asymptotic notation. You may assume the following inequalities for this question (and throughout the course): For any constant c ≥ 1, (log n)c = o(n) , nc = o(nc+1) , cn = o((c + 1)n) , (n/2)(n/2) = o(n!) , n! = o(nn). (a) Rank the following functions based on their asymptotic value in the increasing order, i.e., list them as functions f1, f2, f3, . . . , f9 such that f1 = O(f2), f2 = O(f3), . . . , f8 = O(f9). Remember to write down your proof for each equation fi = O(fi+1) in the sequence above. (15 points)√ log n log log n 2logn 100n 10n 22 22 2 2n n! n log n Hint: For some of the proofs, you can simply show that fi(n) ≤ fi+1(n) for all sufficiently large n which immediately implies fi = O(fi+1). (b) Consider the following four different functions f(n): 1 log n n2 44 n . For each of these functions, determine which of the following statements is true and which one is false. Remember to write down your proof for each choice. (10 points) 1 Only for the personal use of students registered in CS 344, Spring 2021 at Rutgers University. Redistribution out of this class is strictly prohibited. • f(n) = Θ(f(n− 1)); • f(n) = Θ(f(n2 )); • f(n) = Θ(f(√n)); Example: For the function f(n) = 44 n , we have f(n− 1) = 44n−1 . Since 44n−1 = 4 14 ·4n = (44n)1/4. lim n→∞ f(n) f(n− 1) = limn→∞ 44 n 44n−1 = lim n→∞ 44 n (44n)1/4 = lim n→∞(4 4n)3/4 = +∞. As such, f(n) 6= O(f(n− 1)) and thus the first statement is false for 44n . Problem 2. Your goal in this problem is to analyze the runtime of the following (imaginary) recursive algorithms for some (even more imaginary) problem: (A) Algorithm A divides an instance of size n into 4 subproblems of size n/4 each, recursively solves each one, and then takes O(n) time to combine the solutions and output the answer. (B) Algorithm B divides an instance of size n into 2 subproblems, one with size n/4 and one with size n/5, recursively solves each one, and then takes O(n) time to combine the solutions and output the answer. (C) Algorithm C divides an instance of size n into 4 subproblems of size n/3 each, recursively solves each one, and then takes O(n2) time to combine the solutions and output the answer. (D) Algorithm D divides an instance of size n in to 2 subproblems of size n − 1 each, recursively solves each one, and then takes O(1) time to combine the solutions and output the answer. For each algorithm, write a recurrence for its runtime and use the recursion tree method of Lecture 3 to solve this recurrence and find the tightest asymptotic upper bound on runtime of the algorithm. (25 points) Problem 3. In this problem, we consider a non-standard sorting algorithm called the Silly Sort. Given an array A[1 : n] of n integers, the algorithm is as follows: • Silly-Sort(A[1 : n]): 1. If n < 5, run merge sort (or selection sort or insertion sort) on A. 2. Otherwise, run Silly-Sort(A[1 : 3n/4]), Silly-Sort(A[n/4 : n]), and Silly-Sort(A[1 : 3n/4]) again. We now analyze this algorithm. (a) Prove the correctness of Silly-Sort. (10 points) (b) Write a recurrence for Silly-Sort and use the recursion tree method of Lecture 3 to solve this recurrence and find the tightest asymptotic upper bound on the runtime of Silly-Sort. (10 points) (c) Suppose we like to change the second line of the algorithm to Silly-Sort(A[1 : m]), Silly-Sort(A[n−m : n]), and Silly-Sort(A[1 : m]) for some other value of m instead (in the original algorithm, m = 3n/4). What is the smallest number we could pick while still maintaining the correctness of the algorithm? What would be the runtime of the resulting algorithm? For this part of the question, you can simply write a few lines for proof of correctness and runtime analysis by pointing out how your proofs and calculations in parts (a) and (b) should be changed. (5 points) 2 Only for the personal use of students registered in CS 344, Spring 2021 at Rutgers University. Redistribution out of this class is strictly prohibited. Problem 4. You are given an array A[1 : n] which includes the scores of n players in a game. They are ranked in the following way: Rank of a player is an integer r if there are exactly r− 1 distinct scores strictly smaller than the score of this player (irrespective of the number of players). (a) Design and analyze an algorithm that given the array A, can find the rank of all players in the array in O(n log n) time. (15 points) Example. Suppose the input array is A = [1, 7, 6, 5, 2, 4, 5, 2] for 8 players; then the rank of players is: • Player A[1] has rank 1 (as A[1] = 1 is the smallest number); • Player A[2] has rank 6 (as A[2] = 7 has 5 distinct smaller numbers: {1, 6, 5, 4, 2}); • Player A[3] has rank 5 (as A[3] = 6 has 4 distinct smaller numbers: {1, 5, 4, 2}); • Player A[4] has rank 4 (as A[4] = 5 has 3 distinct smaller numbers: {1, 4, 2}); • Player A[5] has rank 2 (as A[5] = 2 has 1 distinct smaller number: {1}); • Player A[6] has rank 3 (as A[6] = 4 has 2 distinct smaller numbers: {1, 2}); • Player A[7] has rank 4 (as A[7] = 5 has 3 distinct smaller numbers: {1, 4, 2}); • Player A[8] has rank 2 (as A[8] = 2 has 1 distinct smaller number: {1}); (b) Suppose you are additionally given an array B[1 : m] with the score of m new players. Design and analyze an algorithm that given both arrays A and B, can find the rank of each player B inside the array A, i.e., for each B[i], determines what would be the rank of B[i] in the array consisting of all elements of A plus B[i]. Your algorithm should run in O((n + m) · log n) time. (10 points) Example. Suppose the input array is A = [1, 7, 6, 5, 2, 4, 5, 2] as before and B = [3, 9, 4]; then the correct answer for each player in B is: • Player B[1] will have rank 3 (as B[1] = 3 has 2 distinct smaller numbers in A: {1, 2}); • Player B[2] will have rank 7 (as B[2] = 9 has 6 distinct smaller numbers in A: {1, 7, 6, 5, 4, 2}); • Player B[3] will have rank 3 (as B[3] = 4 has 2 distinct smaller numbers in A: {1, 2}); Challenge Yourself. Let us revisit the community detection problem but with an interesting twist. Re- member that we have a collection of n people for some odd integer n and we know that strictly more than half of them belong to a hidden community. As before, when we introduce two people together, the members of the hidden community would say they know the other person if they also belong to the community, and otherwise they say they do not know the other person. The twist is now as follows: the people that do not belong to the community may lie, meaning that they may decide to say they know the other person even though in reality only people inside the hidden community know each other. Concretely, suppose we introduce two people A and B, then what they will say would be one of the following (first part of tuple is the answer of A and second part is the answer of B): • if both belong: (know , know); • if A belongs and B does not: (does not know , know/does not know); • if B belongs and A does not: (know/does not know , does not know); • if neither belongs: (know/does not know , know/does not know); Design an algorithm that finds all members of the hidden community using O(n) greetings. (+10 points) 3 Only for the personal use of students registered in CS 344, Spring 2021 at Rutgers University. Redistribution out of this class is strictly prohibited. Fun with Algorithms. We have an n-story building and a series of magical vases that work as follows: there is some unknown level L in the building that if we throw these vases down from any of the levels L,L + 1, . . . , n, they will definitely break; however, no matter how many times we throw the vases down from any level below L nothing will happen them. Our goal in this question is to determine this level L by throwing the vases from different levels of the building (!). For each of the scenarios below, design an algorithm that uses asymptotically the smallest number of times we throw a vase (so the measure of efficiency for us is the number of vase throws). (a) When we have only one vase. Once we break the vase, there is nothing else we can do. (+2 points) (b) When we have four vases. Once we break all four vases, there is nothing else we can do. (+4 points) (c) When we have an unlimited number of vases. (+4 points) 4 欢迎咨询51作业君

LATEST POSTS
MOST POPULAR

ezAce多年来为广大留学生提供定制写作、留学文书定制、语法润色以及网课代修等服务,超过200位指导老师为您提供24小时不间断地服务。