1. Heap-sort (1+4 points) a. The array int Data[k] shown below contains a heap. (i) Draw a diagram of the initial heap tree. At each node, show the values of both the index k and its content Data[k]. Initial given heap: Index k: 0 1 2 3 4 5 6 7 8 Data[k] 60 55 50 35 40 25 45 20 30 (ii) Draw a diagram of the heap tree and the array contents of Datata[k] after the first and after the second highest maximums are deleted one by one from the initial heap in the heap-sort algorithm. You can briefly describe your solution with diagrams on how you got the answers. Template for the Answers: Heap after the first maximum (60) is removed and placed at the end: DIAGRAM 1 Index 0 1 2 3 Data: 45678 Heap after the second maximum (55) is removed and placed near the end (before 60): DIAGRAM 2 Index 0 0 1 2 3 4 5 6 7 8 Data:
1. Heap-sort (1+4 points) a. The array int Data[k] shown below contains a heap. (i) Draw a diagram of the initial heap tree. At each node, show the values of both the index k and its content Data[k]. Initial given heap: Index k: 0 1 2 3 4 5 6 7 8 Data[k] 60 55 50 35 40 25 45 20 30 (ii) Draw a diagram of the heap tree and the array contents of Datata[k] after the first and after the second highest maximums are deleted one by one from the initial heap in the heap-sort algorithm. You can briefly describe your solution with diagrams on how you got the answers. Template for the Answers: Heap after the first maximum (60) is removed and placed at the end: DIAGRAM 1 Index 0 1 2 3 Data: 45678 Heap after the second maximum (55) is removed and placed near the end (before 60): DIAGRAM 2 Index 0 0 1 2 3 4 5 6 7 8 Data:
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
sample exam problem a bit confused with the concept of heap sort in relations to these problems
![1. Heap-sort (1+4 points)
a. The array int Data[k] shown below contains a heap.
(i)
Draw a diagram of the initial heap tree. At each node, show the values of both the
index k and its content Data[k].
Initial given heap:
Index k: 0
1
2
3
4
5
6
7
8
Data[k] 60
55
50
35
40
25
45
20
30
(ii)
Draw a diagram of the heap tree and the array contents of Datata[k] after the first
and after the second highest maximums are deleted one by one from the initial
heap in the heap-sort algorithm. You can briefly describe your solution with
diagrams on how you got the answers.
Template for the Answers:
Heap after the first maximum (60) is removed and placed at the end:
DIAGRAM 1
Index 0 1 2 3
Data:
45678
Heap after the second maximum (55) is removed and placed near the end (before 60):
DIAGRAM 2
Index 0 0 1 2 3
4
5 6 7 8
Data:](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0e02c446-9367-41d9-9f9b-9aac6cb957ab%2Fd632bd09-d0ab-4c4c-a7b3-78f6c5d674ab%2Fli7815_processed.png&w=3840&q=75)
Transcribed Image Text:1. Heap-sort (1+4 points)
a. The array int Data[k] shown below contains a heap.
(i)
Draw a diagram of the initial heap tree. At each node, show the values of both the
index k and its content Data[k].
Initial given heap:
Index k: 0
1
2
3
4
5
6
7
8
Data[k] 60
55
50
35
40
25
45
20
30
(ii)
Draw a diagram of the heap tree and the array contents of Datata[k] after the first
and after the second highest maximums are deleted one by one from the initial
heap in the heap-sort algorithm. You can briefly describe your solution with
diagrams on how you got the answers.
Template for the Answers:
Heap after the first maximum (60) is removed and placed at the end:
DIAGRAM 1
Index 0 1 2 3
Data:
45678
Heap after the second maximum (55) is removed and placed near the end (before 60):
DIAGRAM 2
Index 0 0 1 2 3
4
5 6 7 8
Data:
Expert Solution
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 1 steps
Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education