A heap is stored using an array as follows:INDEXCONTENTS01234569080 7560783020Show the contents of the array after 85 is inserted into the heap.INDEXCONTENTS01234567

Approach to solving the question:To insert the value 85 into a max heap correctly and solve this…

Answered: A heap is stored using an array as…

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 13RQ: How is an array stored in main memory? How is a linked list stored in main memory? What are their...

See similar textbooks

Similar questions

Two stacks S1 and S2 can be implemented using one array. Write procedures: PopS1(Stack), PushS1(Stack,x), PopS2 (Stack), PushS2(Stack,x). The procedures should not declare an overflow unless every slot in the array is used.
Design a data type that supports the following operations: insert, delete the maximum, and delete the minimum (all in logarithmic time); andfind the maximum and find the minimum (both in constant time). Hint: Use two heaps
Show the array and heap after each step: 1. Add the following: 9 18 37 6 5 2 10 4 2. Remove the following: 10, 6
For the following heap that is stored as an array, for the options, select the choice that correctly answers the questions. 1 234 5 6 16 14 10 8 a) 4 b) 2 c) 5 and 10 a) What is the index for element 8? b) What is the index of the parent for 8? c) What is the index of the left and right children of 8? a) 4 b) 2 c) 8 and 9 789 10 2 4 1 7 9 3 a) 4 b) 1 c) 4 and 1 a) 4 b) 7 c) 1 for the left. There is no right child
In C++ Write a line of code that creates an array for 100 decimal numbers in the heap, then write another line of code to reclaim the used heap memory.
Linux general memory layout includes stack, heap, data, and code. stack memory relations stores local variables heap: dynamic memory for programmer to allocate data: stores global variables, separated into initialized and uninitialized code: stores the code being executed Use the following code to answer the questions that follow #include <stdio.h> #include <stdlib.h> int x; int main(int argc, char *argv[]) { int y=3 printf(": %p\n", main); int* z = malloc(100e6); printf("location of stack: %p\n", &y); return 0; } Where are the possible memory addresses of the above variables? Address Location x y main z *z
C++ PROGRAMMING: HEAPS Using the array-based implementation, complete the heap ADT in the arrayheap.h. void insert(int num) This will insert the num to the heap. This number shall be initially added in the last position and will constantly be compared to its parent and get swapped if the parent is greater. int removeMin() This will remove the root by it being replaced by the last position. Remember to store it to some temporary variable first and return it later. The replaced number will also have to be constantly compared to its children and swapped by the smaller element if it is smaller than the number. int size() This will simply return the number of elements currently in the heap. Given that this is an array, it must also be dynamic. If the array is full when attempting to add an element, increase the capacity of the memory by 50% (rounded up). For instance, the array of capacity 4 is already of size 4, we add 4 * 50% = 2 when we try to add an element. And so, the array…
resizeToMatch main myCirc: Circle public Shape int y 250 int x 100 int int width int height 50 50 radius 25 Stack match: Shape int x int y 5 200 int width int height 60 60 Circle circPtr Circle public Shape int y 200 int x 5 int width int height 60 60 int radius 30 Heap The state of memory is shown just as we enter scope of the resizeToMatch function. The function's intent is to change the dimensions of the current Shape to match those of the parameter Shape. The function is a member function of the Shape class, and Circle is a subclass of Shape. The Circle subclass overrides the Shape resizeToMatch function to also update its radius attribute. Which of the following function calls is a valid way to call the resize ToMatch function. A. (*circptr).resizeToMatch (circptr) B. circPtr->resizeToMatch (circptr) C. myCirc. resizeToMatch (*circptr) D. myCirc->resize ToMatch (*circptr)
int[] sort();// Not quite a heap sort but almost.// This method should make a new array of elements to return, // and the elements in the new array should be the same values // that are in the heap, but in sorted order, smallest to largest.// Start the new returned array at slot 0, so in the returned array// slot 0 will have the smallest element from the heap... and// then up from there.//Min-heap example:// Suppose we have the following min-heap:// 3, 5, 4, 12, 6, 9// sort() would return an array containing 3,4,5,6,9,12. return a new array with the elements from the orignal array in asending order In java language create a method MUST USE A MIN HEAP no using priority queue
int[] sort();// Not quite a heap sort but almost.// This method should make a new array of elements to return, // and the elements in the new array should be the same values // that are in the heap, but in sorted order, smallest to largest.// Start the new returned array at slot 0, so in the returned array// slot 0 will have the smallest element from the heap... and// then up from there.//Min-heap example:// Suppose we have the following min-heap:// 3, 5, 4, 12, 6, 9// sort() would return an array containing 3,4,5,6,9,12. return a new array with the elements from the orignal array in asending order In java language create a method Using a min heap
How is an array stored in main memory? How is a linked list stored in main memory? What are their comparative advantages and disadvantages? Give examples of data that would be best stored as an array and as a linked list.
1.) B = {35, 29, 7, 13,9,15,20} heap size = 7 Do heapify (B,2). Write the values in the array B starting from index 0 to 6?

SEE MORE QUESTIONS

Recommended textbooks for you

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS

A heap is stored using an array as follows: INDEX C ONTENTS 0 1 2 3 4 5 6 90 80 75 60 78 30 20 Show the contents of the array after 85 is inserted into the heap. INDEX CONTENTS 0 1 2 3 4 5 6 7