in c++

using c++

in c++

d text file, Data Structure: Use existing data structurels) or each part of speech, and each definition s three parts in one String Data Loading: When our program starts, it loads aosed once per u structure. The data source file is ano closed before our program starts interacting wit Data.CS.SFSU.txt store our dictionary's data. Each keyword, create new data structure(s) to must be stored in a separate data field. Do not combine them such as stori all the original data from the data source losed befone data soure fie aars, t loads allthe original data from the data source into our dictionany's data ned once and closed once per run. it must be closed as soon as possible. It must be User Interface: A program interface allows users h users program searches the dictionary's data Identical Output: Our program's nterface allows users to input search keys. This interface then displays returned results. Our outoua.s the dicti (not the data source text file) for values associated with the search keys data put must be identical to the complete sample run's output ASMTO2 PC. Run.pdf be 1. Program Analysis to Program Design, 10 points In 1 full page, please explain the following in detail . Your analysis of the provided the ormation and the provided sample output. Compare to the ASMT 01 Java version. vou are solving. How it is different from that of ASMT 01. a from the data source. What the steps are. Why these steps. cture(s) you use/create for your dictionary. And why. 2. Program Implementation, 25 points Does your program work properly? How will you improve your program? . Sample run (not the complete run): z to be updatea. Updated 2/242019 8 23 PM d text file, Data Structure: Use existing data structurels) or each part of speech, and each definition s three parts in one String Data Loading: When our program starts, it loads aosed once per u structure. The data source file is ano closed before our program starts interacting wit Data.CS.SFSU.txt store our dictionary's data. Each keyword, create new data structure(s) to must be stored in a separate data field. Do not combine them such as stori all the original data from the data source losed befone data soure fie aars, t loads allthe original data from the data source into our dictionany's data ned once and closed once per run. it must be closed as soon as possible. It must be User Interface: A program interface allows users h users program searches the dictionary's data Identical Output: Our program's nterface allows users to input search keys. This interface then displays returned results. Our outoua.s the dicti (not the data source text file) for values associated with the search keys data put must be identical to the complete sample run's output ASMTO2 PC. Run.pdf be 1. Program Analysis to Program Design, 10 points In 1 full page, please explain the following in detail . Your analysis of the provided the ormation and the provided sample output. Compare to the ASMT 01 Java version. vou are solving. How it is different from that of ASMT 01. a from the data source. What the steps are. Why these steps. cture(s) you use/create for your dictionary. And why. 2. Program Implementation, 25 points Does your program work properly? How will you improve your program? . Sample run (not the complete run): z to be updatea. Updated 2/242019 8 23 PM