use c++ to Implement a city database using a BST to store the database records. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x- and y-coordinates. The BST should be organized by city name. Your database should allow records to be inserted, deleted by name or coordinate, and searched by name or coordinate. Another operation that should be supported is to print all records within a given distance of a specified point. Collect running-time

Write a program that reads movie data from a CSV (comma separated values) file and output the data in a formatted table. The program first reads the name of the CSV file from the user. The program then reads the CSV file and outputs the contents according to the following requirements: • Each row contains the title, rating, and all showtimes of a unique movie. • A space is placed before and after each vertical separator (I) in each row. • Column 1 displays the movie titles and is left justified with a minimum of 44 characters. . If the movie title has more than 44 characters, output the first 44 characters only. • Column 2 displays the movie ratings and is right justified with a minimum of 5 characters. • Column 3 displays all the showtimes of the same movie, separated by a space. Each row of the CSV file contains the showtime, title, and rating of a movie. Assume data of the same movie are grouped in consecutive rows. Ex: If the input of the program is: movies.csv and the contents of…

Design and implement a simple interactive Book database for library users. Use the attached library.txt file as the book catalog. In addition to building the base, the program should be able to search a particular book title from the database. If a book is not available, users should receive a meaningful message.

Write a program in C++ that prints a sorted phone list from a database of names and phone numbers. The data is contained in two files named "phoneNames.txt" and "phoneNums.txt". The files may contain up to 2000 names and phone numbers. The files have one name or one phone number per line. To save paper, only print the first 50 lines of the output. Note: The first phone number in the phone number file corresponds to the first name in the name file. The second phone number in the phone number file corresponds to the second name in the name file. etc. You will find the test files in the Asn Five.zip

Every data structure that we use in computer science has its weaknesses and strengthsHaving a full understanding of each will help make us better programmers!For this experiment, let's work with STL vectors and STL dequesFull requirements descriptions are found in the source code file Part 1Work with inserting elements at the front of a vector and a deque (30%) Part 2Work with inserting elements at the back of a vector and a deque (30%) Part 3Work with inserting elements in the middle, and removing elements from, a vector and a deque (40%) Please make sure to put your code specifically where it is asked for, and no where elseDo not modify any of the code you already see in the template file This C++ source code file is required to complete this problem

Use the started code provided with QUEUE Container Adapter methods and provide the implementation of a requested functionality outlined below.   This program has to be in c++, and have to use the already started code below.   Scenario: A local restaurant has hired you to develop an application that will manage customer orders.  Each order will be put in the queue and will be called on a first come first served bases. Develop the menu driven  application with the following menu items: Add order Next order Previous order Delete order Order Size View order list View current order Order management will be resolved by utilization of an STL-queue container’s functionalities and use of the following Queue container adapter functions: enQueue:  Adds the order in the queue  DeQueue:  Deletes the order from the queue Peek: Returns the order that is top in the queue without removing it IsEmpty: checks do we have any orders in the queue Size:  returns the number of orders that are in the queue…

Write a C++ program define a vector object and initialize it with 3 values and then define an iterator that points to elements of this object, then ask the user to enter 3 more values and then add them to the previous vector and then print all elements in the vector.

Write a C++ Program using classes, functions (recursive and otherwise), arrays and other C++ commands to sort a file using Selection Sort.  The user will enter the filename.  The file should be sorted by the following fields:  first by Last Name, then by Mother’s Maiden Name, then by First Name and finally by Second Name (or Initial).  The sorted file should be written to file and the first 10 results displayed on screen.   Use the following format for both the screen output and the file created: ----------------------------------------------------------------| Last Name | Mother’s Maiden Name | First Name | Second Name  | ----------------------------------------------------------------|  Saotome  | Tendo                | Ranma      | P            | |---------------------------------------------------------------|  Son      | Kakarot              | Goku       | A            |----------------------------------------------------------------|  Yeager   | Kaiser               | Eren…

Implement a city database using a BST to store the database records. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x- and y-coordinates. The BST should be organized by city name. Your database should allow records to be inserted, deleted by name or coordinate, and searched by name or coordinate. Another operation that should be supported is to print all records within a given distance of a specified point.Collect running-time statistics for each operation. Which operations can be implemented reasonably efficiently (i.e., in O(log n) time in the average case) using a BST? Can the database system be made more efficient by using one or more additional BSTs to organize the records by location?

In C++, a pointer variable is a special kind of data storage. Do you know how to put it to use?