Please help me with this code, Im am confused adn dont know where to start.Develop a high-quality, menu-driven object-oriented C++ program that creates a small database, using a binary search tree structure to store and process the data. The database will contain the top 100 highest grossing films of 2017. The C++ object-oriented program must use the BinarySearchTree class When designing and implementing the program, apply good software engineering principles.Your program must include:a Film class that stores all the data for a Film and provides appropriate methods to support good software engineering principles,a FilmDatabase class that stores the binary search tree and provides appropriate methods in support of database queries and reporting using good software engineering principles,an application that interacts with the end-user. The design is up to you and may include any number of classes in support of the given application. A Menu class is strongly recommended. Note that the binary search tree must store Film objects, and the >, <, and == operators must be defined for that class because the BinarySearchTree class uses those overloaded operators.The downloaded files include the Billionaire class (Billionaire.h and Billionaire.cpp), the BillionaireDatabase class (BillionaireDS.h and BillionaireDS.cpp), main.cpp, and makefile for you to use as an example to help you begin your program. The program compiles, links, and executes if you Make it using NetBeans.Data Details:The database contains data pertaining to the 100 highest grossing films of 2017. A comma delimited file named Films2017.csv contains the initial data. Each record is stored on one line of the file in the following format:Data Data typeRank intFilm Title (key)string Studio string Total GrossdoubleTotal Theatersint Opening GrossdoubleOpening TheatersintOpening DatestringEach of the data fields is separated in the file using the comma (,) character as a delimiter. There is no comma (,) character after the last field on the line. The data is considered clean; There are no errors in the input file.When storing the data in the binary search tree, use the data types shown above. The Film Title will serve as the key field. Therefore, an inorder traversal of the BST will produce the Films in order of title.Menu Details:Your application must be menu driven. The menu system consists of a main menu and sub-menus. All menu choices are selected by entering the letter of the desired choice. After a selection is processed, the current menu should be re-displayed. Do NOT use recursion to do this; use a loop. The current menu continues until the X option (return to main menu or exit) is selected.When the application begins, the following main menu should be displayed: MAIN MENU A - About the Application R - Reports S - Search the Database X - Exit the Program Enter Selection -> A - About the ApplicationIf the end-user chooses About the Application, the program provides a detailed description for the user, explaining what the application is doing and how it works. Note that this method does NOT substitute for javadoc-style comments. The audience for this method consists of non-technical users that have no information at all about the assignment.R - ReportsIf the end-user chooses Reports from the MAIN MENU, the program displays the following sub-menu: REPORTS MENU T - Order by Film Title report R - Order by Rank report X - Return to main menu Enter Selection ->If the end-user chooses Order by Film Title report from the REPORTS MENU, the program should do the following:Display a report containing all 100 Films in order by Film Title. This report should contain all the data for each record stored in the binary search tree. The data should be formatted; Dollar figures and numeric data should include $ signs and commas for readability.Identify the report and label all the data displayed appropriately. If the end-user chooses Search by Studio, the program should do the following:1. Request the name of a Studio from the end-user.2. Search the database for an exact match of the studio name.3. Display all records stored in the binary search tree where the studio name matches the name given by the end-user. If there are no records withthe studio name given, report that the requested studio was not found.4. Identify the output and label all the data displayed appropriately.If the user chooses Search by month of release, the program should do the fallowing1. Request a month number between 1 and 12 from the end-user. Only values between 1 and 12 should be accepted.2. Search the database for all records where the release date contains the month requested. Note: the date is stored as a string (Month 1 is stored as Jan.)3. Display all records stored in the binary search tree that match the morith given by the user, If there are no records with the requested release month,report that the requested month was not found.4. Identify the output and label all the data displayed appropriately.If the user chooses Return to main menu, exit the sub-menu and return to the main menu,x- Exit the programIf the end-user chooses Exit the program from the MAIN MENU, the program ends. If the end-user chooses Order by Rank report from the REPORTS MENU, the program should do the following:1. Display a report containing all 100 Films sorted in increasing order by earnings rank from 1 to 100. This report should contain all the data for eachrecord stored in the binary search tree. Note that this does not involve a simple tree traversal. You will need to write code that specifically performs thisfunction. You may assume that the rank is never less than 1 and never greater than 100. Do NOT copy the data into another binary search tree, into anarray, into a linked list, vector or into any other type of data structure. Retrieve the data directly from the binary search tree which is stored in order bythe Film Title. The data should be formatted; Dollar figures and numeric data should include dollar signs and commas for readability.2. Identify the report and label all the data displayed appropriately.If the end-user chooses Return, exit the sub-menu and return to the main menu,S- Search the DatabaseIf the end-user chooses Search the database, the program should display the following sub-menu:Search MENUT- Search by TitleK- Search by Keyword(s)S- Search by StudioM- Search by month of releaseX- Return to main menuEnter Selection-If the end-user chooses Search by Title, the program should do the following1. Request a film title from the end-user.2. Search the database for the title given. This will be an exact match of the flm title and at most, only 1 record will match. A case insensitive searchshould be performed.3. If the film title is found, display the record stored in the binary search tree. Otherwise report that the requested film title was not found.4. Identify the output and label all the data displayed appropriately.If the end-user chooses Search by Keyword(s), the program should do the following1. Request title keywords from the end-user.2. Search the database for all titles that contain the keyword(s). The keywords given represent all or a portion of the title. When multiple keywords aregiven, only titles that contain the keywords in the order given will be selected. For example, it the user enters 'Star Wars, "Rogue One: A Star WarsStory" will be selected as will The Making of Star Wars". However, "One Star, Many Wars" "Once Upon a Star, "Wars" and "Wars with Stars" will not beselected.3. Multiple search keywords may be entered by separating the keywords with a comma. All titles containing one or more of the keywords will be selected.For example, if the user enters 'Cinderella SpongeBob, Dinosaur, "Cinderella", "The Good Dinosaur". "In Search of Dinosaurs", "The SpongeBob Movie:Sponge Out of Water" as well as "Cinderella Loves Dinosaurs and SpongeBobl" will be selected.4. Display all records stored in the binary search tree where the title contains the keywords) given by the user. If there are no records containing thekeywordis), report that the requested keyword(s) were not found.5. Identify the output and label all the data displayed appropriately.

