Reference no: EM13844158
1. Consider a sorted list L of n integers, each of which must be distinct (that is, the list contains no duplicates). L may contain negative elements. Give an algorithm (describe in English, and then give pseudo-code) that finds all indicies i such that L[i] = i. Your algorithm should run in O(lg n + k) time, where k is the number of elements i such that L[i] = i.
2. In Randomized-Quicksort of a list of length n, what is the largest number of times that RANDOM will be called? What is the smallest possible number of times that RANDOM will be called? Be as exact as possible.
3. Consider the following sorting algorithm:
TripleSort(A, low, high)
if (high > low)
if (high == low + 1)
if (A[low] > A[high])
swap A[low] ↔ A[high]
else
mid1 ← d(low + high) / 3e
mid2 ← b 2 * (low + high) / 3 c
TripleSort(A, low, mid2)
TripleSort(A, mid1, high)
TripleSort(A, low, mid2)
(a) Does this sorting algorithm correctly sort all lists? Explain why, or give a counter-example.
(b) Is this sorting algorithm stable? Explain your answer for full credit
(c) Give a recurrence relation for the running time of TripleSort, solve it to provide a tight (Θ()) bound.
4. The quicksort PARTITION procedure divides returns an index q such that each element of A[p..q - 1] is less than or equal to q, and each element of A[q + 1..r] is greater than A[q]. Modify the partition procedure to produce a procedure PARITION'(A,p,r) which returns two indices q and t. where p ≤ q ≤ t ≤ r, such that:
• All elements of A[q..t] are equal
• All elements of A[p..q - 1] are less than A[q]
• All elements of A[t + 1..r] are greater than A[q]
Give pesudo-code for PARTITION'. You can assume that a function can return two values a and b with return (a,b). For full credit, your algorithm must take time Θ(n) and extra space (beyond the actual array) Θ(1).
5. Which of the following sorting algorithms are stable: insertion, merge, heap, quick. Give a simple scheme that makes any sorting algorithm stable. How much additional time does your sorting algorithm require?
|
Analysis of the organization
: Analysis of the organization, Describe the organization's: Facility physical settings, Patient or client base, Level of clinical activity, Organization structure
|
|
The lower breakeven and greater profit potential
: Consider two put options differing only by exercise price. The one with the higher exercise price has Select one: a. the lower breakeven and lower profit potential b. the lower breakeven and greater profit potential c. the higher breakeven and gre..
|
|
Discuss types of sources a company can use to raise capital
: Discuss the types of sources a company can use to raise capital. Do these different sources of capital have different costs? Why or why not?
|
|
Compare and contrast how you would expect nursing leaders
: Select an issue from the following list: nursing shortage and nurse turn-over, nurse staffing ratios, unit closures and restructuring, use of contract employees (i.e., registry and travel nurses), continuous quality improvement and patient satisfa..
|
|
Largest number of times
: In Randomized-Quicksort of a list of length n, what is the largest number of times that RANDOM will be called? What is the smallest possible number of times that RANDOM will be called? Be as exact as possible.
|
|
What decision does the expected value approach recommend
: What decision does the expected value approach recommend and what is your indifference probability for the $0.00 payoff?
|
|
Which of cash flows would be included in capital budgeting
: If the Felicia & Fred decide to purchase the building, which of the above cash flows would be included in the capital budgeting analysis? If the company decided not to purchase the building, how would your answer change?
|
|
Estimate the probability that it is private insurance
: Estimate the probability that it is private insurance
|
|
Describe an example of a psychic prison
: Describe an example of a "psychic prison" you or a colleague have experienced in your organization or one with which you are familiar
|