- Premium Academic Help From Professionals
- +1 323 471 4575
- support@crucialessay.com

## Algorithm Complexity Analysis Assignment

Order ID# 45178248544XXTG457Plagiarism Level: 0-0.5%Writer Classification: PhD competentStyle: APA/MLA/Harvard/ChicagoDelivery: Minimum 3 HoursRevision: PermittedSources: 4-6Course Level: Masters/University CollegeGuarantee Status: 96-99%

InstructionsAlgorithm Complexity Analysis Assignment

Name:

Homework 1

Assignment Place your answers directly under each question below — do not delete the questions.

Part 1: Algorithm Complexity Analysis

1) Give the big-Oh characterization, in terms of n, of the running time of the pseudocode loops shown below: (3 pts each)

- a) x 1
for i 1 to 8n do

x x * i

- b) b 1
while n > 0 do

b b + (5 * n)

n n / 2

- c) s 0
for i 1 to 2n do

for j 1 to i do

s s + i

- d) k 0
for i 1 to n2 do

for j 1 to 5n do

k k + i

2) Complete problem C1.5 on page 45 of your textbook (6 pts)

Show ALL math conversion steps.

3) Given the following functions, determine the big-O notation for each (3 pts each)

Hint: Use the rules given in the textbook.

- a) f(n) = 500n2 + 50n3 + 5n
- b) f(n) = 5n log n + 888n
- c) f(n) = 33n2 + 5n2 + 1000n2
- d) f(n) = 8n3 + 2n + 44n2
4) Consider the following algorithm (shown with line numbers) that finds the maximum element in an array of positive integers.

1: int findMaxElement(int nums[], int N) {

2: int i, maxNum;

3: maxNum = −1;

4: for (i = 0; i < N; i++)

5: if (nums[i] > maxNum)

6: maxNum = nums[i];

7: return maxNum;

8: }

You can assume all elements are unique and that each occurs with equal probability.

- a) Best case
- Describe the best case data for this algorithm. (2 pts)
- Then, for this best case, state how often is line 6 executed. (2 pts)
- b) Worst case
- Describe the worst case data for this algorithm. (2 pts)
- For this worst case, state how often is line 6 executed. (2 pts)
5) Suppose that for the worst case, given input size n:

Algorithm 1 does f(n) = n2 + 4n steps

Algorithm 2 does f(n) = 45n + 10 steps

For what input sizes is algorithm 1 faster than algorithm 2, in the worst case? (4 pts)

6) Given the following ordered array: (5 pts each)

[0] 2 [1] 4 [2] 7 [3] 9 [4] 22 [5] 36 [6] 44 [7] 67 [8] 68 [9] 71 [10] 83 [11] 85 [12] 88 [13] 90 [14] 94 [15] 99

- a) Using the binary search algorithm to search for the target value 88
For each pass, list the high and low index, and the calculated middle index.

Finally, state what causes the search to stop, and the result of the search.

- b) Using the binary search algorithm to search for the target value 60
For each pass, list the high and low index, and the calculated middle index.

Finally, state what causes the search to stop, and the result of the search.

7) Given the following recursive method:

public static int recurMethod (int num1, int num2) {

if (num1 < num2)

return num2;

else

return (num1 – num2) + recurMethod(num1 – 3, num2 + 5);

}

If the initial call is:

int result = recurMethod (50, 30);

- a) List each recursive call going forward (3 pts)
- b) List the value returned from each call, and the final result. (5 pts)
8) Assume you have a 20-element hash table that uses the hash function: H(key) = key mod 20 and quadratic probing to resolve collisions. If the following keys were inserted into the hash table, in the order shown: 39, 59, 23, 40, 79 where will each be placed (i.e. at what index)? SHOW how you got your answers. (8 pts)

9) Begin with an empty binary search tree. (5 pts)

Insert the following keys, in the given order:

43, 30, 40, 12, 65, 86, 71, 33, 95, 88, 35 Draw the resulting tree.

10) Starting with the binary search tree shown below. (5 pts each)

45

77

19

12

52

55

46

82

68

33

15

35

24

22

28

- a) List the order the nodes will be visited, using pre-order traversal.
- b) List the order the nodes will be visited, using post-order traversal.
- c) Deletion algorithms either use the left subtree or right subtree to find the node to replace the deleted node (must use same choice for all deletions ). State which subtree you will use .
Then show the resulting tree, after delete nodes 55, 52, 19, 77, 45, in that order.

11) Complete problem A1.8 on page 49 of your textbook (8 pts)

Present the algorithm in pseudocode and then explain the runtime of the algorithm.

Do not use any built-in code library methods in your solution.

12) Compare and contrast some of the previously studied data structures:

Hash tables

Binary trees

Discuss advantages and disadvantages of each, in terms of the time it takes to add and delete elements within the data structure, and the memory required for the data structure. (5 pts)

Submission

This homework assignment is due by midnight of the date listed on the Course Assignments by Week page of the Content.

- Before you submit your homework, append your last name to the front of the Word doc filename. For examples: SmithCS324-Hwk1.docx
- Submit your .docx file to the Hwk Assn 1 Submission Folder (located under Assignments tab in online course

RUBRIC

Excellent Quality95-100%

Introduction45-41 points

The background and significance of the problem and a clear statement of the research purpose is provided. The search history is mentioned.

Literature Support91-84 points

The background and significance of the problem and a clear statement of the research purpose is provided. The search history is mentioned.

Methodology58-53 points

Content is well-organized with headings for each slide and bulleted lists to group related material as needed. Use of font, color, graphics, effects, etc. to enhance readability and presentation content is excellent. Length requirements of 10 slides/pages or less is met.

Average Score50-85%

40-38 points

More depth/detail for the background and significance is needed, or the research detail is not clear. No search history information is provided.

83-76 points

Review of relevant theoretical literature is evident, but there is little integration of studies into concepts related to problem. Review is partially focused and organized. Supporting and opposing research are included. Summary of information presented is included. Conclusion may not contain a biblical integration.

52-49 points

Content is somewhat organized, but no structure is apparent. The use of font, color, graphics, effects, etc. is occasionally detracting to the presentation content. Length requirements may not be met.

Poor Quality0-45%

37-1 points

The background and/or significance are missing. No search history information is provided.

75-1 points

Review of relevant theoretical literature is evident, but there is no integration of studies into concepts related to problem. Review is partially focused and organized. Supporting and opposing research are not included in the summary of information presented. Conclusion does not contain a biblical integration.

48-1 points

There is no clear or logical organizational structure. No logical sequence is apparent. The use of font, color, graphics, effects etc. is often detracting to the presentation content. Length requirements may not be met

You Can Also Place the Order at www.perfectacademic.com/orders/ordernow or www.crucialessay.com/orders/ordernow NEW TEMPLATE OPTIMIZED RANK MATH

NEW TEMPLATE OPTIMIZED RANK MATH

error: Content is protected !!

Open chat

You can contact our live agent via WhatsApp! Via our number +1 323 471 4575.

Feel Free To Ask Questions, Clarifications, or Discounts, Available When Placing the Order.