
CSci 131 -- Algorithms and Data Structures I
Project #1
Due Date: start of class, Feb. 2, 2000
This project depends on Chapters 1 and 2
A. Starting with the package Dates, design, code, and test a child package Dates.IO, which provides terminal and file operations for values of type Dates.Date. You have much flexibility here, because there are many commonly-used external formats for dates. Choose one or more that suit you and design accordingly. Use Rationals and Rationals.IO as a model.
B. The Ada.Calendar package provides a procedure Split, which takes a value of type Calendar.Time and returns its components as OUT parameters. Develop and test an additional procedure Dates.Split which behaves analogously given a value of type Dates.Date.
Note again that all the programs from the book are in the programs directory on the Unix network; this directory becomes visible to you when you have done the setup described in project 0.
What to submit:
You must submit listing (.lsb) files and execution transcripts for the two parts of the project. Use the command turnin to set up a script session for your execution results. In addition, here is the required additional documentation:
Submit, for each part, a test plan as described in Section 2.2, and write a brief report summarizing the results. Be sure to indicate in your test results how they tie back into the plan. This can be done by annotating your test results by hand.