Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 346 Weeks Ago, 4 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Programming Posted 16 May 2017 My Price 7.00

Write a program for a computer dating service

write a program for a computer dating service. Each client gives you his or her name, phone number, and a list of interests. It is your job to maintain lists of men and women using the service and to match up the compatible couples. You will find more details about the assignment, including the inputs, outputs, and deliverables in the course environment.

Input

Data about current clients should be on file "Clients.mf". For each current client, the file contains the following information:

Sex 1 character, 'M' or 'F'

Name up to 20 characters, followed by comma

Phone Number 8 characters

Number of Interests an integer

List of Interests 10 characters each separated by commas with a period after the final interest.

Match up to 20 characters, followed by end-of-line.

From the keyboard: The user may enter on of the following commands.

Command

Processing

NEWCLIENT

Add the client to the appropriate list by storing the appropriate information. Attempt to match this new client with a member of the opposite sex. A match occurs when the clients have three or more of the same interests. (You only have to find the first match for each new client.) Make sure you then designate both persons as matched, as described in the section on data structures above. Print the name of the new client, the name of his or her match, and both phone numbers. If no match is found, print an appropriate message.

UNMATCH

Unmatch this name with his or her current match by removing from the matched person.

PRINTMATCH

Print a list of all matched pairs.

PRINTFREE

Print the names and phone numbers of clients who are not currently matched.

QUIT

Stop processing

Output

Echo print all screen input and output on file "Dates.out."

Data Structures

The problem requires you to maintain two lists of clients, one for men and one for women. When a new client is added to the list, he or she is added to the end of the appropriate list.

Each list element must include all the information for one client: name, phone number, number of interests (maximum number is 10), interests, and the name of this client's current match (empty string if not matched). You must use one of the list classes developed in Chapter 3.

Deliverables

Your design.

A listing of your program

A listing of your test plan as input to the program

A listing of the output file

Answers

Alpha Geek
(8)
Status NEW Posted 16 May 2017 09:05 AM My Price 7.00

-----------

Attachments

file 1494928255-Answer.docx preview (442 words )
w-----------rit-----------e a----------- pr-----------ogr-----------am -----------for----------- a -----------com-----------put-----------er -----------dat-----------ing----------- se-----------rvi-----------ce.----------- Ea-----------ch -----------cli-----------ent----------- gi-----------ves----------- yo-----------u h-----------is -----------or -----------her----------- na-----------me,----------- ph-----------one----------- nu-----------mbe-----------r, -----------and----------- a -----------lis-----------t o-----------f i-----------nte-----------res-----------ts.----------- It----------- is----------- yo-----------ur -----------job----------- to----------- ma-----------int-----------ain----------- li-----------sts----------- of----------- me-----------n a-----------nd -----------wom-----------en -----------usi-----------ng -----------the----------- se-----------rvi-----------ce -----------and----------- to----------- ma-----------tch----------- up----------- th-----------e c-----------omp-----------ati-----------ble----------- co-----------upl-----------es.----------- Yo-----------u w-----------ill----------- fi-----------nd -----------mor-----------e d-----------eta-----------ils----------- ab-----------out----------- th-----------e a-----------ssi-----------gnm-----------ent-----------, i-----------ncl-----------udi-----------ng -----------the----------- in-----------put-----------s, -----------out-----------put-----------s, -----------and----------- de-----------liv-----------era-----------ble-----------s i-----------n t-----------he -----------cou-----------rse----------- en-----------vir-----------onm-----------ent-----------. -----------Inp-----------ut ----------- Da-----------ta -----------abo-----------ut -----------cur-----------ren-----------t c-----------lie-----------nts----------- sh-----------oul-----------d b-----------e o-----------n f-----------ile----------- &q-----------uot-----------;Cl-----------ien-----------ts.-----------mf&-----------quo-----------t;.-----------
Not Rated(0)