Assignment #9 - September 23^rd – due September 28^th

Required

1. Read about the Ada programming language in chapter 2 of our text.
2. Download an Ada compiler and run a sample program. If you find a good URL, e-mail it to me and I will post it on our URL page.
3. Answer the the grammar question linked here and solve it. It is to be turned in.
4. Answer the questions on the linked page for Pascal. Type your answers onto the page and then print it out to turn in. Note that there are 20 questions you need to determine the answers to and that you must attach printouts of the code snippets that you used to verify your answers (with the output produced) for any 3 of them. Come prepared to discuss your results.
5. Write a Pascal program which will determine whether two words of 5 or fewer characters are anagrams of each other.
1. Note 1: anagrams are words which contain the exact same letters although not necessarily in the same order.
2. Note 2: strings in standard Pascal must be declared as packed arrays of characters.
6. If you are in the 5pm section that got interrupted, you will find the program on using pointers in Pascal outside my door. Please pick one up and study it. If you are in the 3:30 section you should have received a copy in class.
7. If you are in the 3:30 pm section and you inadvertently got back a folder with your Pascal program in it instead of one with the output from your 3^rd FORTRAN program, please slide the folder under my door by noon Monday.
8. if you follow this link you will see sample data files that your program (4. above) should handle

Optional:

After you have downloaded your Ada compiler, download Adagide or Jgrasp (useful IDEs for Ada)