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
icon
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.
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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Merge Sort
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education