SYCS-135 INTRODUCTION TO PROGRAMMING
 ASSIGNMENT 10


Due Date for Tues./Thurs: November 30, 2000 (Garuba)
Due Date for Mon./Wed./Fri.: December 1, 2000 (Keeling)

 Problem: the same as Assignment 8 except that the output is to be in the following order:

1. All the applications’ documentation exactly as written in applic.txt.

2. All prior years should be individual years, not totaled. Only print out the years with frequencies > 0.

3. All the frequency counts for each paragraph in a neat tabular format, as illustrated below:

Example Input and Output: If you have the following two paragraphs of documentation:

To modify DEDUCTION_1 to account for Year 2000 compatibility, check for dates 1979-1999 taking into account year 1900. Years before 1979 should be handled using the Y2K routine A, years >= 1979 should be handled using the OLD_1 routines.

To modify DEDUCTION_2 to account for Year 2000 compatibility, check for dates 1979-1999 taking into account year 2000. Years before 1979 should be handled using the Y2K routine A, years >= 1979 should be handled using the OLD_2 routines.

 

The output should look like:

Documentation follows:

To modify DEDUCTION_1 to account for Year 2000 compatibility, check for dates 1979-1999 taking into account year 1900. Years before 1979 should be handled using the Y2K routine A, years >= 1979 should be handled using the OLD_1 routines.

To modify DEDUCTION_2 to account for Year 2000 compatibility, check for dates 1979-1999 taking into account year 2000. Years before 1979 should be handled using the Y2K routine A, years >= 1979 should be handled using the OLD_2 routines.

Frequency Counts per paragraph are:

*************************************************

* Paragraph             Category                Frequency      *

*************************************************

*        1                 Year                               4        *

*        2                 Year                               4        *

*                                                                       *

*        1                 Date                              1        *

*        2                 Date                              1        *

*                                                                       *

*        1                 2000                              2        *

*        1                 1999                              1        *

*        1                 1979                              3         *

*        1                 1900                              1        *

*        2                 2000                              3        *

*        2                 1999                              1        *

*        2                 1979                              3        *

*************************************************

Details: There will be at most 5 paragraphs of documentation.

Special Requirements You must use 2-D arrays in this assignment.

Assignment Submission: On November 29th (Keeling) or November 28th (Garuba) hand in a hard copy of your algorithm in pseudocode, your test oracle and desk-checking calculations, your C++ program compilation listing, and your output obtained from running your program with the external file "applic.txt". SCS users will also submit their programs electronically on November 29th (Garuba) or November 30th (Keeling), see below.

Pseudocode: A 1-page description of your algorithm in pseudocode.

Test Oracle: Write at least 2 additional paragraphs of documentation and use your algorithm to calculate by hand the frequency counts.

Program Documentation: At the top of your source code as a comment, include your name, course number and title, assignment number, and date, followed by a description of the problem. Include comments as necessary throughout your program to illustrate the algorithm, logic of flow, meaning of variables etc. Follow the style guidelines described in class.

Electronic Submission - SCS Laboratory
All C++ program assignments are now to be submitted electronically. Your program will be run using the instructors' data. For Assignment 10, name your C++ program file assign10k.c (for Mon./Wed./Fri - Keeling) or assign10g (for Tues./Thurs.- Garuba) and use one of the following commands to submit your program:
$ Keeling assign10k.c                   (for Mon./Wed./Fri - Keeling)

$ Keeling assign10g.c                    (for Tues./Thurs.- Garuba)

The assignment is to be submitted electronically no later than 10:00pm on Nov. 30, 2000 for Keeling's class and no later then 10:00pm on Nov. 29, 2000 for Dr. Garuba's class. The receiving file will be closed at 10:00pm and no late assignments will be accepted. If before the due dates, you send in a version of your assignment, having already sent in an earlier version, the later version will automatically replace the earlier version in the assignment file.
---------------------------------------------------------
Electronic Submission – via E-mail
If you do not have an SCS account, your program can be submitted via E mail. If you select this mode of submission then you must make sure that you make the subject of your message “assign10.c “ and use the following E mail addresses 

         [email protected] (for Mon./Wed./Fri - Keeling)

         [email protected]  (for Tues./Thurs.- Garuba)

The body of the message should be your source code listing with the program’s output as comments.