//Movie.cpp //Save this code as movie.cpp #include "stdafx.h" /*stdafx is a type of header file…

Answered: Develop a high-quality, menu-driven…

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

See similar textbooks

Related questions

Concept explainers

Question

Please help me with this code, Im am confused adn dont know where to start.

Develop a high-quality, menu-driven object-oriented C++ program that creates a small database, using a binary search tree structure to store and process the data. The database will contain the top 100 highest grossing films of 2017.

The C++ object-oriented program must use the BinarySearchTree class When designing and implementing the program, apply good software engineering principles.

Your program must include:

a Film class that stores all the data for a Film and provides appropriate methods to support good software engineering principles,
a FilmDatabase class that stores the binary search tree and provides appropriate methods in support of database queries and reporting using good software engineering principles,
an application that interacts with the end-user. The design is up to you and may include any number of classes in support of the given application. A Menu class is strongly recommended.

Note that the binary search tree must store Film objects, and the >, <, and == operators must be defined for that class because the BinarySearchTree class uses those overloaded operators.

The downloaded files include the Billionaire class (Billionaire.h and Billionaire.cpp), the BillionaireDatabase class (BillionaireDS.h and BillionaireDS.cpp), main.cpp, and makefile for you to use as an example to help you begin your program. The program compiles, links, and executes if you Make it using NetBeans.

Data Details:

The database contains data pertaining to the 100 highest grossing films of 2017. A comma delimited file named Films2017.csv contains the initial data. Each record is stored on one line of the file in the following format:

Data	Data type
Rank	int
Film Title (key)	string
Studio	string
Total Gross	double
Total Theaters	int
Opening Gross	double
Opening Theaters	int
Opening Date	string

Each of the data fields is separated in the file using the comma (,) character as a delimiter. There is no comma (,) character after the last field on the line. The data is considered clean; There are no errors in the input file.

When storing the data in the binary search tree, use the data types shown above. The Film Title will serve as the key field. Therefore, an inorder traversal of the BST will produce the Films in order of title.

Menu Details:

Your application must be menu driven. The menu system consists of a main menu and sub-menus. All menu choices are selected by entering the letter of the desired choice. After a selection is processed, the current menu should be re-displayed. Do NOT use recursion to do this; use a loop. The current menu continues until the X option (return to main menu or exit) is selected.

When the application begins, the following main menu should be displayed:

