4. On of the basic operations in heap is delete minimum which deletes the node found on the leftmost part of the heap. 5. Heapify is the procedure for maintaining the heap property when one of the elements of the heap is changed.. 6. A hash function can result in a many-to-one mapping (causing collision).

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

Please answer 4-7

 

I. TRUE OR FALSE. Write the word TRUE if the statement is true or FALSE if the
statement is false. Write your answers on the space provided at the end of each numbers.
1. A heap is a binary tree that is completely filled in all level, that is, from top to bottom.
2 For any element in array position i, the left child is in position (2 + i), where i is the index
of the parent..
3. In a min heap, for every node x, the key in the parent of x is smaller than (or equal to) the
key in x. .
4. On of the basic operations in heap is delete minimum which deletes the node found on
the leftmost part of the heap.
5. Heapify is the procedure for maintaining the heap property when one of the elements of
the heap is changed.
6. A hash function can result in a many-to-one mapping (causing collision)..
7. Collisions can be avoided or prevented by using a "good" hash function.
8. When the key is a string, it must be converted to an integer. One of these string
conversions is option #1. The probiem with this technique is that anagrams will map to
the same index.
9. Radix is a hash function that converts the base-10 integer key into a binary value.
10. Linear probing is the best collision resolution technique. One of the reasons is that
clustering of data can be prevented.
Transcribed Image Text:I. TRUE OR FALSE. Write the word TRUE if the statement is true or FALSE if the statement is false. Write your answers on the space provided at the end of each numbers. 1. A heap is a binary tree that is completely filled in all level, that is, from top to bottom. 2 For any element in array position i, the left child is in position (2 + i), where i is the index of the parent.. 3. In a min heap, for every node x, the key in the parent of x is smaller than (or equal to) the key in x. . 4. On of the basic operations in heap is delete minimum which deletes the node found on the leftmost part of the heap. 5. Heapify is the procedure for maintaining the heap property when one of the elements of the heap is changed. 6. A hash function can result in a many-to-one mapping (causing collision).. 7. Collisions can be avoided or prevented by using a "good" hash function. 8. When the key is a string, it must be converted to an integer. One of these string conversions is option #1. The probiem with this technique is that anagrams will map to the same index. 9. Radix is a hash function that converts the base-10 integer key into a binary value. 10. Linear probing is the best collision resolution technique. One of the reasons is that clustering of data can be prevented.
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Heapsort
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.
Similar questions
  • SEE MORE QUESTIONS
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