Q-1: the array A = {15, 13, 2, 25, 7, 17, 10, 8} will be input to the function BUILD-HEAP: (a) If the elements are counted starting at index 0, A[1] = 15, A[2] = 13 ... give the index of the LAST Internal Node. Note: The book counts from 1, if you count from 0 modify your calculations and indicate that. (b) On p.154 MAX-HEAPIFY( A, 3) accepts two arguments, list all the calls to MAX- HEAPIFY(A, i) that will be called during BUILD-MAX-HEAP execution for the above given array A: Example, the first call is MAX-HEAPIFY( A, 4) what are the subsequent calls? Remember the array index begins at 1, if you calculate instead of 0. (c) For the ARRAY A given above. Modify the code given for PARENT(i) see p.152 to account for Indices starting at 0 instead of 1 and provide the modified code. What value is returned for PARENT(5). If Index 5 then A[5] = 17 for the above array.
Q-1: the array A = {15, 13, 2, 25, 7, 17, 10, 8} will be input to the function BUILD-HEAP: (a) If the elements are counted starting at index 0, A[1] = 15, A[2] = 13 ... give the index of the LAST Internal Node. Note: The book counts from 1, if you count from 0 modify your calculations and indicate that. (b) On p.154 MAX-HEAPIFY( A, 3) accepts two arguments, list all the calls to MAX- HEAPIFY(A, i) that will be called during BUILD-MAX-HEAP execution for the above given array A: Example, the first call is MAX-HEAPIFY( A, 4) what are the subsequent calls? Remember the array index begins at 1, if you calculate instead of 0. (c) For the ARRAY A given above. Modify the code given for PARENT(i) see p.152 to account for Indices starting at 0 instead of 1 and provide the modified code. What value is returned for PARENT(5). If Index 5 then A[5] = 17 for the above array.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Hi type your answer please. Make it neat and readable.
![Analyzing the algorithms of Insertion Sort, Merge Sort, Quick Sort, Heaps and Max-Heaps,
Counting Sorts.
Q-1: the array A = {15, 13, 2, 25, 7, 17, 10, 8} will be input to the function BUILD-HEAP:
(a) If the elements are counted starting at index 0, A[1] = 15, A[2] = 13 ... give the index of the
LAST Internal Node. Note: The book counts from 1, if you count from 0 modify your
calculations and indicate that.
(b) On p.154 MAX-HEAPIFY( A, 3) accepts two arguments, list all the calls to MAX-
HEAPIFY(A, 1) that will be called during BUILD-MAX-HEAP execution for the above
given array A:
Example, the first call is MAX-HEAPIFY( A, 4) what are the subsequent calls?
Remember the array index begins at 1, if you calculate instead of 0.
(c) For the ARRAY A given above. Modify the code given for PARENT(1) see p.152 to account
for Indices starting at 0 instead of 1 and provide the modified code. What value is returned
for PARENT(5). If Index 5 then A[5] = 17 for the above array.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdc767840-1533-4627-9024-21a0ab1cf673%2Fc69cfd81-7c06-412f-a4b9-4e3c6a886799%2Fdfebdak_processed.png&w=3840&q=75)
Transcribed Image Text:Analyzing the algorithms of Insertion Sort, Merge Sort, Quick Sort, Heaps and Max-Heaps,
Counting Sorts.
Q-1: the array A = {15, 13, 2, 25, 7, 17, 10, 8} will be input to the function BUILD-HEAP:
(a) If the elements are counted starting at index 0, A[1] = 15, A[2] = 13 ... give the index of the
LAST Internal Node. Note: The book counts from 1, if you count from 0 modify your
calculations and indicate that.
(b) On p.154 MAX-HEAPIFY( A, 3) accepts two arguments, list all the calls to MAX-
HEAPIFY(A, 1) that will be called during BUILD-MAX-HEAP execution for the above
given array A:
Example, the first call is MAX-HEAPIFY( A, 4) what are the subsequent calls?
Remember the array index begins at 1, if you calculate instead of 0.
(c) For the ARRAY A given above. Modify the code given for PARENT(1) see p.152 to account
for Indices starting at 0 instead of 1 and provide the modified code. What value is returned
for PARENT(5). If Index 5 then A[5] = 17 for the above array.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education