MAIN MENU
A - About the Application
R - Reports
S - Search the Database
X - Exit the Program

Enter Selection ->

A - About the Application

If the end-user chooses About the Application, the program provides a detailed description for the user, explaining what the application is doing and how it works. Note that this method does NOT substitute for javadoc-style comments. The audience for this method consists of non-technical users that have no information at all about the assignment.

R - Reports

If the end-user chooses Reports from the MAIN MENU, the program displays the following sub-menu:

REPORTS MENU
T - Order by Film Title report
R - Order by Rank report
X - Return to main menu

Enter Selection ->

If the end-user chooses Order by Film Title report from the REPORTS MENU, the program should do the following:

Display a report containing all 100 Films in order by Film Title. This report should contain all the data for each record stored in the binary search tree. The data should be formatted; Dollar figures and numeric data should include $ signs and commas for readability.
Identify the report and label all the data displayed appropriately.

If the end-user chooses Search by Studio, the program should do the following:
1. Request the name of a Studio from the end-user.
2. Search the database for an exact match of the studio name.
3. Display all records stored in the binary search tree where the studio name matches the name given by the end-user. If there are no records with
the studio name given, report that the requested studio was not found.
4. Identify the output and label all the data displayed appropriately.
If the user chooses Search by month of release, the program should do the fallowing
1. Request a month number between 1 and 12 from the end-user. Only values between 1 and 12 should be accepted.
2. Search the database for all records where the release date contains the month requested. Note: the date is stored as a string (Month 1 is stored as Jan.)
3. Display all records stored in the binary search tree that match the morith given by the user, If there are no records with the requested release month,
report that the requested month was not found.
4. Identify the output and label all the data displayed appropriately.
If the user chooses Return to main menu, exit the sub-menu and return to the main menu,
x- Exit the program
If the end-user chooses Exit the program from the MAIN MENU, the program ends.

If the end-user chooses Order by Rank report from the REPORTS MENU, the program should do the following:
1. Display a report containing all 100 Films sorted in increasing order by earnings rank from 1 to 100. This report should contain all the data for each
record stored in the binary search tree. Note that this does not involve a simple tree traversal. You will need to write code that specifically performs this
function. You may assume that the rank is never less than 1 and never greater than 100. Do NOT copy the data into another binary search tree, into an
array, into a linked list, vector or into any other type of data structure. Retrieve the data directly from the binary search tree which is stored in order by
the Film Title. The data should be formatted; Dollar figures and numeric data should include dollar signs and commas for readability.
2. Identify the report and label all the data displayed appropriately.
If the end-user chooses Return, exit the sub-menu and return to the main menu,
S- Search the Database
If the end-user chooses Search the database, the program should display the following sub-menu:
Search MENU
T- Search by Title
K- Search by Keyword(s)
S- Search by Studio
M- Search by month of release
X- Return to main menu
Enter Selection-
If the end-user chooses Search by Title, the program should do the following
1. Request a film title from the end-user.
2. Search the database for the title given. This will be an exact match of the flm title and at most, only 1 record will match. A case insensitive search
should be performed.
3. If the film title is found, display the record stored in the binary search tree. Otherwise report that the requested film title was not found.
4. Identify the output and label all the data displayed appropriately.
If the end-user chooses Search by Keyword(s), the program should do the following
1. Request title keywords from the end-user.
2. Search the database for all titles that contain the keyword(s). The keywords given represent all or a portion of the title. When multiple keywords are
given, only titles that contain the keywords in the order given will be selected. For example, it the user enters 'Star Wars, "Rogue One: A Star Wars
Story" will be selected as will The Making of Star Wars". However, "One Star, Many Wars" "Once Upon a Star, "Wars" and "Wars with Stars" will not be
selected.
3. Multiple search keywords may be entered by separating the keywords with a comma. All titles containing one or more of the keywords will be selected.
For example, if the user enters 'Cinderella SpongeBob, Dinosaur, "Cinderella", "The Good Dinosaur". "In Search of Dinosaurs", "The SpongeBob Movie:
Sponge Out of Water" as well as "Cinderella Loves Dinosaurs and SpongeBobl" will be selected.
4. Display all records stored in the binary search tree where the title contains the keywords) given by the user. If there are no records containing the
keywordis), report that the requested keyword(s) were not found.
5. Identify the output and label all the data displayed appropriately.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

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.