c++ program

Instructions

For this project you will be designing and implementing a system, in either C or C++, to catalogue Pokémon, their various attributes, and their trainers. Your system should act as a database and allow the user to load in multiple tables of data, run basic queries on the data, and then store the data off for later use.

Additionally, sample input files will not be uploaded to Canvas, but can instead be found on the CSE machines at ~jeh0289/public/csce2110/su18/proj2/ You can cd into that directory and copy input the files from there.

For the project you may, if you choose, work in small groups of up to three students. I will need the names of all of the group members emailed to me by no later than midnight (6/5). Any student who is not in one of the groups I receive emails for will be assumed to be working on their own. A list of groups and their members will be posted on Canvas, after it is compiled. A group cannot be changed once created, unless it is completely dissolved. All members of a group will receive the same grade, and all members are expected to contribute equally to the programming and report. Only one submission per group will be required, but a group will not be penalized for having multiple members submit the completed project.

Also, as a reminder, all of the code for this assignment must be written by your group. You may not share code or download solutions off the internet, as doing so will be considered cheating.

Requirements

This assignment has two parts: a design portion and an implementation portion.

Design Document

For the design portion, you must generate documentation, in PDF format, describing your system and design process. The purpose of this is for you to explain not just what your system is doing, and how it is doing it, but why. You will need to justify your design decisions in a concise, informative manner. Justifications such as “I did this because it was easy” are not sufficient, as you should actually explain why a particular data structure or algorithm was more efficient, effective, or optimal. Additionally, commented code, while sometimes helpful in small examples, is not a sufficient explanation in and of itself. Your explanations and justifications are expected to be presented in prose and in paragraph format, i.e. not bulleted lists. Further, part of the evaluation of your design document is the apparent amount of thought and effort that went into its creation.

This document should be divided into four main parts, each with an appropriate header.

In the first part, you should describe your design process. Did you work out the algorithm on paper or a whiteboard before hand? Did you draw UML diagrams of the system? Did you create a small prototype? Did you simply start coding away and then recode once or twice with newfound understanding? In a few paragraphs, describe in detail how you went about designing the system, and be sure to provide sufficient justification of your methodology.

For the second part, you should describe the data structures you used in your system. What, if any, objects or structs did you create to store data? How did you organize and manage them? What types of formal data structures did you make use of (trees, graphs, arrays, hashes, etc)? In a few paragraphs, describe in detail how you stored the various data elements in your system, and be sure to provide sufficient justification of your methodology.

For the third part, you should describe functionality of your system. How is data moved and transformed? How is it read in? How is it output? What are the various major functions you constructed and how do they work? In a few paragraphs, describe in detail how your system works, and be sure to provide sufficient justification of your methodology. You might also consider including diagrams to more easily visualize how all of the pieces fit together.

Implementation

Your program must provide the following functionality and adhere to the following constraints:

ï‚· Allow the user to choose the file describing the initial setup of the database

o The first set of lines in this file will provide a comma delimited pair of a file name and a table name that should be used for the data within that file. There will be one list per line

o The next line will be an empty line

o The remaining lines will be basic operations including INSERT, UPDATE, SEARCH, DELETE, and WRITE

ï‚· For each table file:

o The first line will list the table’s keys

o The second line will list the table’s scheme

o All other lines will be | delimited rows of data to be inserted into the table

ï‚· Each table should be implemented as a hash table with the table’s keys being the key for the row entry.

o You must implement your own hash table and hash function

 You may choose your collision strategy from the strategies we have covered in class

 You may choose your hashing function from the strategies we have covered in class

o You may not use the map, unordered_map, or any other hash table from any of the C/C++ libraries, STL, or Boost libraries

o You may not use the hash function or any other hashing function from any of the C/C++ libraries, STL, or Boost libraries

ï‚· The queries should be implemented in the following way:

o INSERT(string ,string) where the first string is a tuple of values, and second string is the table name

 INSERT should alert the user and not overwrite the data if there is already an entry with that key value

 Otherwise INSERT should add the data to the table

o UPDATE(string ,string) where the first string is a tuple of values, and second string is the table name

 UPDATE should alert the user and not insert the data if there is no entry with that key value

 Otherwise UPDATE should alter the data that key points to o SELECT(string ,string), where the first string is a tuple that can have either a value or * for each component, and second string is the table name

 SELECT should alert the user if no rows match the query

 Otherwise SELECT should output all rows that match the query o DELETE(string ,string) where the first string is a tuple that can have either a value or * for each component, and second string is the table name

 DELETE should alert the user if no rows match the query

 Otherwise DELETE should remove all rows that match the query o WRITE()

 WRITE should write the data in each of the tables to a separate file in the same format they were read in

ï‚· The first line will list the table’s keys

ï‚· The second line will list the table’s scheme

ï‚· All other lines will be | delimited rows of data in the table

 The filename should be the different than the original file name to avoid overwriting

ï‚· Your code must be well commented.

ï‚· You must provide a short README file which includes your name and explains how to compile and run your program.

ï‚· Additionally, you may write a makefile if you want your code to compile with additional flags.

Order from us and get better grades. We are the service you have been looking for.