This project involves taking a file and running multiple calculations on the file by converting the file's ASCII to binary. Using the binary as a decimal number while keeping it in its binary form we run multiple calculations and save results that can be used to return to the original binary form and back into its ASCII form. More details below.
Once the binary has been obtained several steps must be followed to end up with the results that I am looking for.
[url removed, login to view] is selected
[url removed, login to view] is made
[url removed, login to view] number may have zeros in front of the number. If this is the case count out the zeros until the first one shows up. We would take the zeros in front out and store the number of zero's in the results.
4.A screen should display the number of digits of the binary number with a text box for number entry. The number you enter will be the number of digits for a number comprised entirely of nines.
[url removed, login to view] now run a modulo operation on the binary number with the newly constructed 9 number. The results of this mod will be saved in the results.
[url removed, login to view] an option should pop up wether this step should be ran or not. The idea behind the option is we take the binary number and subtract the 9 number. Until the results is at least one digit less then the binary number we repeat subtracting the 9 number counting everytime a result produces a number comprised entirely of zeros and ones. This number will save into the results.
[url removed, login to view] result will be saved as a text document. The document should have the name of the orginal file with alt at the end of the name. So if I had a file called "abc" the results would save as "[url removed, login to view]". The results should have the number of digits in the orginal binary number, The amount of digits in the 9 number, the mod results, number of 0s in front of the binary number if any, and the number of times 0 and 1 only numbers appeared if any in reference to step 6.
Now for the second function of this program. Turning the number back.
[url removed, login to view] file is selected
[url removed, login to view] into acount how many digits the binary number had we multiply the 9 number by a number that will bring the results number of digits close to the binary number.
[url removed, login to view] the results from above and add the mod results.
[url removed, login to view] all these add the 9 number until the results number of digits is equal to the binary number.
[url removed, login to view] the above criteria is reached we check to see if all the numbers in the result is 1 and 0s. If they are and there was no 1 and 0 numbers we counted then things are done. If there were 1 and 0 numbers we continue until we have reached the right 1 and 0 numbers.
[url removed, login to view] there was any zeros in front of the binary number orginally they are added back.
[url removed, login to view] back to orginal form and restore the file back to its file type.
This is the whole project. Looking to work on files as big as a few GB but can work on smaller depending on what can be shown. If you have any questions please let me know.