![int[] arr ={4, 7, 4, 15, 37, 5, 9, 42, 50, 50}; D. Show what the array representation and tree representation look like after](http://img.homeworklib.com/questions/1e23c6f0-489d-11eb-b219-6f77260fc7e4.png?x-oss-process=image/resize,w_560)
Homework Answers
5. A three-heap with n elements can be stored in an array A, where A[O] contains...
5. A three-heap with n elements can be stored in an array A, where A[O] contains the root of the tree. a) Draw the three-heap that results from inserting 5, 2, 8, 3, 6, 4, 9, 7, 1 in that order into an initially empty three-heap. You do not need to show the array representation of the heap. You are only required to show the final tree, although if you draw intermediate trees. b) Assuming that elements are placed in...
braw the binary min heap that results from inserting 8, 7, 3, 2, 4, 6, 9,...
braw the binary min heap that results from inserting 8, 7, 3, 2, 4, 6, 9, 5, 1 in that order into an initially empty binary min hea p. Show final tree and the array representation of the heap. No need to show the intermediate work. 0 5 6 8 10 12 9. Consi der the binary heap shown below. What would the heap look like after deleteMin operation is performed? Show your work. 13 28 44 61 60 68...
Our 1st new array operation/method is remove. Implement as follows: public static boolean remove( int[] arr,...
Our 1st new array operation/method is remove. Implement as follows: public static boolean remove( int[] arr, int count, int key ) { 1: find the index of the first occurance of key. By first occurance we mean lowest index that contains this value. hint: copy the indexOf() method from Lab#3 into the bottom of this project file and call it from inside this remove method. The you will have the index of the value to remove from the array 2:...
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...
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...
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 ke...
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...
2. Use hashing (solve_with_Hash(int[] array, int k)) Initialize a counter variable to O: Insert a...
2. Use hashing (solve_with_Hash(int[] array, int k)) Initialize a counter variable to O: Insert all elements of array in a hashtable For every element in array: counter0 a. b. c. .Look for array[i] . Look for array [幻 + k in the hash map, if found then increment counter. -k in the hash map, if found then increment counter. Remove arrayli] from hash table. d. return counter For example: Input : array[] {1, 5, 3, 4, 2), k 3 Output:...
[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9,...
[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9, 4, 3). Assuming we call the following function using statement selection sort (int array, 7); Please fill the table to show the changes of the array int_array after each iteration. The first column is filled. void selection_sort (int list[], int list_size) for (int i = 0; i < list size - 1; 1++) int current min = list[1]; int current_min_index-i for (int j -...
Given the following array: int a[8] = {41, 32, 5, 8, 7, 50, 11, 49}; What...
Given the following array: int a[8] = {41, 32, 5, 8, 7, 50, 11, 49}; What does the array look like after the first swap of a Selection Sort in descending order?
Consider the following code segment. int[]arr={1, 2, 3, 4, 5, 6, 7, 8}; for(int k=3; k<arr.length-1;...
Consider the following code segment. int[]arr={1, 2, 3, 4, 5, 6, 7, 8}; for(int k=3; k<arr.length-1; R++ arr[k]-arr[k+1]; What are the contents of arr as a result of executing the code segment? a. {1, 2, 3, 5, 6, 7, 8, 8) b. {2, 2, 4, 5, 6, 7, 8, 8} C. {2, 4, 6, 5, 6, 7, 8,8} d. {4, 2, 4, 4, 6, 7, 8, 8) e. {6, 6, 4, 5, 6, 7, 8, 8} int) arr={7, 2.5, 3.0,...
5. A three-heap with n elements can be stored in an array A, where A[O] contains the root of the tree. a) Draw the three-heap that results from inserting 5, 2, 8, 3, 6, 4, 9, 7, 1 in that order into an initially empty three-heap. You do not need to show the array representation of the heap. You are only required to show the final tree, although if you draw intermediate trees. b) Assuming that elements are placed in...
braw the binary min heap that results from inserting 8, 7, 3, 2, 4, 6, 9, 5, 1 in that order into an initially empty binary min hea p. Show final tree and the array representation of the heap. No need to show the intermediate work. 0 5 6 8 10 12 9. Consi der the binary heap shown below. What would the heap look like after deleteMin operation is performed? Show your work. 13 28 44 61 60 68...
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...
2. Use hashing (solve_with_Hash(int[] array, int k)) Initialize a counter variable to O: Insert all elements of array in a hashtable For every element in array: counter0 a. b. c. .Look for array[i] . Look for array [幻 + k in the hash map, if found then increment counter. -k in the hash map, if found then increment counter. Remove arrayli] from hash table. d. return counter For example: Input : array[] {1, 5, 3, 4, 2), k 3 Output:...
[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9, 4, 3). Assuming we call the following function using statement selection sort (int array, 7); Please fill the table to show the changes of the array int_array after each iteration. The first column is filled. void selection_sort (int list[], int list_size) for (int i = 0; i < list size - 1; 1++) int current min = list[1]; int current_min_index-i for (int j -...
Consider the following code segment. int[]arr={1, 2, 3, 4, 5, 6, 7, 8}; for(int k=3; k<arr.length-1; R++ arr[k]-arr[k+1]; What are the contents of arr as a result of executing the code segment? a. {1, 2, 3, 5, 6, 7, 8, 8) b. {2, 2, 4, 5, 6, 7, 8, 8} C. {2, 4, 6, 5, 6, 7, 8,8} d. {4, 2, 4, 4, 6, 7, 8, 8) e. {6, 6, 4, 5, 6, 7, 8, 8} int) arr={7, 2.5, 3.0,...
Most questions answered within 3 hours.
-
Calculate how many moles of ions are in 1.4 L of 2.9 M KNO2
(aq). Remember...
asked 43 minutes ago -
Experiment:
In the experiment: Mix together 74 g. (92 ml.) of n-butyl
alcohol and 120 g....
asked 1 hour ago -
This Python module will be menu driven
and use conditions to check user input in order...
asked 1 hour ago -
Tip Calculator App
For this project, you will create a tip calculator Android
app. The user...
asked 2 hours ago -
A first order chemical reaction has an energy of activation of
90.0 kJ/mol and a rate...
asked 3 hours ago -
Which statement is not correct?
Mutations change the sequence of nucleotides in DNA.
Mutations can be...
asked 5 hours ago -
An organization is not required to accommodate an employee's
disability when the accommodation would cause "undue...
asked 5 hours ago -
Mojo Mining has a bond outstanding that sells for $2,165 and
matures in 17 years. The...
asked 5 hours ago -
Olympic weightlifter Zoe Smith holds a 58 kg barbell over her
head, 2.1 meters above the...
asked 5 hours ago -
For sample average = 28 and a μ = 17 and a s = 4 and...
asked 5 hours ago -
A
short forward contract that was negotiated some time ago will
expire in three months and...
asked 6 hours ago -
If R = R1L2/L3, what is the measurement error dR based on the
rules of error...
asked 6 hours ago