From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: * X-Spam-Status: No, score=1.4 required=5.0 tests=BAYES_50,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,86c59bf6e5703a87 X-Google-Attributes: gid103376,public From: "Steve Doiel" Subject: Re: Looking for a programmer Date: 1998/04/04 Message-ID: <35266feb.0@news.pacifier.com>#1/1 X-Deja-AN: 340859018 References: X-MimeOLE: Produced By Microsoft MimeOLE V4.71.1712.3 Newsgroups: comp.lang.ada Date: 1998-04-04T00:00:00+00:00 List-Id: And just how much are you willing to $PAY$ to have someone do your homework assignment for you? Alex wrote in message ... >Hi all I'm looking for a programmer in ada for the following program: >Read from a file the names of authors and titles. >On pair lines are authors name and On Impair lines are name of titles. >There is a line for that authors that wrote a book and on the next line >the name of the title that they wrote. >There can be more than on authors per book. >A line fo authors can contain more than one author name and each of >those name are seperated but on of the folowwing >a) 2 or more spaces ' ' >b) a comma ',' >c) a period '.' >A on title line there is only 1 title per line >Ex: Erickson , Bell Howard > Introduction to computer thory > Ambell,Chamber > Mathematic for computers > >The main program does the folowing: >1) list all titles associated with authors name >Ex: Erickson > Introduction to computer thory > Math and computer Science > >2) list all collaborator associated with authors name >Ex: Erickson: > Bell > Howard > >3) List all title containing a given word >Ex: programmation > programmation skills > Methodes of programmtion > >IMPLEMATNTION: >for every work the program hase to build up a dictionnairy >it is :for every work the authors and title of works >associated with this work >for the storing of title,name and work use a binairy tree; > >====== >if you have any questions You can contact me