Go Back   PCMech Forums > Help & Discussion > Software Discussion & Support

Need Some Help? Type Your Keywords Here:

Reply
 
LinkBack Thread Tools Search this Thread Rate Thread Display Modes
Old 08-05-2006, 02:13 PM   #1
Member (2 bit)
 
Join Date: Aug 2006
Posts: 3
Send a message via AIM to blackopal318
Unhappy Computer Programming

If there is anyone who is good at computer programming language (C++), the help on a particular assignment would be much appreciated. It's 3:12 now, but it is due at 5!! PLEASE HELP!!
blackopal318 is offline   Reply With Quote
Old 08-05-2006, 02:14 PM   #2
Ride 'em Cowboy
 
EzyStvy's Avatar
 
Join Date: Dec 1999
Location: Dallas, Tx
Posts: 9,109
Go ahead and ask your questions in case someone comes by and reads it.
__________________
Stand Up 2 Cancer - SU2C
EzyStvy is offline   Reply With Quote
Old 08-05-2006, 02:26 PM   #3
Member (2 bit)
 
Join Date: Aug 2006
Posts: 3
Send a message via AIM to blackopal318
alright well, here are the actual directions for my assignment:

Problem Statement:
The NBA basketball players have decided to start a scholarship fund using the proceeds from their upcoming All-Star game. Develop a menu-driven program to maintain a list of their scholarship recipients. Your program should maintain the awardees in a hash table and should have a menu similar to the following:

1. Add a new awardee
2. Remove an awardee
3. Show an awardee's information
4. Show the entire list of awardees in alphabetical order
5. QUIT

Option 1 means the program will insert an awardee into the hash table. Use the person's social security number as the key. Hash the key by using the first four digits in the social security number.

Hash(SSN) = (first four digits) mod CAPACITY

For example, Hash(358761263) = 3587 mod 100 = 87. Therefore the record with social security number 358761263 will be placed in array position 87.

For Option 2 the program must locate the awardee (by hashing) and then must delete the awardee's record from the hash table. Remember, you must locate the awardee by hashing, not by doing a sequential search from the beginning of the hash table.

For Option 3 the program will locate the awardee (by hashing) and then display the awardee's information (name, ssn, school, etc).

Option 4 means display the information for every awardee in the hash table in alphabetical order. To do this you must place every entry into a separate array and then sort the array. Use either of the sorts we discussed in class (Bubble, Insertion, Selection, QuickSort, MergeSort, ShellSort, Radix). The original hash table remains unchanged.

Use the HashTable class we discussed in class along with the following definition for RecordType. Remember, the the social security number is the key.
struct RecordType {
char firstname[30];
char lastname[30];
char ssn[9];
char school[30];
char phone[12];
};
blackopal318 is offline   Reply With Quote
Old 08-06-2006, 05:04 AM   #4
Member (9 bit)
 
Join Date: Feb 2005
Posts: 392
wow, 2hours left!
reminds me of the old Chinese saying: "Holding Buddha's foot in the last moment"; which roughly translated into English as: "Don't wait until the last minute to do what's needed to done"
others and Me would have helped u if u asked , say, a week or even a day earlier.
__________________
words to live by:
others don't know, I know.
others know, I know more.
others know more, I excel.
one shouldnt read this far; above, is meant as an encouragement, translated from a Chinese Proverb.
"He who angers you conquers you." : Elizabeth Kenny
alfie2 is offline   Reply With Quote
Reply

Bookmarks

Still Need Help? Type Your Keywords Here:


Thread Tools Search this Thread
Search this Thread:

Advanced Search
Display Modes Rate This Thread
Rate This Thread:

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is On
Trackbacks are On
Pingbacks are On
Refbacks are On



All times are GMT -5. The time now is 05:09 PM.
Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2012, vBulletin Solutions, Inc.
SEO by vBSEO 3.6.0 PL2