![Suppose the following array was created by heapDown during the heap creation part of the He 87 48 71 4015 [14 pts] Show the array as a tree. Show all the changes in the tree/array during the sort part Heapsort. a. 87](http://img.homeworklib.com/questions/85d45b00-b722-11eb-8f7a-cb687847ce8c.png?x-oss-process=image/resize,w_560)
Homework Answers
Add Answer to:
Suppose the following array was created by heapDown during the heap creation part of the He...
NOTE: Completing the Third Chart is the most important. This is one question with three parts. (4 pts) Is the following array-based tree a min-heap or a max-heap or not a heap at all? 85 91 S8 95 1...
NOTE: Completing the Third Chart is the most
important. This is one question with three parts.
(4 pts) Is the following array-based tree a min-heap or a max-heap or not a heap at all? 85 91 S8 95 100 92 a. Min-heap b. Max-heap c. Not a heap 5 pts) Turn the following array-based binary tree into a max-heap. Show your work step by step. (You will not need all the columns) 34 7 12 47 19 5 pts) Show...
1. Consider an array of size eight with the numbers in the following order 40, 20,...
1. Consider an array of size eight with the numbers in the following order 40, 20, 80, 60, 30, 10, 70, 50. (a) What is the array after heap creation? Make sure to form the heap bottom up as done in class. How many comparisons does the algorithm use? (b) Show the array after each element sifts down during the remainder of heapsort, and state how many comparisons each sift takes. What is the total number of comparisons for the...
QUESTION 16 Show the first pass of sorting the following array-based binary tree max-heap. In other...
QUESTION 16 Show the first pass of sorting the following array-based binary tree max-heap. In other words, show the first step in sorting, then re-heap the remaining tree into a max-heap. For answers that are not used, put null. You may use scratch paper to draw the trees if you wish. (You will not need all the columns)
(c) Draw the binary heap structure that is equivalent to the following list (the root is...
(c) Draw the binary heap structure that is equivalent to the following list (the root is first element). [5, 9, 8, 12, 15, 11, 19, 14, 20, 18, 17, 13] [4 marks] (d) Show the resulting tree after the value 6 is added to the heap in the part (c). Note that the binary heap properties must be restored after insertion. Show your working; you may show the data structure in tree or array form. [3 marks]
Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60,...
Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers keys in post-order - Retrieve the integers keys in pre-order - Draw a binary search tree after node 58 is deleted b) Create a Hash Table using the methods described below. Show the final array after all integer keys are inserted. Assumes that...
Question 3. a. Draw the binary min heap represented by the following array: (5 points) 1...
Question 3. a. Draw the binary min heap represented by the following array: (5 points) 1 2 4 6 7 Value 4 9 12 29 17 14 16 b. Show the result of calling deleteMin twice on the heap you drew in part (a). Show the heap after each deleteMin, and circle the final heap. (5 points) c. Starting with the heap you ended up with in part (b), insert values 11 & 2 in that order. Draw the heap...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw the trees that result from the following operations: (a) Inserting 142, 400, 205, 127, 100, 320, 160, 141, and 110 into an initially-empty tree (in that order). (b) Deleting 142 from the tree you drew for part (a). 4. (8 points) Draw the unique binary tree that has a preorder traversal of 4, 1, 6, 3, 7, 5, 9, 2, 8 and an inorder...
Write a Java program, In this project, you are going to build a max-heap using array...
Write a Java program, In this project, you are going to build a max-heap using array representation. In particular, your program should: • Implement two methods of building a max-heap. o Using sequential insertions (its time complexity: ?(?????), by successively applying the regular add method). o Using the optimal method (its time complexity: ?(?), the “smart” way we learned in class). For both methods, your implementations need to keep track of how many swaps (swapping parent and child) are required...
JH: Student Name: 4) Given the following array, do the following (show all the work). A...
JH: Student Name: 4) Given the following array, do the following (show all the work). A (56, 89, 23, 58, 22, 11, 45, 48, 90) (a - 5 pts) Construct a hash table for the given array using the hash function H(K)- K mod 5 (b- 4 pts) Determine the average number of comparisons for a successful search using the hash table of (c -3 pts) What is the worst case number of comparisons for an unsuccessful search in the...
Suppose a binary tree data (in tiny written size) is stored in an array (A) as...
Suppose a binary tree data (in tiny written size) is stored in an array (A) as given below and root is placed at “0”index. Note the array indices are in larger written size (0 to 74). Show the traversal data of the given tree for a) In-Order Traversal b) Post Order Traversal A 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 3 28 13 36 15 9 22 44 7 10 75 33 19 15...
NOTE: Completing the Third Chart is the most
important. This is one question with three parts.
(4 pts) Is the following array-based tree a min-heap or a max-heap or not a heap at all? 85 91 S8 95 100 92 a. Min-heap b. Max-heap c. Not a heap 5 pts) Turn the following array-based binary tree into a max-heap. Show your work step by step. (You will not need all the columns) 34 7 12 47 19 5 pts) Show...
QUESTION 16 Show the first pass of sorting the following array-based binary tree max-heap. In other words, show the first step in sorting, then re-heap the remaining tree into a max-heap. For answers that are not used, put null. You may use scratch paper to draw the trees if you wish. (You will not need all the columns)
(c) Draw the binary heap structure that is equivalent to the following list (the root is first element). [5, 9, 8, 12, 15, 11, 19, 14, 20, 18, 17, 13] [4 marks] (d) Show the resulting tree after the value 6 is added to the heap in the part (c). Note that the binary heap properties must be restored after insertion. Show your working; you may show the data structure in tree or array form. [3 marks]
Question 3. a. Draw the binary min heap represented by the following array: (5 points) 1 2 4 6 7 Value 4 9 12 29 17 14 16 b. Show the result of calling deleteMin twice on the heap you drew in part (a). Show the heap after each deleteMin, and circle the final heap. (5 points) c. Starting with the heap you ended up with in part (b), insert values 11 & 2 in that order. Draw the heap...
3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw the trees that result from the following operations: (a) Inserting 142, 400, 205, 127, 100, 320, 160, 141, and 110 into an initially-empty tree (in that order). (b) Deleting 142 from the tree you drew for part (a). 4. (8 points) Draw the unique binary tree that has a preorder traversal of 4, 1, 6, 3, 7, 5, 9, 2, 8 and an inorder...
JH: Student Name: 4) Given the following array, do the following (show all the work). A (56, 89, 23, 58, 22, 11, 45, 48, 90) (a - 5 pts) Construct a hash table for the given array using the hash function H(K)- K mod 5 (b- 4 pts) Determine the average number of comparisons for a successful search using the hash table of (c -3 pts) What is the worst case number of comparisons for an unsuccessful search in the...
Most questions answered within 3 hours.
-
A junction box contains two trade size 2 raceways on the left
side, and two trade...
asked 28 minutes ago -
Atmospheric Mass
Venus and Earth have about the same mass and radius, but the
atmospheric pressure...
asked 1 hour ago -
5. Discuss the use of fault tree analysis (FTA) for risk
assessment (maximum one paragraph).
asked 2 hours ago -
Given that a sample of aluminium oxide has a Young's modulus of
393 GPa and a...
asked 3 hours ago -
At a certain temperature, the equilibrium constant, Kc, for this
reaction is 53.3.
H2(g)+I2(g)−⇀↽−2HI(g)Kc=53.3
At this...
asked 5 hours ago -
Question1 ) The STL provides similiar classes called stack and
queue, both of which gave functions...
asked 6 hours ago -
For Questions 1-4, assume you have 5 bits available:
1. For (positive) integers: What is the...
asked 6 hours ago -
convert grams into vloume with the density of water being at
.997514 g/cm^3 at 23.1 Celsuis...
asked 8 hours ago -
Foreman company obtained a $20,000, 6% loan on May 1, 2018.
Principal and interest will be...
asked 8 hours ago -
5. Problem 11.05 (Discounted Payback)
eBook
Project L costs $60,000, its expected cash inflows are $14,000
per...
asked 8 hours ago -
1. Which of the following is true about politics and health
organizations?
A. Health organizations are...
asked 9 hours ago -
A space vehicle is coasting at a constant velocity of 18.1 m/s
in the +y direction...
asked 10 hours ago