![Problem 4: [2056] Consider the mattan which is represented by the array A. Show the max heap in A after a heap deletion opera](http://img.homeworklib.com/questions/f38cf610-d453-11ea-b716-85e7e3c3d02d.png?x-oss-process=image/resize,w_560)
Homework Answers
Add Answer to:
Problem 4: [2056] Consider the mattan which is represented by the array A. Show the max...
please answer all parts and code thanks . - PART 1-Introduction to Sorting, 21 points Use...
please answer all parts and code thanks
. - PART 1-Introduction to Sorting, 21 points Use this array of integer for the problems 1A, 1B, and 1c: 9 57 8324761 Each of these problems is worth 3 points A. Show the contents of the array each time a selection sort changes it while sorting the array into B. Show the contents of the array each time an insertion sort changes it while sorting C. Show the contents of the array...
1. Consider the following unordered list: 20, 35, 25, 10, 40, 50, 45. Perform heap sort...
1. Consider the following unordered list: 20, 35, 25, 10, 40, 50, 45. Perform heap sort to sort this list in nondecreasing (ascending) order. a. Perform the bottom-up method to arrange these values into a max heap. Show the heapify operations on each relevant subtree. (10 points) b. Show the tree representation and the array representation of these numbers after every dequeue operation. Remember that dequeue does not delete a number. Dequeue will instead remove that number from the heap...
SECTION B (4 QUESTIONS, 90 MARKS) Question 4. [32 marks in total] For this question, assume the definition of Java clas...
SECTION B (4 QUESTIONS, 90 MARKS) Question 4. [32 marks in total] For this question, assume the definition of Java class Heap given in the Appendix. The heaps referred to in this question are all maxHeaps. a. (5 marks) Insert into an empty (binary) heap the values 35, 4, 72, 36, 49, 50. Draw all intermediate steps b. (3 marks) Carry out one deletion operation on the final heap in (a.) above. c. (2 marks) Give the worst-case time complexity...
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...
Use C++ (2D Array) Write a program which: 1. Assigns data given below into the 2D...
Use C++ (2D Array) Write a program which: 1. Assigns data given below into the 2D array of integers which is 10x10. 2. Prints out the contents of the 2D array after assigning the data to make sure correct data was assigned. 3. Figures out and prints out the square root of the sum of ALL the elements in the 2D array. 4. Figures out and prints out the average of ALL THE ELEMENTS in the 2D array. 5. Figures...
Write a C or C++ program A6p2.c[pp] that accepts one command line argument which is an integer n between 2 and 4 inclusive. Generate 60 random integers between 1 and 39 inclusive and store them in a 5 by 12 two dimensional integer array (e.g.,int a[5][12]
1. Write a C or C++ program A6p2.c[pp] that accepts one command line argument which is an integer n between 2 and 4 inclusive. Generate 60 random integers between 1 and 39 inclusive and store them in a 5 by 12 two dimensional integer array (e.g.,int a[5][12];). Use pthread to create n threads to convert all 60 array elements modulo 11 (i.e. take the remainder after division by 11) in place. You should divide this update task among the n threads as evenly as possible. Print the array both before and after...
LAB 4: JavaScript Loops Part I) 1) Make an array of colors, instead of responses, call...
LAB 4: JavaScript Loops Part I) 1) Make an array of colors, instead of responses, call it colors. Color names go inside quotes, i.e. "red". 2) Copy the line of the var randomNum, but instead of looking at the length of responses, look at the length of your colors array. 3) Declare a variable myColor below the randomNum variable declaration. 4) Save a randomly chosen color into the variable myColor. colors[randomNum] picks a random color from the array. Save...
Write the C program, to achieve as shown in the sample code execution, using the given...
Write the C program, to achieve as shown in the sample code execution, using the given struct and using the comments in the given main program below: typedef struct{ char first[20]; char last[20]; float gpa; int score; } student; int main(void){ student *ptr; //first name //last name //student gpa //student score } //ask a user to enter the number of students, num //dynamically allocate memory for an array of students of the appropriate size (i.e. //num that the user just...
Status Topic Interfaces Description Video Scene Problem Consider a video scene in which we want to...
Status Topic Interfaces Description Video Scene Problem Consider a video scene in which we want to display several different types (classes) of objects. Let's say, we want to display three objects of type Deer, two objects of type Tree and one object of type Hill. Each of them contains a method called display. We would like to store their object references in a single array and then call their method display one by one in a loop. However, in Java,...
please answer all parts and code thanks
. - PART 1-Introduction to Sorting, 21 points Use this array of integer for the problems 1A, 1B, and 1c: 9 57 8324761 Each of these problems is worth 3 points A. Show the contents of the array each time a selection sort changes it while sorting the array into B. Show the contents of the array each time an insertion sort changes it while sorting C. Show the contents of the array...
1. Consider the following unordered list: 20, 35, 25, 10, 40, 50, 45. Perform heap sort to sort this list in nondecreasing (ascending) order. a. Perform the bottom-up method to arrange these values into a max heap. Show the heapify operations on each relevant subtree. (10 points) b. Show the tree representation and the array representation of these numbers after every dequeue operation. Remember that dequeue does not delete a number. Dequeue will instead remove that number from the heap...
SECTION B (4 QUESTIONS, 90 MARKS) Question 4. [32 marks in total] For this question, assume the definition of Java class Heap given in the Appendix. The heaps referred to in this question are all maxHeaps. a. (5 marks) Insert into an empty (binary) heap the values 35, 4, 72, 36, 49, 50. Draw all intermediate steps b. (3 marks) Carry out one deletion operation on the final heap in (a.) above. c. (2 marks) Give the worst-case time complexity...
Most questions answered within 3 hours.
-
What is facilitated diffusion and how does it differ from
symport and antiport transportation? How do...
asked 26 minutes ago -
if a firm producing 100 units at $5.00 each experience
an 80% experience curve, what will...
asked 1 hour ago -
A solid, uniform disk of radius 0.250 m and mass 53.7 kg rolls
down a ramp...
asked 3 hours ago -
Given the following table of high speed internet access vs.
annual home income:
Home Income
%...
asked 3 hours ago -
A baseball batter hits a 0.145kg baseball straight up into the
air. The baseball leaves the...
asked 4 hours ago -
An FM modulator is tested using
single-tone baseband signal with frequency of 50kHz and a sprectrum...
asked 4 hours ago -
Write the ionic equations for the first stage of salts
hydrolysis.
Anion, Cation?
Na2S
NiSO4
K2SO4...
asked 6 hours ago -
suppose there is a normally distributed population with a mean of
250 and a standard deviation...
asked 6 hours ago -
Question Three
Suppose you as project manager are using the Waterfall
development methodology on a large...
asked 7 hours ago -
Which statement is not true about welfare in Canada?
A.Benefits typically vary based on one's ability...
asked 8 hours ago -
Please help me with FLOWCHART and UML diagram for class,
thank you!
#include <iostream>
#include <fstream>...
asked 9 hours ago -
3. Describe the “logic circuit” of the Lac operon. Which
proteins are bound or not to...
asked 9 hours ago