Create the Sample class, which has a constructor that accepts an array p[] of double values as an input and supports the following two operations: Return an index i with a probability of p[i]/T (where T is the total of the numbers in p[]) and alter(i, v) to change the value of p[i] to v. Use a full binary tree with an inferred weight of p[i] for each node. Keep the total weight of all the nodes in its subtree in each node. Pick a random number between 0 and T to obtain a random index and use the cumulative weights to select which branch of the subtree to examine. Change the weights of all nodes on the path from the root to i when updating p[i]. Avoid using explicit pointers. as we do for heaps.
Create the Sample class, which has a constructor that accepts an array p[] of double values as an input and supports the following two operations: Return an index i with a probability of p[i]/T (where T is the total of the numbers in p[]) and alter(i, v) to change the value of p[i] to v. Use a full binary tree with an inferred weight of p[i] for each node. Keep the total weight of all the nodes in its subtree in each node. Pick a random number between 0 and T to obtain a random index and use the cumulative weights to select which branch of the subtree to examine. Change the weights of all nodes on the path from the root to i when updating p[i]. Avoid using explicit pointers. as we do for heaps.
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
do for heaps.Create the Sample class, which has a constructor that accepts an array p[] of double values as an input and supports the following two operations: Return an index i with a probability of p[i]/T (where T is the total of the numbers in p[]) and alter(i, v) to change the value of p[i] to v. Use a full binary tree with an inferred weight of p[i] for each node. Keep the total weight of all the nodes in its subtree in each node. Pick a random number between 0 and T to obtain a random index and use the cumulative weights to select which branch of the subtree to examine. Change the weights of all nodes on the path from the root to i when updating p[i]. Avoid using explicit pointers. as we do for heaps.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
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
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