Implement the OBST algorithm which counts the total cost of visiting all the nodes in a tree.  Feel free to get help from other sources. In your OBST implementation, you are going to use the data from the wordcloud created above. Query the strings of your choice using the program developed above. Use wordCloud.words_ variable which is a dictionary class of <"aWord", "aWord frequency probability">.  Below is the list when 'Denver' was queried. {'snow': 1.0, 'coronavirus': 0.7407407407407407, 'Denver Bronco': 0.7407407407407407, 'COVID': 0.6666666666666666, 'Denver': 0.6296296296296297, 'Colorado': 0.6296296296296297, 'New': 0.5925925925925926, 'NFL': 0.48148148148148145, 'will': 0.407407407

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

Python

Please read the directions carefully and make sure to follow it and write the code in python

      • Implement the OBST algorithm which counts the total cost of visiting all the nodes in a tree.  Feel free to get help from other sources.
      • In your OBST implementation, you are going to use the data from the wordcloud created above.
        • Query the strings of your choice using the program developed above.
        • Use wordCloud.words_ variable which is a dictionary class of <"aWord", "aWord frequency probability">.  Below is the list when 'Denver' was queried.

{'snow': 1.0, 'coronavirus': 0.7407407407407407, 'Denver Bronco': 0.7407407407407407, 'COVID': 0.6666666666666666, 'Denver': 0.6296296296296297, 'Colorado': 0.6296296296296297, 'New': 0.5925925925925926, 'NFL': 0.48148148148148145, 'will': 0.4074074074074074, 'year': 0.4074074074074074, 'one': 0.37037037037037035, 'deal': 0.37037037037037035, 'Sunday': 0.37037037037037035, 'wind': 0.3333333333333333, 'Denver Channel': 0.3333333333333333, 'free': 0.2962962962962963, 'pandemic': 0.2962962962962963,, .... }

        • Get the top n (50 perhaps ?) number of words from the query result list
        • Randomly shuffle the n words 
        • Add all n words in the list into the regular BST (from HW5) and compute the total score(cost) of traversing the entire tree weighted by the frequencies (or probability)
        • Now add the same dictionary elements into the OBST and compute the total score of traversing the entire tree weighted by the frequencies (or probability)
        • Compare the costs returned from two different trees.
        • You may run multiple testing with different query words.
      • Write up a summary of your finding from this exercise
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Binomial Heap
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