Scribd
Upload
2K views3 pages

Quiz - Algorithms: Design and Analysis, Part I

This document is a quiz for an algorithms course, containing 5 multiple choice or ordering questions related to algorithm analysis. The quiz is due on February 11, 2013 at 3:59 PM BNT. The questions cover topics like the time complexity of 3-way merge sort, comparing asymptotic growth rates of functions, k-way merge sort, and ordering functions by growth rate.

Uploaded by

shellnexus
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2K views3 pages

Quiz - Algorithms: Design and Analysis, Part I

This document is a quiz for an algorithms course, containing 5 multiple choice or ordering questions related to algorithm analysis. The quiz is due on February 11, 2013 at 3:59 PM BNT. The questions cover topics like the time complexity of 3-way merge sort, comparing asymptotic growth rates of functions, k-way merge sort, and ordering functions by growth rate.

Uploaded by

shellnexus
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Quiz | Algorithms: Design and Analysis, Part I

2/7/13 11:43 AM

Problem Set-1
The due date for this quiz is Mon 11 Feb 2013 3:59 PM BNT.

Question 1
3-way-Merge Sort : Suppose that instead of dividing in half at each step of Merge Sort, you divide into thirds, sort each third, and finally combine all of them using a three-way merge subroutine. What is the overall asymptotic running time of this algorithm? (Hint: Note that the merge step can still be implemented in O(n) time.)

n(log(n))2 n2 log(n) n n log(n)

Question 2
You are given functions f and should assume that False Sometimes yes, sometimes no, depending on the constant c True Sometimes yes, sometimes no, depending on the functions f and g

g such that f (n) = O(g(n)) . Is

f (n) log2 (f (n)c ) = O(g(n) log2 (g(n))) ? (Here c is some positive constant.) You f and g are nondecreasing and always bigger than 1.

https://class.coursera.org/algo-003/quiz/attempt?quiz_id=21

Page 1 of 3

Quiz | Algorithms: Design and Analysis, Part I

2/7/13 11:43 AM

Question 3
Assume again two (positive) nondecreasing functions

f and g such that

f (n) = O(g(n)) . Is 2f (n) = O(2g(n) ) ? (Multiple answers may be correct, you should
check all of those that apply.) Never Sometimes Yes if

f (n) g(n) for all sufficiently large n

Always

Question 4
k-way-Merge Sort. Suppose you are given

k sorted arrays, each with n elements, and

you want to combine them into a single array of kn elements. Consider the following approach. Using the merge subroutine taught in lecture, you merge the first 2 arrays, then merge the 3 rd given array with this merged version of the first two arrays, then merge the 4 th given array with the merged version of the first three arrays, and so on until you merge in the final (k th ) input array. What is the running time taken by this successive merging algorithm, as a function of faster way to do the k-way merge procedure ?)

k and n? (Optional: can you think of a

(nk) (nk2 ) (n log(k)) (n2 k)

https://class.coursera.org/algo-003/quiz/attempt?quiz_id=21

Page 2 of 3

Quiz | Algorithms: Design and Analysis, Part I

2/7/13 11:43 AM

Question 5
Arrange the following functions in increasing order of growth rate (with g(n) following

f (n) in your list if and only if f (n) = O(g(n)) ).


a)n 2 log(n) b)2 n c)2 2 e)n 2 Write your 5-letter answer, i.e., the sequence in lower case letters in the space provided. For example, if you feel that the answer is a->b->c->d->e (from smallest to largest), then type abcde in the space provided without any spaces before / after / in between the string. You can assume that all logarithms are base 2 (though it actually doesn't matter). WARNING: this question has multiple versions, you might see different ones on different attempts!
n

d)n log(n)

In accordance with the Honor Code, I certify that my answers here are my own work. Save Answers

Submit Answers

https://class.coursera.org/algo-003/quiz/attempt?quiz_id=21

Page 3 of 3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy