Given the following array A, answer all questions 58 72 19 41 33 62 84 1) Show the array A when Build Max Heap (A) is called and indexi- 2 is already executed. 2) Show the array after Build_Max_Heap (A) is executed. 3) If we are to insert 95 what is the value of the variable 'i' at line 1 of Max Heapify (A. i) for the initial call? 4) If we are to insert 95. show the array A at line 1 of Max Heapify (A. i) for the initial call? 5) If we are to insert 95. what is the value of the variable i at line1 of Max Heapify (A, i) after the first recursive call? 6) If we are to insert 95. show the array A once the Max_Heapify (A. i) is terminated.

Given the following array A, answer all questions 58 72 19 41 33 62 84 1) Show the array A when Build Max Heap (A) is called and indexi- 2 is already executed. 2) Show the array after Build_Max_Heap (A) is executed. 3) If we are to insert 95 what is the value of the variable 'i' at line 1 of Max Heapify (A. i) for the initial call? 4) If we are to insert 95. show the array A at line 1 of Max Heapify (A. i) for the initial call? 5) If we are to insert 95. what is the value of the variable i at line1 of Max Heapify (A, i) after the first recursive call? 6) If we are to insert 95. show the array A once the Max_Heapify (A. i) is terminated.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Web technology Question: Professor Don't reject this time....answer it. Q.No.3. Consider the Marks against each students in different subjects Student Names Database Tot Marks : 60 PF Tot Marks : 80 Marketing Tot Marks : 60 Irfan 56 45 59 Salma 67 56 52 Inayat 54 40 48 Basharat 56 53 51 Store these details in the Multidimensional Associative Array. Display the output as shown here S# Student Name Obt: Marks %age= (Obt:Marks / 200) * 100.0 Grade 1 Iranf 160 80 B 2 Salma 175 87 A 3 Inayat 142 71 C 4 Basharat 160 80 B A >80% B (71-80%) C (61-70%) D(51-60%) F<50% Grade Summary Total A Grade = 1 Total B Grade = 2 Total C Grade = 1 Total D Grade = 0 Total F Grade = 0 Add complete set of Screen Shots against all the steps…
Web technology Question: Professor Don't reject this time..answer it according to Question and give all screen shots step by step....this must be solved by PHP. Q.No.3. Consider the Marks against each students in different subjects....Solve by PHP Student Names Database Tot Marks : 60 PF Tot Marks : 80 Marketing Tot Marks : 60 Irfan 56 45 59 Salma 67 56 52 Inayat 54 40 48 Basharat 56 53 51 Store these details in the Multidimensional Associative Array. Display the output as shown here S# Student Name Obt: Marks %age= (Obt:Marks / 200) * 100.0 Grade 1 Iranf 160 80 B 2 Salma 175 87 A 3 Inayat 142 71 C 4 Basharat 160 80 B A >80% B (71-80%) C (61-70%) D(51-60%) F<50% Grade Summary Total A Grade = 1 Total B Grade = 2 Total C Grade = 1 Total…
An element that comprises more than half of the items in an array is referred to as a majority element. Find the dominant element in a list of positive integers. Return -1 if there is no majority element. Execute this in 0(1) space and O(N) time.Input: 1 2 5 9 5 9 5 5 55 outputAn element that comprises more than half of the items in an array is referred to as a majority element. Find the dominant element in a list of positive integers. Return -1 if there is no majority element. Execute this in 0(1) space and O(N) time.Input: 1 2 5 9 5 9 5 5 55 output
Question 4: (30 marks) A Math teacher is teaching Math course to a set of classes (each class may have different number of students) and want to check the behavior of his students in a homework report. The teacher gave the classes the same exam and marked their answer and wants to know the class whose students got the highest average. Help the teacher in the required analysis of student’s marks by implementing a Java program ClassAverageMArks2DimmArray using 2-dimensional array to store the students marks and then compute the average of each class student’s marks. The program has the following specification: • A Method titled averageClassMarks for computing the average (as double) of a class students marks (given to the method as a single-dimensional array) • Another Method titled averageAllClassesMarks for computing the average (as single array of double) of all the classes class student’s marks (given to the method as a 2dimensional array). This method has to repeatedly call the…
Java-.Selection and insertion sort 3.a Show steps of selection sort for the given array. You may need to add more rows to the table. Selection Sort Initial value 3 2 7 5 4 8 9 10 1 Search 0 . . . end 3 2 7 5 4 8 9 10 1 Swap index 0 Search 1 . . . end . . . 3.b Show steps of insertion sort for the given array. You may need to add more rows to the table. Insertion Sort Initial value 3 2 7 5 4 8 9 10 1 , first item is sorted 3 2 7 5 4 8 9 10 1 , first 2 items are…
ALGO1(A)// A is an integer array, an index that starts at 11): for i=1 to n-1 do2): minIndex = findSmallest(A,i)3): exchange A[i] with A[minIndex] The sub-routine find the smallest(A, i) in Line 2, and returns the index of the smallest element in thesub-array A[i:n]Suppose the array below is provided as input to ALGO1 2 5 6 7 3 8 1 4 Fill in the Blanks At the end of the first iteration of the for loop (i.e. with i=1)1) a) the element at index 1 is : b) the element at index 4 is : c) the element at index 7 is :
Extend the Array project to include:16. Define a pointer to a double, pdArray.17. Assign the pointer, pdArray, to contain the address of the double array, dArr:18. Use the array name, dArr, to print out the array elements with subscript notation, [ ]. All on 1 line a space between each.19. Use the pointer to print out the array elements with pointer notation while not changing the pointer itself. Use a for loop. *( pdArray + Cnt1) would be an example. All on 1 line a space between each.20. Use the pointer to print out the array elements with pointer notation but change the pointer to point to the actual array element rather than the method in 18. All on 1 line.*pdArray would do this if the loop has the following post loop operation: pdArray++21. Use the array name for the double array and pointer notation to print the entire array, all on one line.22. Using a different pointer, piArray, allocate enough memory for 100 int's and assign the address to the pointer.23. In a for loop…
Consider the array L = 387, 690, 234 435 567 123 441 as an example. The number of components in this case is 7, the number of numbers is 3, and the radix is 10. This suggests that radix sort would require 10 bins and 3 cycles to complete the sorting. shows how the radix order is followed by the list. Each key is probably thrown into the garbage bin facing down. Each bin is turned into a key when the output to the is to be attached to the phrase: at the end of the bin.
The code below computes the intersection (the number of entries shared by two arrays). It is assumed that neither array contains any duplicates. It computes the intersection by sorting one array (array b) and then iterating over array a to see if each value is in b (through binary search). What is its duration? nt intersection(int[] a, int[] b) {mergesort(b);}int intersect = 0;for (int x : a) {if (binarySearch(b, x) >= 0) {intersect++;return intersect; }}
Solve the following codes below and discuss how array, stack, and queues are used in each problem. Must have comments. 1. Write a python program that takes two three-dimensional numeric datasets andperform elementwise addition. 2. Write a python program that ask a user to enter a n-by-m numeric matrix andperform matrix addition and multiplication. 3. Write a python program that asks user to input 10 positive and negative integers andbe stored in an array of 20 indices, The program will then rearrange the arrayelements so that all negative numbers appear before all positive numbers.
Suppose an array sorted in ascending order is rotated at some pivot unknownto you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element. The complexity must be O(logN)You may assume no duplicate exists in the array."""def find_min_rotate(array): """ Finds the minimum element in a sorted array that has been rotated. """ low = 0 high = len(array) - 1 while low < high: mid = (low + high) // 2 if array[mid] > array[high]: low = mid + 1 else: high = mid return array[low] def find_min_rotate_recur(array, low, high): """ Finds the minimum element in a sorted array that has been rotated. """ mid = (low + high) // 2 if mid == low:.
To start, create your own set of 10 numbers in an array that are not sorted. Using your array, do the following exercises: Show how the Mergesort algorithm sorts your array by: 1) Showing which sub parts of the array are being examined with each recursive call to Mergesort 2) Showing the results of the array each time the Merge function is used Your demonstration should be similar to slides 19-33 in the Mergesort presentation. You do not have to show the details of the function calls in the stack (unless it helps you), but do explain what is happening at each step to show understanding of the algorithm. Using your same original array, show how the Quicksort algorithm sorts this array by: 3) Showing the results of the array each time the Partition function is used 4) Showing which sub parts of the array are being examined with each recursive call to Quicksort Your demonstration should be similar to slides 35-64 in the Quicksort presentation. Again, you do not have to show all the…