See Instructions below
Instructions In this assignment, you continue working towards your final Capstone program. Anticipate what could go wrong when your program runs. What type of data goes into your program? Could the user get this data incorrect? For instance, what if they put letters instead of a number? What if they used negative numbers? It’s time to start building exception code for your program. What do you need to anticipate potential crashes in your program? 1. You should now be writing the code for your program and adding in error handling. It will help to plan out the exception handling. 2. Consider that the program should not crash if the following occurs: · What protects bad user inputs? (numbers instead of letters and vice versa) · What if nothing is entered? How is that handled? · Can the user cause your program to divide by zero? · What if the user inputs lower case instead of uppercase and vice versa? (for instance, "y” instead of “Y” for yes response) 3. With the considerations above clarified, use any program that has UML capability to make your flowcharts in UML. 4. Add a paragraph or more talking about your program’s Exception Handling into your initial proposal document and submit this along with the UML graphics. Title the paragraph EXCEPTION HANDLING. 1. Write a program that creates three identical arrays, list1, list2, and list3, of 5000 elements. The program then sorts list1 using bubble sort, list2 using selection sort, and list3 using insertion sort and outputs the number of comparisons and item assignments made by each sorting algorithm. 2. Please use the files and names listed below since your file will have the following components: searchSortAlgorithms.h 3. ZIP and submit the entire project folder with *.sln project file inside to the Assignment Folder. Instructions In this assignment, you continue working towards your final Capstone program. How do you search, sort, and store information, using the lessons we have learned in this module? Demonstrate this in a UML graphic. You may add to your first UML if you are continuing to plan with that one. More than likely, your program will have items stored in an array or array-like storage that need to be sorted. You will need to rearrange them in an order of importance to change the data into information. For instance, as a dance instructor, you may have many dancers in your schedule but arranging them for their appointments would change this data into usable information. In sorting your data, you will find searching important. You may need to look up a dancer that comes to your studio in a list of other potential clients. If your program is small enough, it may not use searching or sorting. If the program was a file browser, there may not be much searching and sorting but parents and other paths would be stored to peek into a folder. If your program is similar to a calculator and there isn't much searching and sorting, then please note this in your assignment submission. Continue to make your program more robust via algorithms or user interface during this assignment. Do turn in a current UML for this assignment. 1. You should now be writing the code that allows your program to sort, search, and store data. 2. Think about the following points: · Does your program store input data? What is it? · Sorting algorithm? · Searching algorithm? · If your program does something alternately, please write this up and submit it. 3. With the considerations above clarified, use any program that has UML capability to make your flowcharts in UML. 4. Add a paragraph or more talking about your program’s Search, Sort, and Storage into your initial proposal document and submit this along with the UML graphics. Title the paragraph SEARCH, SORT, STORAGE.