Show Bid Request
Linked List
Bid Request Id: 5544
|
|
|
|
Posted by: |
seatiger74 (25 ratings)
(Software buyer rating 10 )
|
|
Non-action Ratio: |
Very Good - 3.23%
|
Buyer Security Verifications: |
Good
|
|
Approved on: |
Nov 26, 2001
10:46:08 PM EDT
|
|
Bidding Closes: |
Dec 10, 2001
10:46:49 PM EDT
|
|
Viewed (by coders): |
473 times
|
|
|
|
|
Description:
Programming I -- Assignment 6
Linked Lists
Write in C++ (using VC++6.0)
This assignment involves writing some code that deals with a data structure
called a 'linked list'. Conceptually, a linked list is simply a sequence of
'data nodes' (each node containing some piece of information) that are linked
together by pointers. We have a pointer called 'head' that points to the first
such node, which contains a pointer to the next, etc. Conceptually, we have:
head --> NODE 1 --> NODE 2 --> NODE 3 --> ... --> NODE N
where the last NODE has a null pointer coming out to indicate the end of the
list.
Your assignment #6 is to set up a computerized doctor appointment schedule
for one arbitrary day. Times will be stored as integer military times,
as in 800 for 8 am, 1645 for 4:45 pm, etc. Available appointment times
are any multiple of 15 minutes from 800 to 1645 (open 8 to 5). When you
run your program, you pretend to be a secretary taking appointment calls
(all for the next day, to make it simple). Customers can call in to either
schedule an appointment or to cancel one. The information you will store
about each appointment (i.e., what goes into "struct some_type") is :
1. customer name -- (for simplicity, just use last names, length 15)
2. time (as described above)
3. problem -- (a string of length 50 briefly describing customer's problem)
All this goes into your linked list of structs, ordered by appointment time.
If a customer requests a time that is already being used, they must try a
different time (thus, your insert routine needs to be altered a little to
accomodate this). If the customer requests a time that is not a multiple of
15, round it up to the nearest such (and require it to be in the range 800 to
1645). If a customer calls to cancel an appointment, ask for the name, and
search BY NAME to find the right appointment, then delete it.
Note: Times must be carefully handled; you probably will want to break
up a time such as 1445 into hrs = 14, min = 45 in order to work with it.
If you leave it as 1445 and check to see if it is divisible by 15, it turns
out not to be!
Also include a routine to traverse the whole linked list (schedule), such
that all the information is printed, in a reasonably neat format.
When you actually run the program, insert at least 10 appointments, show
that your delete works, and finally do a traversal to print out the final
schedule.
Deliverables:
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.
Special Conditions / Other:
12/01/01 Sat
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
This bid was accepted by the buyer!
|
$10 (USD)
|
Nov 26, 2001
11:35:17 PM EDT
|
6.92
(Good)
|
|
|
| I can have this done and fully tested by the due date. |
|
|
|
|
|
|