Appendix B. Schedule of work

MOVING BLOCK FOR EXAMS - 4 WEEKS

Schedule of work
Week	Deliverables	To do
1, 2	(10.4.1999)	FORMULATE SCHEDULE AND IDENTIFY MILESTONES Look at existing CBT packages Decide on implementation of C to use. Look at Pascal version of p.m. functions Decide what is required, and what is feasible in the time LEARN C - afternoons/evenings (wks 2-8) a) tutorial (1 week) b) by developing number matching functn.
3	MINI DESIGN DOCUMENT (for number match)
4, 5, 6		coding (4 weeks) DESIGN OF OTHER FUNCTIONS (5 weeks)
7		coding of number matching function complete
8		review design of number match functn (any changes to full design document?)
9, 10, 11, 12, 13, 14, 15	DESIGN DOCUMENT	Convert design to code (8 weeks)
16, 17, 18	CODING COMPLETE	Tests to include all problems that arose during development. Expected results.
19	TEST RESULTS, FINAL DEMO	Write-up (mainly collation). Analysis of design - rationale. Problems encountered.
20		The way forward
21	FINAL LISTINGS, INTERNAL AND USER DOCUMENTATION	Convert design to code (8 weeks)

THERE WILL BE WEEKLY MEETINGS WITH DR. STANNETT.

SCHEDULE - addenda

Design of number matching function will probably use flow charting techniques. Other function will use a formal method such as VDM or Abstract Data Types (yet to be decided).

There will be ongoing research (weeks 1-9) into pattern matching.

The project will be written up regularly, so final write up should be mostly a matter of collation.

The project is due to finish on 29th September 1989.

Deliverables for week 21 will include a maintenance document. Initial analysis shows that number matching functions are more complex than string matching function, and therefore I intend to proceed with design of general match functions first; I will learn C by working through a tutorial, or manual with worked examples.